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_14-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 16:18:32,135 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 16:18:32,137 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 16:18:32,149 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 16:18:32,149 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 16:18:32,150 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 16:18:32,152 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 16:18:32,154 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 16:18:32,156 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 16:18:32,157 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 16:18:32,158 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 16:18:32,159 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 16:18:32,159 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 16:18:32,160 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 16:18:32,161 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 16:18:32,163 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 16:18:32,163 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 16:18:32,164 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 16:18:32,166 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 16:18:32,168 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 16:18:32,169 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 16:18:32,170 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 16:18:32,171 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 16:18:32,172 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 16:18:32,174 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 16:18:32,175 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 16:18:32,175 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 16:18:32,176 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 16:18:32,176 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 16:18:32,177 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 16:18:32,177 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 16:18:32,178 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 16:18:32,179 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 16:18:32,179 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 16:18:32,181 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 16:18:32,181 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 16:18:32,181 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 16:18:32,182 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 16:18:32,182 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 16:18:32,183 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 16:18:32,183 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 16:18:32,184 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-16 16:18:32,200 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 16:18:32,200 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 16:18:32,201 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-16 16:18:32,201 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-16 16:18:32,202 INFO L138 SettingsManager]: * Use SBE=true [2019-09-16 16:18:32,202 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 16:18:32,202 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 16:18:32,202 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-16 16:18:32,203 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 16:18:32,203 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 16:18:32,203 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 16:18:32,203 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 16:18:32,203 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 16:18:32,204 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 16:18:32,204 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 16:18:32,204 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-16 16:18:32,204 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 16:18:32,204 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 16:18:32,205 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 16:18:32,205 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-16 16:18:32,205 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-16 16:18:32,205 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 16:18:32,206 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 16:18:32,206 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 16:18:32,206 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-16 16:18:32,206 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-16 16:18:32,206 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 16:18:32,206 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-16 16:18:32,207 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 16:18:32,236 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 16:18:32,248 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 16:18:32,252 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 16:18:32,253 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 16:18:32,254 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 16:18:32,254 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_14-1.c [2019-09-16 16:18:32,316 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10a8c5ff9/0098cae192134d19ae905e56341e5096/FLAGe509857dc [2019-09-16 16:18:32,769 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 16:18:32,770 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_14-1.c [2019-09-16 16:18:32,781 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10a8c5ff9/0098cae192134d19ae905e56341e5096/FLAGe509857dc [2019-09-16 16:18:33,120 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10a8c5ff9/0098cae192134d19ae905e56341e5096 [2019-09-16 16:18:33,135 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 16:18:33,136 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 16:18:33,138 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 16:18:33,138 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 16:18:33,142 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 16:18:33,143 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:18:33" (1/1) ... [2019-09-16 16:18:33,146 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cca2c2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:18:33, skipping insertion in model container [2019-09-16 16:18:33,146 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:18:33" (1/1) ... [2019-09-16 16:18:33,154 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 16:18:33,181 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 16:18:33,426 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:18:33,431 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 16:18:33,552 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:18:33,570 INFO L192 MainTranslator]: Completed translation [2019-09-16 16:18:33,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:18:33 WrapperNode [2019-09-16 16:18:33,570 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 16:18:33,571 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 16:18:33,571 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 16:18:33,571 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 16:18:33,581 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:18:33" (1/1) ... [2019-09-16 16:18:33,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:18:33" (1/1) ... [2019-09-16 16:18:33,587 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:18:33" (1/1) ... [2019-09-16 16:18:33,587 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:18:33" (1/1) ... [2019-09-16 16:18:33,594 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:18:33" (1/1) ... [2019-09-16 16:18:33,603 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:18:33" (1/1) ... [2019-09-16 16:18:33,606 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:18:33" (1/1) ... [2019-09-16 16:18:33,611 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 16:18:33,612 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 16:18:33,612 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 16:18:33,612 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 16:18:33,613 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:18:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 16:18:33,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 16:18:33,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 16:18:33,668 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 16:18:33,668 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 16:18:33,668 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 16:18:33,668 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 16:18:33,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 16:18:33,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 16:18:34,114 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 16:18:34,114 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-16 16:18:34,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:18:34 BoogieIcfgContainer [2019-09-16 16:18:34,116 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 16:18:34,117 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 16:18:34,117 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 16:18:34,120 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 16:18:34,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 04:18:33" (1/3) ... [2019-09-16 16:18:34,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b9e9876 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:18:34, skipping insertion in model container [2019-09-16 16:18:34,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:18:33" (2/3) ... [2019-09-16 16:18:34,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b9e9876 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:18:34, skipping insertion in model container [2019-09-16 16:18:34,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:18:34" (3/3) ... [2019-09-16 16:18:34,124 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_14-1.c [2019-09-16 16:18:34,134 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 16:18:34,143 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 16:18:34,160 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 16:18:34,193 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-16 16:18:34,193 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 16:18:34,194 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-16 16:18:34,194 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 16:18:34,194 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 16:18:34,194 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 16:18:34,194 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 16:18:34,194 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 16:18:34,195 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 16:18:34,212 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2019-09-16 16:18:34,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-16 16:18:34,218 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:34,218 INFO L407 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-09-16 16:18:34,221 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:34,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:34,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1694520263, now seen corresponding path program 1 times [2019-09-16 16:18:34,227 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:34,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:34,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:34,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:34,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:34,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:34,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:34,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:34,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:34,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:34,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:34,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:34,472 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 3 states. [2019-09-16 16:18:34,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:34,571 INFO L93 Difference]: Finished difference Result 111 states and 198 transitions. [2019-09-16 16:18:34,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:34,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-16 16:18:34,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:34,586 INFO L225 Difference]: With dead ends: 111 [2019-09-16 16:18:34,587 INFO L226 Difference]: Without dead ends: 96 [2019-09-16 16:18:34,591 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:34,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-16 16:18:34,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 66. [2019-09-16 16:18:34,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-16 16:18:34,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 121 transitions. [2019-09-16 16:18:34,646 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 121 transitions. Word has length 24 [2019-09-16 16:18:34,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:34,647 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 121 transitions. [2019-09-16 16:18:34,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:34,648 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 121 transitions. [2019-09-16 16:18:34,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-16 16:18:34,649 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:34,649 INFO L407 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-09-16 16:18:34,650 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:34,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:34,650 INFO L82 PathProgramCache]: Analyzing trace with hash 106172361, now seen corresponding path program 1 times [2019-09-16 16:18:34,650 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:34,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:34,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:34,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:34,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:34,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:34,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:34,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:34,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:34,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:34,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:34,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:34,755 INFO L87 Difference]: Start difference. First operand 66 states and 121 transitions. Second operand 3 states. [2019-09-16 16:18:34,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:34,793 INFO L93 Difference]: Finished difference Result 157 states and 292 transitions. [2019-09-16 16:18:34,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:34,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-16 16:18:34,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:34,796 INFO L225 Difference]: With dead ends: 157 [2019-09-16 16:18:34,797 INFO L226 Difference]: Without dead ends: 96 [2019-09-16 16:18:34,798 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:34,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-16 16:18:34,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2019-09-16 16:18:34,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-09-16 16:18:34,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 173 transitions. [2019-09-16 16:18:34,812 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 173 transitions. Word has length 24 [2019-09-16 16:18:34,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:34,813 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 173 transitions. [2019-09-16 16:18:34,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:34,813 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 173 transitions. [2019-09-16 16:18:34,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-16 16:18:34,814 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:34,815 INFO L407 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-09-16 16:18:34,815 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:34,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:34,816 INFO L82 PathProgramCache]: Analyzing trace with hash 990732685, now seen corresponding path program 1 times [2019-09-16 16:18:34,816 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:34,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:34,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:34,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:34,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:34,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:34,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:34,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:34,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:34,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:34,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:34,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:34,866 INFO L87 Difference]: Start difference. First operand 94 states and 173 transitions. Second operand 3 states. [2019-09-16 16:18:34,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:34,893 INFO L93 Difference]: Finished difference Result 144 states and 261 transitions. [2019-09-16 16:18:34,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:34,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-16 16:18:34,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:34,895 INFO L225 Difference]: With dead ends: 144 [2019-09-16 16:18:34,895 INFO L226 Difference]: Without dead ends: 99 [2019-09-16 16:18:34,896 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:34,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-16 16:18:34,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2019-09-16 16:18:34,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-09-16 16:18:34,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 175 transitions. [2019-09-16 16:18:34,907 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 175 transitions. Word has length 25 [2019-09-16 16:18:34,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:34,908 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 175 transitions. [2019-09-16 16:18:34,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:34,908 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 175 transitions. [2019-09-16 16:18:34,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-16 16:18:34,909 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:34,909 INFO L407 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-09-16 16:18:34,910 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:34,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:34,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1003412021, now seen corresponding path program 1 times [2019-09-16 16:18:34,910 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:34,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:34,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:34,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:34,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:34,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:34,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:34,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:34,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:34,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:34,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:34,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:34,966 INFO L87 Difference]: Start difference. First operand 97 states and 175 transitions. Second operand 3 states. [2019-09-16 16:18:35,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:35,005 INFO L93 Difference]: Finished difference Result 184 states and 336 transitions. [2019-09-16 16:18:35,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:35,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-16 16:18:35,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:35,008 INFO L225 Difference]: With dead ends: 184 [2019-09-16 16:18:35,008 INFO L226 Difference]: Without dead ends: 182 [2019-09-16 16:18:35,009 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:35,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-16 16:18:35,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 128. [2019-09-16 16:18:35,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-09-16 16:18:35,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 232 transitions. [2019-09-16 16:18:35,030 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 232 transitions. Word has length 25 [2019-09-16 16:18:35,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:35,031 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 232 transitions. [2019-09-16 16:18:35,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:35,031 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 232 transitions. [2019-09-16 16:18:35,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-16 16:18:35,033 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:35,033 INFO L407 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-09-16 16:18:35,033 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:35,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:35,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1703207373, now seen corresponding path program 1 times [2019-09-16 16:18:35,034 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:35,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:35,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:35,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:35,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:35,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:35,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:35,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:35,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:35,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:35,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:35,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:35,081 INFO L87 Difference]: Start difference. First operand 128 states and 232 transitions. Second operand 3 states. [2019-09-16 16:18:35,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:35,103 INFO L93 Difference]: Finished difference Result 304 states and 558 transitions. [2019-09-16 16:18:35,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:35,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-16 16:18:35,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:35,106 INFO L225 Difference]: With dead ends: 304 [2019-09-16 16:18:35,106 INFO L226 Difference]: Without dead ends: 184 [2019-09-16 16:18:35,108 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:35,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-09-16 16:18:35,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182. [2019-09-16 16:18:35,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-09-16 16:18:35,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 330 transitions. [2019-09-16 16:18:35,122 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 330 transitions. Word has length 25 [2019-09-16 16:18:35,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:35,123 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 330 transitions. [2019-09-16 16:18:35,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:35,123 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 330 transitions. [2019-09-16 16:18:35,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-16 16:18:35,125 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:35,125 INFO L407 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-09-16 16:18:35,125 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:35,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:35,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1040789154, now seen corresponding path program 1 times [2019-09-16 16:18:35,126 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:35,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:35,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:35,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:35,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:35,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:35,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:35,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:35,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:35,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:35,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:35,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:35,187 INFO L87 Difference]: Start difference. First operand 182 states and 330 transitions. Second operand 3 states. [2019-09-16 16:18:35,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:35,212 INFO L93 Difference]: Finished difference Result 273 states and 493 transitions. [2019-09-16 16:18:35,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:35,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-16 16:18:35,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:35,215 INFO L225 Difference]: With dead ends: 273 [2019-09-16 16:18:35,215 INFO L226 Difference]: Without dead ends: 186 [2019-09-16 16:18:35,219 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:35,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-09-16 16:18:35,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2019-09-16 16:18:35,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-16 16:18:35,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 330 transitions. [2019-09-16 16:18:35,247 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 330 transitions. Word has length 26 [2019-09-16 16:18:35,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:35,247 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 330 transitions. [2019-09-16 16:18:35,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:35,248 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 330 transitions. [2019-09-16 16:18:35,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-16 16:18:35,251 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:35,252 INFO L407 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-09-16 16:18:35,252 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:35,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:35,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1260033436, now seen corresponding path program 1 times [2019-09-16 16:18:35,253 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:35,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:35,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:35,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:35,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:35,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:35,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:35,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:35,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:35,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:35,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:35,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:35,321 INFO L87 Difference]: Start difference. First operand 184 states and 330 transitions. Second operand 3 states. [2019-09-16 16:18:35,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:35,356 INFO L93 Difference]: Finished difference Result 348 states and 632 transitions. [2019-09-16 16:18:35,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:35,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-16 16:18:35,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:35,363 INFO L225 Difference]: With dead ends: 348 [2019-09-16 16:18:35,363 INFO L226 Difference]: Without dead ends: 346 [2019-09-16 16:18:35,368 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:35,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-09-16 16:18:35,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 248. [2019-09-16 16:18:35,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-09-16 16:18:35,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 442 transitions. [2019-09-16 16:18:35,405 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 442 transitions. Word has length 26 [2019-09-16 16:18:35,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:35,406 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 442 transitions. [2019-09-16 16:18:35,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:35,406 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 442 transitions. [2019-09-16 16:18:35,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-16 16:18:35,412 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:35,412 INFO L407 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-09-16 16:18:35,414 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:35,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:35,414 INFO L82 PathProgramCache]: Analyzing trace with hash -328314466, now seen corresponding path program 1 times [2019-09-16 16:18:35,414 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:35,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:35,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:35,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:35,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:35,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:35,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:35,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:35,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:35,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:35,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:35,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:35,464 INFO L87 Difference]: Start difference. First operand 248 states and 442 transitions. Second operand 3 states. [2019-09-16 16:18:35,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:35,508 INFO L93 Difference]: Finished difference Result 592 states and 1064 transitions. [2019-09-16 16:18:35,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:35,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-16 16:18:35,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:35,511 INFO L225 Difference]: With dead ends: 592 [2019-09-16 16:18:35,512 INFO L226 Difference]: Without dead ends: 354 [2019-09-16 16:18:35,514 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:35,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-09-16 16:18:35,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 352. [2019-09-16 16:18:35,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-16 16:18:35,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 626 transitions. [2019-09-16 16:18:35,547 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 626 transitions. Word has length 26 [2019-09-16 16:18:35,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:35,548 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 626 transitions. [2019-09-16 16:18:35,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:35,548 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 626 transitions. [2019-09-16 16:18:35,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-16 16:18:35,554 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:35,554 INFO L407 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-09-16 16:18:35,555 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:35,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:35,555 INFO L82 PathProgramCache]: Analyzing trace with hash 406543618, now seen corresponding path program 1 times [2019-09-16 16:18:35,556 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:35,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:35,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:35,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:35,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:35,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:35,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:35,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:35,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:35,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:35,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:35,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:35,639 INFO L87 Difference]: Start difference. First operand 352 states and 626 transitions. Second operand 3 states. [2019-09-16 16:18:35,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:35,671 INFO L93 Difference]: Finished difference Result 528 states and 936 transitions. [2019-09-16 16:18:35,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:35,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-16 16:18:35,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:35,675 INFO L225 Difference]: With dead ends: 528 [2019-09-16 16:18:35,675 INFO L226 Difference]: Without dead ends: 358 [2019-09-16 16:18:35,677 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:35,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-09-16 16:18:35,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2019-09-16 16:18:35,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-09-16 16:18:35,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 626 transitions. [2019-09-16 16:18:35,693 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 626 transitions. Word has length 27 [2019-09-16 16:18:35,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:35,695 INFO L475 AbstractCegarLoop]: Abstraction has 356 states and 626 transitions. [2019-09-16 16:18:35,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:35,695 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 626 transitions. [2019-09-16 16:18:35,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-16 16:18:35,699 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:35,700 INFO L407 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-09-16 16:18:35,700 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:35,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:35,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1587601088, now seen corresponding path program 1 times [2019-09-16 16:18:35,700 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:35,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:35,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:35,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:35,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:35,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:35,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:35,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:35,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:35,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:35,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:35,743 INFO L87 Difference]: Start difference. First operand 356 states and 626 transitions. Second operand 3 states. [2019-09-16 16:18:35,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:35,773 INFO L93 Difference]: Finished difference Result 668 states and 1192 transitions. [2019-09-16 16:18:35,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:35,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-16 16:18:35,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:35,781 INFO L225 Difference]: With dead ends: 668 [2019-09-16 16:18:35,781 INFO L226 Difference]: Without dead ends: 666 [2019-09-16 16:18:35,782 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:35,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2019-09-16 16:18:35,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 488. [2019-09-16 16:18:35,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-09-16 16:18:35,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 846 transitions. [2019-09-16 16:18:35,801 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 846 transitions. Word has length 27 [2019-09-16 16:18:35,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:35,801 INFO L475 AbstractCegarLoop]: Abstraction has 488 states and 846 transitions. [2019-09-16 16:18:35,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:35,801 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 846 transitions. [2019-09-16 16:18:35,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-16 16:18:35,804 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:35,807 INFO L407 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-09-16 16:18:35,807 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:35,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:35,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1119018306, now seen corresponding path program 1 times [2019-09-16 16:18:35,810 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:35,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:35,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:35,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:35,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:35,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:35,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:35,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:35,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:35,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:35,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:35,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:35,837 INFO L87 Difference]: Start difference. First operand 488 states and 846 transitions. Second operand 3 states. [2019-09-16 16:18:35,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:35,867 INFO L93 Difference]: Finished difference Result 1164 states and 2032 transitions. [2019-09-16 16:18:35,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:35,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-16 16:18:35,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:35,872 INFO L225 Difference]: With dead ends: 1164 [2019-09-16 16:18:35,873 INFO L226 Difference]: Without dead ends: 690 [2019-09-16 16:18:35,874 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:35,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2019-09-16 16:18:35,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 688. [2019-09-16 16:18:35,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2019-09-16 16:18:35,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1190 transitions. [2019-09-16 16:18:35,898 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1190 transitions. Word has length 27 [2019-09-16 16:18:35,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:35,898 INFO L475 AbstractCegarLoop]: Abstraction has 688 states and 1190 transitions. [2019-09-16 16:18:35,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:35,898 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1190 transitions. [2019-09-16 16:18:35,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-16 16:18:35,900 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:35,900 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:35,900 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:35,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:35,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1970780365, now seen corresponding path program 1 times [2019-09-16 16:18:35,901 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:35,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:35,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:35,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:35,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:35,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:35,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:35,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:35,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:35,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:35,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:35,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:35,931 INFO L87 Difference]: Start difference. First operand 688 states and 1190 transitions. Second operand 3 states. [2019-09-16 16:18:35,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:35,957 INFO L93 Difference]: Finished difference Result 1032 states and 1780 transitions. [2019-09-16 16:18:35,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:35,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-16 16:18:35,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:35,963 INFO L225 Difference]: With dead ends: 1032 [2019-09-16 16:18:35,963 INFO L226 Difference]: Without dead ends: 698 [2019-09-16 16:18:35,964 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:35,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2019-09-16 16:18:35,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 696. [2019-09-16 16:18:35,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2019-09-16 16:18:35,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1190 transitions. [2019-09-16 16:18:35,985 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1190 transitions. Word has length 28 [2019-09-16 16:18:35,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:35,986 INFO L475 AbstractCegarLoop]: Abstraction has 696 states and 1190 transitions. [2019-09-16 16:18:35,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:35,986 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1190 transitions. [2019-09-16 16:18:35,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-16 16:18:35,987 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:35,987 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:35,988 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:35,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:35,988 INFO L82 PathProgramCache]: Analyzing trace with hash 330042225, now seen corresponding path program 1 times [2019-09-16 16:18:35,988 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:35,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:35,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:35,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:35,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:36,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:36,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:36,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:36,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:36,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:36,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:36,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:36,024 INFO L87 Difference]: Start difference. First operand 696 states and 1190 transitions. Second operand 3 states. [2019-09-16 16:18:36,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:36,053 INFO L93 Difference]: Finished difference Result 1292 states and 2248 transitions. [2019-09-16 16:18:36,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:36,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-16 16:18:36,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:36,060 INFO L225 Difference]: With dead ends: 1292 [2019-09-16 16:18:36,061 INFO L226 Difference]: Without dead ends: 1290 [2019-09-16 16:18:36,062 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:36,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2019-09-16 16:18:36,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 968. [2019-09-16 16:18:36,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2019-09-16 16:18:36,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1622 transitions. [2019-09-16 16:18:36,093 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1622 transitions. Word has length 28 [2019-09-16 16:18:36,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:36,094 INFO L475 AbstractCegarLoop]: Abstraction has 968 states and 1622 transitions. [2019-09-16 16:18:36,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:36,094 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1622 transitions. [2019-09-16 16:18:36,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-16 16:18:36,096 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:36,097 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:36,097 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:36,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:36,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1258305677, now seen corresponding path program 1 times [2019-09-16 16:18:36,097 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:36,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:36,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:36,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:36,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:36,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:36,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:36,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:36,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:36,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:36,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:36,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:36,128 INFO L87 Difference]: Start difference. First operand 968 states and 1622 transitions. Second operand 3 states. [2019-09-16 16:18:36,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:36,163 INFO L93 Difference]: Finished difference Result 2300 states and 3880 transitions. [2019-09-16 16:18:36,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:36,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-16 16:18:36,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:36,175 INFO L225 Difference]: With dead ends: 2300 [2019-09-16 16:18:36,176 INFO L226 Difference]: Without dead ends: 1354 [2019-09-16 16:18:36,180 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:36,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2019-09-16 16:18:36,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1352. [2019-09-16 16:18:36,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2019-09-16 16:18:36,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 2262 transitions. [2019-09-16 16:18:36,222 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 2262 transitions. Word has length 28 [2019-09-16 16:18:36,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:36,222 INFO L475 AbstractCegarLoop]: Abstraction has 1352 states and 2262 transitions. [2019-09-16 16:18:36,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:36,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 2262 transitions. [2019-09-16 16:18:36,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-16 16:18:36,225 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:36,226 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:36,226 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:36,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:36,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1641587831, now seen corresponding path program 1 times [2019-09-16 16:18:36,227 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:36,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:36,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:36,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:36,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:36,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:36,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:36,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:36,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:36,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:36,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:36,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:36,279 INFO L87 Difference]: Start difference. First operand 1352 states and 2262 transitions. Second operand 3 states. [2019-09-16 16:18:36,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:36,309 INFO L93 Difference]: Finished difference Result 2028 states and 3384 transitions. [2019-09-16 16:18:36,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:36,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-16 16:18:36,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:36,316 INFO L225 Difference]: With dead ends: 2028 [2019-09-16 16:18:36,316 INFO L226 Difference]: Without dead ends: 1370 [2019-09-16 16:18:36,318 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:36,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2019-09-16 16:18:36,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1368. [2019-09-16 16:18:36,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1368 states. [2019-09-16 16:18:36,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 2262 transitions. [2019-09-16 16:18:36,356 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 2262 transitions. Word has length 29 [2019-09-16 16:18:36,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:36,357 INFO L475 AbstractCegarLoop]: Abstraction has 1368 states and 2262 transitions. [2019-09-16 16:18:36,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:36,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 2262 transitions. [2019-09-16 16:18:36,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-16 16:18:36,359 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:36,359 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:36,360 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:36,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:36,360 INFO L82 PathProgramCache]: Analyzing trace with hash -352556875, now seen corresponding path program 1 times [2019-09-16 16:18:36,360 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:36,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:36,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:36,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:36,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:36,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:36,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:36,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:36,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:36,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:36,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:36,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:36,400 INFO L87 Difference]: Start difference. First operand 1368 states and 2262 transitions. Second operand 3 states. [2019-09-16 16:18:36,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:36,456 INFO L93 Difference]: Finished difference Result 2508 states and 4232 transitions. [2019-09-16 16:18:36,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:36,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-16 16:18:36,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:36,473 INFO L225 Difference]: With dead ends: 2508 [2019-09-16 16:18:36,473 INFO L226 Difference]: Without dead ends: 2506 [2019-09-16 16:18:36,474 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:36,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2019-09-16 16:18:36,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 1928. [2019-09-16 16:18:36,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2019-09-16 16:18:36,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 3110 transitions. [2019-09-16 16:18:36,547 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 3110 transitions. Word has length 29 [2019-09-16 16:18:36,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:36,547 INFO L475 AbstractCegarLoop]: Abstraction has 1928 states and 3110 transitions. [2019-09-16 16:18:36,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:36,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 3110 transitions. [2019-09-16 16:18:36,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-16 16:18:36,551 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:36,551 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:36,552 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:36,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:36,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1940904777, now seen corresponding path program 1 times [2019-09-16 16:18:36,552 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:36,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:36,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:36,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:36,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:36,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:36,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:36,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:36,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:36,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:36,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:36,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:36,579 INFO L87 Difference]: Start difference. First operand 1928 states and 3110 transitions. Second operand 3 states. [2019-09-16 16:18:36,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:36,640 INFO L93 Difference]: Finished difference Result 4556 states and 7400 transitions. [2019-09-16 16:18:36,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:36,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-16 16:18:36,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:36,654 INFO L225 Difference]: With dead ends: 4556 [2019-09-16 16:18:36,655 INFO L226 Difference]: Without dead ends: 2666 [2019-09-16 16:18:36,660 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:36,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2019-09-16 16:18:36,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 2664. [2019-09-16 16:18:36,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2664 states. [2019-09-16 16:18:36,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2664 states and 4294 transitions. [2019-09-16 16:18:36,735 INFO L78 Accepts]: Start accepts. Automaton has 2664 states and 4294 transitions. Word has length 29 [2019-09-16 16:18:36,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:36,735 INFO L475 AbstractCegarLoop]: Abstraction has 2664 states and 4294 transitions. [2019-09-16 16:18:36,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:36,736 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 4294 transitions. [2019-09-16 16:18:36,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-16 16:18:36,739 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:36,739 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:36,740 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:36,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:36,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1955852552, now seen corresponding path program 1 times [2019-09-16 16:18:36,740 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:36,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:36,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:36,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:36,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:36,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:36,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:36,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:36,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:36,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:36,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:36,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:36,771 INFO L87 Difference]: Start difference. First operand 2664 states and 4294 transitions. Second operand 3 states. [2019-09-16 16:18:36,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:36,826 INFO L93 Difference]: Finished difference Result 3996 states and 6424 transitions. [2019-09-16 16:18:36,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:36,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-16 16:18:36,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:36,839 INFO L225 Difference]: With dead ends: 3996 [2019-09-16 16:18:36,839 INFO L226 Difference]: Without dead ends: 2698 [2019-09-16 16:18:36,843 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:36,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2019-09-16 16:18:36,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2696. [2019-09-16 16:18:36,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2696 states. [2019-09-16 16:18:36,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2696 states to 2696 states and 4294 transitions. [2019-09-16 16:18:36,918 INFO L78 Accepts]: Start accepts. Automaton has 2696 states and 4294 transitions. Word has length 30 [2019-09-16 16:18:36,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:36,919 INFO L475 AbstractCegarLoop]: Abstraction has 2696 states and 4294 transitions. [2019-09-16 16:18:36,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:36,919 INFO L276 IsEmpty]: Start isEmpty. Operand 2696 states and 4294 transitions. [2019-09-16 16:18:36,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-16 16:18:36,923 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:36,923 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:36,923 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:36,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:36,924 INFO L82 PathProgramCache]: Analyzing trace with hash -38292154, now seen corresponding path program 1 times [2019-09-16 16:18:36,924 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:36,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:36,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:36,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:36,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:36,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:36,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:36,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:36,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:36,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:36,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:36,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:36,950 INFO L87 Difference]: Start difference. First operand 2696 states and 4294 transitions. Second operand 3 states. [2019-09-16 16:18:37,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:37,022 INFO L93 Difference]: Finished difference Result 4876 states and 7944 transitions. [2019-09-16 16:18:37,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:37,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-16 16:18:37,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:37,048 INFO L225 Difference]: With dead ends: 4876 [2019-09-16 16:18:37,049 INFO L226 Difference]: Without dead ends: 4874 [2019-09-16 16:18:37,052 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:37,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4874 states. [2019-09-16 16:18:37,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4874 to 3848. [2019-09-16 16:18:37,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3848 states. [2019-09-16 16:18:37,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3848 states to 3848 states and 5958 transitions. [2019-09-16 16:18:37,180 INFO L78 Accepts]: Start accepts. Automaton has 3848 states and 5958 transitions. Word has length 30 [2019-09-16 16:18:37,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:37,180 INFO L475 AbstractCegarLoop]: Abstraction has 3848 states and 5958 transitions. [2019-09-16 16:18:37,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:37,180 INFO L276 IsEmpty]: Start isEmpty. Operand 3848 states and 5958 transitions. [2019-09-16 16:18:37,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-16 16:18:37,187 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:37,187 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:37,187 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:37,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:37,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1626640056, now seen corresponding path program 1 times [2019-09-16 16:18:37,188 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:37,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:37,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:37,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:37,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:37,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:37,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:37,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:37,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:37,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:37,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:37,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:37,214 INFO L87 Difference]: Start difference. First operand 3848 states and 5958 transitions. Second operand 3 states. [2019-09-16 16:18:37,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:37,312 INFO L93 Difference]: Finished difference Result 9036 states and 14088 transitions. [2019-09-16 16:18:37,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:37,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-16 16:18:37,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:37,360 INFO L225 Difference]: With dead ends: 9036 [2019-09-16 16:18:37,361 INFO L226 Difference]: Without dead ends: 5258 [2019-09-16 16:18:37,371 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:37,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5258 states. [2019-09-16 16:18:37,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5258 to 5256. [2019-09-16 16:18:37,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5256 states. [2019-09-16 16:18:37,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5256 states to 5256 states and 8134 transitions. [2019-09-16 16:18:37,525 INFO L78 Accepts]: Start accepts. Automaton has 5256 states and 8134 transitions. Word has length 30 [2019-09-16 16:18:37,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:37,525 INFO L475 AbstractCegarLoop]: Abstraction has 5256 states and 8134 transitions. [2019-09-16 16:18:37,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:37,526 INFO L276 IsEmpty]: Start isEmpty. Operand 5256 states and 8134 transitions. [2019-09-16 16:18:37,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-16 16:18:37,532 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:37,532 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:37,533 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:37,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:37,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1186842644, now seen corresponding path program 1 times [2019-09-16 16:18:37,533 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:37,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:37,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:37,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:37,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:37,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:37,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:37,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:37,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:37,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:37,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:37,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:37,556 INFO L87 Difference]: Start difference. First operand 5256 states and 8134 transitions. Second operand 3 states. [2019-09-16 16:18:37,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:37,622 INFO L93 Difference]: Finished difference Result 7884 states and 12168 transitions. [2019-09-16 16:18:37,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:37,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-16 16:18:37,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:37,635 INFO L225 Difference]: With dead ends: 7884 [2019-09-16 16:18:37,635 INFO L226 Difference]: Without dead ends: 5322 [2019-09-16 16:18:37,641 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:37,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5322 states. [2019-09-16 16:18:37,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5322 to 5320. [2019-09-16 16:18:37,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5320 states. [2019-09-16 16:18:37,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5320 states to 5320 states and 8134 transitions. [2019-09-16 16:18:37,807 INFO L78 Accepts]: Start accepts. Automaton has 5320 states and 8134 transitions. Word has length 31 [2019-09-16 16:18:37,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:37,807 INFO L475 AbstractCegarLoop]: Abstraction has 5320 states and 8134 transitions. [2019-09-16 16:18:37,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:37,808 INFO L276 IsEmpty]: Start isEmpty. Operand 5320 states and 8134 transitions. [2019-09-16 16:18:37,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-16 16:18:37,814 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:37,815 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:37,815 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:37,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:37,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1113979946, now seen corresponding path program 1 times [2019-09-16 16:18:37,815 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:37,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:37,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:37,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:37,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:37,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:37,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:37,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:37,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:37,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:37,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:37,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:37,845 INFO L87 Difference]: Start difference. First operand 5320 states and 8134 transitions. Second operand 3 states. [2019-09-16 16:18:38,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:38,017 INFO L93 Difference]: Finished difference Result 15564 states and 23624 transitions. [2019-09-16 16:18:38,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:38,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-16 16:18:38,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:38,050 INFO L225 Difference]: With dead ends: 15564 [2019-09-16 16:18:38,050 INFO L226 Difference]: Without dead ends: 10378 [2019-09-16 16:18:38,066 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:38,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10378 states. [2019-09-16 16:18:38,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10378 to 10376. [2019-09-16 16:18:38,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10376 states. [2019-09-16 16:18:38,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10376 states to 10376 states and 15494 transitions. [2019-09-16 16:18:38,463 INFO L78 Accepts]: Start accepts. Automaton has 10376 states and 15494 transitions. Word has length 31 [2019-09-16 16:18:38,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:38,464 INFO L475 AbstractCegarLoop]: Abstraction has 10376 states and 15494 transitions. [2019-09-16 16:18:38,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:38,464 INFO L276 IsEmpty]: Start isEmpty. Operand 10376 states and 15494 transitions. [2019-09-16 16:18:38,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-16 16:18:38,483 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:38,483 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:38,484 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:38,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:38,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1592639448, now seen corresponding path program 1 times [2019-09-16 16:18:38,485 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:38,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:38,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:38,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:38,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:38,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:38,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:38,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:38,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:38,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:38,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:38,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:38,518 INFO L87 Difference]: Start difference. First operand 10376 states and 15494 transitions. Second operand 3 states. [2019-09-16 16:18:38,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:38,766 INFO L93 Difference]: Finished difference Result 12172 states and 18824 transitions. [2019-09-16 16:18:38,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:38,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-16 16:18:38,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:38,810 INFO L225 Difference]: With dead ends: 12172 [2019-09-16 16:18:38,810 INFO L226 Difference]: Without dead ends: 12170 [2019-09-16 16:18:38,817 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:38,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12170 states. [2019-09-16 16:18:39,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12170 to 10376. [2019-09-16 16:18:39,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10376 states. [2019-09-16 16:18:39,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10376 states to 10376 states and 15366 transitions. [2019-09-16 16:18:39,273 INFO L78 Accepts]: Start accepts. Automaton has 10376 states and 15366 transitions. Word has length 31 [2019-09-16 16:18:39,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:39,274 INFO L475 AbstractCegarLoop]: Abstraction has 10376 states and 15366 transitions. [2019-09-16 16:18:39,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:39,274 INFO L276 IsEmpty]: Start isEmpty. Operand 10376 states and 15366 transitions. [2019-09-16 16:18:39,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-16 16:18:39,288 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:39,288 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:39,288 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:39,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:39,288 INFO L82 PathProgramCache]: Analyzing trace with hash 173854429, now seen corresponding path program 1 times [2019-09-16 16:18:39,289 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:39,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:39,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:39,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:39,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:39,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:39,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:39,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:39,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:39,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:39,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:39,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:39,312 INFO L87 Difference]: Start difference. First operand 10376 states and 15366 transitions. Second operand 3 states. [2019-09-16 16:18:39,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:39,516 INFO L93 Difference]: Finished difference Result 18316 states and 27784 transitions. [2019-09-16 16:18:39,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:39,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-09-16 16:18:39,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:39,556 INFO L225 Difference]: With dead ends: 18316 [2019-09-16 16:18:39,557 INFO L226 Difference]: Without dead ends: 18314 [2019-09-16 16:18:39,565 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:39,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18314 states. [2019-09-16 16:18:40,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18314 to 15240. [2019-09-16 16:18:40,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15240 states. [2019-09-16 16:18:40,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15240 states to 15240 states and 21894 transitions. [2019-09-16 16:18:40,418 INFO L78 Accepts]: Start accepts. Automaton has 15240 states and 21894 transitions. Word has length 32 [2019-09-16 16:18:40,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:40,419 INFO L475 AbstractCegarLoop]: Abstraction has 15240 states and 21894 transitions. [2019-09-16 16:18:40,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:40,419 INFO L276 IsEmpty]: Start isEmpty. Operand 15240 states and 21894 transitions. [2019-09-16 16:18:40,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-16 16:18:40,441 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:40,441 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:40,442 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:40,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:40,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1414493473, now seen corresponding path program 1 times [2019-09-16 16:18:40,442 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:40,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:40,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:40,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:40,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:40,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:40,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:40,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:40,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:40,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:40,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:40,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:40,465 INFO L87 Difference]: Start difference. First operand 15240 states and 21894 transitions. Second operand 3 states. [2019-09-16 16:18:40,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:40,718 INFO L93 Difference]: Finished difference Result 35468 states and 51336 transitions. [2019-09-16 16:18:40,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:40,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-09-16 16:18:40,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:40,762 INFO L225 Difference]: With dead ends: 35468 [2019-09-16 16:18:40,762 INFO L226 Difference]: Without dead ends: 20362 [2019-09-16 16:18:40,794 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:40,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20362 states. [2019-09-16 16:18:41,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20362 to 20360. [2019-09-16 16:18:41,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20360 states. [2019-09-16 16:18:41,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20360 states to 20360 states and 29190 transitions. [2019-09-16 16:18:41,365 INFO L78 Accepts]: Start accepts. Automaton has 20360 states and 29190 transitions. Word has length 32 [2019-09-16 16:18:41,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:41,366 INFO L475 AbstractCegarLoop]: Abstraction has 20360 states and 29190 transitions. [2019-09-16 16:18:41,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:41,366 INFO L276 IsEmpty]: Start isEmpty. Operand 20360 states and 29190 transitions. [2019-09-16 16:18:41,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-16 16:18:41,390 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:41,390 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:41,390 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:41,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:41,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1094734815, now seen corresponding path program 1 times [2019-09-16 16:18:41,391 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:41,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:41,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:41,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:41,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:41,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:41,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:41,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:41,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:41,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:41,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:41,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:41,417 INFO L87 Difference]: Start difference. First operand 20360 states and 29190 transitions. Second operand 3 states. [2019-09-16 16:18:41,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:41,621 INFO L93 Difference]: Finished difference Result 30732 states and 44040 transitions. [2019-09-16 16:18:41,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:41,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-09-16 16:18:41,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:41,660 INFO L225 Difference]: With dead ends: 30732 [2019-09-16 16:18:41,660 INFO L226 Difference]: Without dead ends: 20746 [2019-09-16 16:18:41,683 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:41,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20746 states. [2019-09-16 16:18:42,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20746 to 20744. [2019-09-16 16:18:42,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20744 states. [2019-09-16 16:18:42,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20744 states to 20744 states and 29446 transitions. [2019-09-16 16:18:42,050 INFO L78 Accepts]: Start accepts. Automaton has 20744 states and 29446 transitions. Word has length 33 [2019-09-16 16:18:42,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:42,051 INFO L475 AbstractCegarLoop]: Abstraction has 20744 states and 29446 transitions. [2019-09-16 16:18:42,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:42,051 INFO L276 IsEmpty]: Start isEmpty. Operand 20744 states and 29446 transitions. [2019-09-16 16:18:42,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-16 16:18:42,074 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:42,074 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:42,074 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:42,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:42,075 INFO L82 PathProgramCache]: Analyzing trace with hash -899409891, now seen corresponding path program 1 times [2019-09-16 16:18:42,075 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:42,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:42,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:42,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:42,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:42,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:42,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:42,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:42,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:42,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:42,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:42,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:42,432 INFO L87 Difference]: Start difference. First operand 20744 states and 29446 transitions. Second operand 3 states. [2019-09-16 16:18:42,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:42,715 INFO L93 Difference]: Finished difference Result 35852 states and 51976 transitions. [2019-09-16 16:18:42,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:42,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-09-16 16:18:42,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:42,786 INFO L225 Difference]: With dead ends: 35852 [2019-09-16 16:18:42,786 INFO L226 Difference]: Without dead ends: 35850 [2019-09-16 16:18:42,800 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:42,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35850 states. [2019-09-16 16:18:43,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35850 to 30728. [2019-09-16 16:18:43,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30728 states. [2019-09-16 16:18:43,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30728 states to 30728 states and 42246 transitions. [2019-09-16 16:18:43,353 INFO L78 Accepts]: Start accepts. Automaton has 30728 states and 42246 transitions. Word has length 33 [2019-09-16 16:18:43,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:43,354 INFO L475 AbstractCegarLoop]: Abstraction has 30728 states and 42246 transitions. [2019-09-16 16:18:43,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:43,354 INFO L276 IsEmpty]: Start isEmpty. Operand 30728 states and 42246 transitions. [2019-09-16 16:18:43,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-16 16:18:43,406 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:43,407 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:43,407 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:43,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:43,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1807209503, now seen corresponding path program 1 times [2019-09-16 16:18:43,408 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:43,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:43,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:43,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:43,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:43,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:43,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:43,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:43,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:43,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:43,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:43,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:43,436 INFO L87 Difference]: Start difference. First operand 30728 states and 42246 transitions. Second operand 3 states. [2019-09-16 16:18:43,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:43,962 INFO L93 Difference]: Finished difference Result 70668 states and 97544 transitions. [2019-09-16 16:18:43,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:43,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-09-16 16:18:43,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:44,056 INFO L225 Difference]: With dead ends: 70668 [2019-09-16 16:18:44,056 INFO L226 Difference]: Without dead ends: 40458 [2019-09-16 16:18:44,102 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:44,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40458 states. [2019-09-16 16:18:45,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40458 to 40456. [2019-09-16 16:18:45,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40456 states. [2019-09-16 16:18:45,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40456 states to 40456 states and 55302 transitions. [2019-09-16 16:18:45,763 INFO L78 Accepts]: Start accepts. Automaton has 40456 states and 55302 transitions. Word has length 33 [2019-09-16 16:18:45,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:45,763 INFO L475 AbstractCegarLoop]: Abstraction has 40456 states and 55302 transitions. [2019-09-16 16:18:45,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:45,764 INFO L276 IsEmpty]: Start isEmpty. Operand 40456 states and 55302 transitions. [2019-09-16 16:18:45,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-16 16:18:45,801 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:45,802 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:45,802 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:45,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:45,802 INFO L82 PathProgramCache]: Analyzing trace with hash -2111687692, now seen corresponding path program 1 times [2019-09-16 16:18:45,802 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:45,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:45,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:45,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:45,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:45,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:45,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:45,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:45,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:45,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:45,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:45,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:45,832 INFO L87 Difference]: Start difference. First operand 40456 states and 55302 transitions. Second operand 3 states. [2019-09-16 16:18:46,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:46,178 INFO L93 Difference]: Finished difference Result 60684 states and 82696 transitions. [2019-09-16 16:18:46,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:46,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-09-16 16:18:46,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:46,240 INFO L225 Difference]: With dead ends: 60684 [2019-09-16 16:18:46,240 INFO L226 Difference]: Without dead ends: 40970 [2019-09-16 16:18:46,282 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:46,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40970 states. [2019-09-16 16:18:47,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40970 to 40968. [2019-09-16 16:18:47,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40968 states. [2019-09-16 16:18:47,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40968 states to 40968 states and 55302 transitions. [2019-09-16 16:18:47,305 INFO L78 Accepts]: Start accepts. Automaton has 40968 states and 55302 transitions. Word has length 34 [2019-09-16 16:18:47,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:47,305 INFO L475 AbstractCegarLoop]: Abstraction has 40968 states and 55302 transitions. [2019-09-16 16:18:47,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:47,306 INFO L276 IsEmpty]: Start isEmpty. Operand 40968 states and 55302 transitions. [2019-09-16 16:18:47,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-16 16:18:47,327 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:47,328 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:47,328 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:47,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:47,329 INFO L82 PathProgramCache]: Analyzing trace with hash 189134898, now seen corresponding path program 1 times [2019-09-16 16:18:47,329 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:47,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:47,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:47,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:47,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:47,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:47,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:47,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:47,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:47,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:47,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:47,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:47,353 INFO L87 Difference]: Start difference. First operand 40968 states and 55302 transitions. Second operand 3 states. [2019-09-16 16:18:47,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:47,999 INFO L93 Difference]: Finished difference Result 69644 states and 95752 transitions. [2019-09-16 16:18:48,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:48,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-09-16 16:18:48,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:48,093 INFO L225 Difference]: With dead ends: 69644 [2019-09-16 16:18:48,093 INFO L226 Difference]: Without dead ends: 69642 [2019-09-16 16:18:48,116 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:48,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69642 states. [2019-09-16 16:18:49,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69642 to 61448. [2019-09-16 16:18:49,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61448 states. [2019-09-16 16:18:50,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61448 states to 61448 states and 80390 transitions. [2019-09-16 16:18:50,107 INFO L78 Accepts]: Start accepts. Automaton has 61448 states and 80390 transitions. Word has length 34 [2019-09-16 16:18:50,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:50,107 INFO L475 AbstractCegarLoop]: Abstraction has 61448 states and 80390 transitions. [2019-09-16 16:18:50,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:50,107 INFO L276 IsEmpty]: Start isEmpty. Operand 61448 states and 80390 transitions. [2019-09-16 16:18:50,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-16 16:18:50,165 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:50,165 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:50,165 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:50,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:50,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1399213004, now seen corresponding path program 1 times [2019-09-16 16:18:50,166 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:50,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:50,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:50,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:50,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:50,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:50,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:50,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:50,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:50,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:50,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:50,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:50,217 INFO L87 Difference]: Start difference. First operand 61448 states and 80390 transitions. Second operand 3 states. [2019-09-16 16:18:50,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:50,858 INFO L93 Difference]: Finished difference Result 140300 states and 183816 transitions. [2019-09-16 16:18:50,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:50,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-09-16 16:18:50,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:50,932 INFO L225 Difference]: With dead ends: 140300 [2019-09-16 16:18:50,933 INFO L226 Difference]: Without dead ends: 79882 [2019-09-16 16:18:50,984 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:51,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79882 states. [2019-09-16 16:18:52,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79882 to 79880. [2019-09-16 16:18:52,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79880 states. [2019-09-16 16:18:52,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79880 states to 79880 states and 103430 transitions. [2019-09-16 16:18:52,369 INFO L78 Accepts]: Start accepts. Automaton has 79880 states and 103430 transitions. Word has length 34 [2019-09-16 16:18:52,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:52,369 INFO L475 AbstractCegarLoop]: Abstraction has 79880 states and 103430 transitions. [2019-09-16 16:18:52,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:52,369 INFO L276 IsEmpty]: Start isEmpty. Operand 79880 states and 103430 transitions. [2019-09-16 16:18:52,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-16 16:18:52,413 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:52,413 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:52,413 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:52,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:52,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1568430036, now seen corresponding path program 1 times [2019-09-16 16:18:52,414 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:52,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:52,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:52,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:52,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:52,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:52,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-09-16 16:18:52,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:52,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:52,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:52,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:52,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:52,433 INFO L87 Difference]: Start difference. First operand 79880 states and 103430 transitions. Second operand 3 states. [2019-09-16 16:18:54,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:54,296 INFO L93 Difference]: Finished difference Result 119820 states and 154632 transitions. [2019-09-16 16:18:54,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:54,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-09-16 16:18:54,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:54,388 INFO L225 Difference]: With dead ends: 119820 [2019-09-16 16:18:54,388 INFO L226 Difference]: Without dead ends: 80906 [2019-09-16 16:18:54,416 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:54,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80906 states. [2019-09-16 16:18:55,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80906 to 80904. [2019-09-16 16:18:55,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80904 states. [2019-09-16 16:18:55,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80904 states to 80904 states and 103430 transitions. [2019-09-16 16:18:55,639 INFO L78 Accepts]: Start accepts. Automaton has 80904 states and 103430 transitions. Word has length 35 [2019-09-16 16:18:55,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:55,639 INFO L475 AbstractCegarLoop]: Abstraction has 80904 states and 103430 transitions. [2019-09-16 16:18:55,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:55,639 INFO L276 IsEmpty]: Start isEmpty. Operand 80904 states and 103430 transitions. [2019-09-16 16:18:55,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-16 16:18:55,673 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:55,673 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:55,673 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:55,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:55,673 INFO L82 PathProgramCache]: Analyzing trace with hash -425714670, now seen corresponding path program 1 times [2019-09-16 16:18:55,673 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:55,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:55,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:55,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:55,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:55,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:55,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:55,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:55,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:55,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:55,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:55,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:55,692 INFO L87 Difference]: Start difference. First operand 80904 states and 103430 transitions. Second operand 3 states. [2019-09-16 16:18:56,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:56,487 INFO L93 Difference]: Finished difference Result 135180 states and 175112 transitions. [2019-09-16 16:18:56,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:56,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-09-16 16:18:56,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:56,634 INFO L225 Difference]: With dead ends: 135180 [2019-09-16 16:18:56,634 INFO L226 Difference]: Without dead ends: 135178 [2019-09-16 16:18:56,674 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:56,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135178 states. [2019-09-16 16:18:59,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135178 to 122888. [2019-09-16 16:18:59,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122888 states. [2019-09-16 16:18:59,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122888 states to 122888 states and 152582 transitions. [2019-09-16 16:18:59,675 INFO L78 Accepts]: Start accepts. Automaton has 122888 states and 152582 transitions. Word has length 35 [2019-09-16 16:18:59,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:59,676 INFO L475 AbstractCegarLoop]: Abstraction has 122888 states and 152582 transitions. [2019-09-16 16:18:59,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:59,676 INFO L276 IsEmpty]: Start isEmpty. Operand 122888 states and 152582 transitions. [2019-09-16 16:18:59,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-16 16:18:59,738 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:59,738 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:59,738 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:59,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:59,738 INFO L82 PathProgramCache]: Analyzing trace with hash -2014062572, now seen corresponding path program 1 times [2019-09-16 16:18:59,738 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:59,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:59,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:59,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:59,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:59,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:59,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:59,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:59,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:59,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:59,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:59,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:59,757 INFO L87 Difference]: Start difference. First operand 122888 states and 152582 transitions. Second operand 3 states. [2019-09-16 16:19:01,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:19:01,296 INFO L93 Difference]: Finished difference Result 278540 states and 345096 transitions. [2019-09-16 16:19:01,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:19:01,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-09-16 16:19:01,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:19:01,441 INFO L225 Difference]: With dead ends: 278540 [2019-09-16 16:19:01,441 INFO L226 Difference]: Without dead ends: 157706 [2019-09-16 16:19:01,517 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:01,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157706 states. [2019-09-16 16:19:05,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157706 to 157704. [2019-09-16 16:19:05,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157704 states. [2019-09-16 16:19:05,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157704 states to 157704 states and 192518 transitions. [2019-09-16 16:19:05,915 INFO L78 Accepts]: Start accepts. Automaton has 157704 states and 192518 transitions. Word has length 35 [2019-09-16 16:19:05,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:19:05,916 INFO L475 AbstractCegarLoop]: Abstraction has 157704 states and 192518 transitions. [2019-09-16 16:19:05,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:19:05,916 INFO L276 IsEmpty]: Start isEmpty. Operand 157704 states and 192518 transitions. [2019-09-16 16:19:05,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-16 16:19:05,985 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:19:05,985 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:19:05,985 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:19:05,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:19:05,985 INFO L82 PathProgramCache]: Analyzing trace with hash -312037047, now seen corresponding path program 1 times [2019-09-16 16:19:05,985 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:19:05,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:19:05,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:05,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:19:05,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:05,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:19:06,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:19:06,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:19:06,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:19:06,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:19:06,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:19:06,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:06,012 INFO L87 Difference]: Start difference. First operand 157704 states and 192518 transitions. Second operand 3 states. [2019-09-16 16:19:07,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:19:07,543 INFO L93 Difference]: Finished difference Result 236556 states and 287752 transitions. [2019-09-16 16:19:07,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:19:07,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-09-16 16:19:07,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:19:07,700 INFO L225 Difference]: With dead ends: 236556 [2019-09-16 16:19:07,700 INFO L226 Difference]: Without dead ends: 159754 [2019-09-16 16:19:07,752 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:07,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159754 states. [2019-09-16 16:19:12,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159754 to 159752. [2019-09-16 16:19:12,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159752 states. [2019-09-16 16:19:13,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159752 states to 159752 states and 192518 transitions. [2019-09-16 16:19:13,061 INFO L78 Accepts]: Start accepts. Automaton has 159752 states and 192518 transitions. Word has length 36 [2019-09-16 16:19:13,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:19:13,061 INFO L475 AbstractCegarLoop]: Abstraction has 159752 states and 192518 transitions. [2019-09-16 16:19:13,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:19:13,061 INFO L276 IsEmpty]: Start isEmpty. Operand 159752 states and 192518 transitions. [2019-09-16 16:19:13,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-16 16:19:13,127 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:19:13,127 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:19:13,127 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:19:13,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:19:13,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1988785543, now seen corresponding path program 1 times [2019-09-16 16:19:13,128 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:19:13,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:19:13,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:13,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:19:13,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:13,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:19:13,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:19:13,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:19:13,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:19:13,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:19:13,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:19:13,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:13,145 INFO L87 Difference]: Start difference. First operand 159752 states and 192518 transitions. Second operand 3 states. [2019-09-16 16:19:14,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:19:14,601 INFO L93 Difference]: Finished difference Result 262156 states and 317448 transitions. [2019-09-16 16:19:14,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:19:14,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-09-16 16:19:14,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:19:14,886 INFO L225 Difference]: With dead ends: 262156 [2019-09-16 16:19:14,887 INFO L226 Difference]: Without dead ends: 262154 [2019-09-16 16:19:14,947 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:15,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262154 states. [2019-09-16 16:19:18,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262154 to 245768. [2019-09-16 16:19:18,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245768 states. [2019-09-16 16:19:18,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245768 states to 245768 states and 288774 transitions. [2019-09-16 16:19:18,746 INFO L78 Accepts]: Start accepts. Automaton has 245768 states and 288774 transitions. Word has length 36 [2019-09-16 16:19:18,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:19:18,746 INFO L475 AbstractCegarLoop]: Abstraction has 245768 states and 288774 transitions. [2019-09-16 16:19:18,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:19:18,746 INFO L276 IsEmpty]: Start isEmpty. Operand 245768 states and 288774 transitions. [2019-09-16 16:19:18,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-16 16:19:18,865 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:19:18,865 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:19:18,865 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:19:18,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:19:18,866 INFO L82 PathProgramCache]: Analyzing trace with hash 400437641, now seen corresponding path program 1 times [2019-09-16 16:19:18,866 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:19:18,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:19:18,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:18,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:19:18,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:18,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:19:18,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:19:18,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:19:18,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:19:18,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:19:18,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:19:18,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:18,884 INFO L87 Difference]: Start difference. First operand 245768 states and 288774 transitions. Second operand 3 states. [2019-09-16 16:19:24,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:19:24,580 INFO L93 Difference]: Finished difference Result 552972 states and 645128 transitions. [2019-09-16 16:19:24,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:19:24,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-09-16 16:19:24,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:19:24,893 INFO L225 Difference]: With dead ends: 552972 [2019-09-16 16:19:24,893 INFO L226 Difference]: Without dead ends: 311306 [2019-09-16 16:19:25,033 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:25,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311306 states. [2019-09-16 16:19:32,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311306 to 311304. [2019-09-16 16:19:32,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311304 states. [2019-09-16 16:19:33,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311304 states to 311304 states and 356358 transitions. [2019-09-16 16:19:33,083 INFO L78 Accepts]: Start accepts. Automaton has 311304 states and 356358 transitions. Word has length 36 [2019-09-16 16:19:33,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:19:33,084 INFO L475 AbstractCegarLoop]: Abstraction has 311304 states and 356358 transitions. [2019-09-16 16:19:33,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:19:33,084 INFO L276 IsEmpty]: Start isEmpty. Operand 311304 states and 356358 transitions. [2019-09-16 16:19:33,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-16 16:19:33,226 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:19:33,226 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:19:33,226 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:19:33,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:19:33,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1523025865, now seen corresponding path program 1 times [2019-09-16 16:19:33,227 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:19:33,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:19:33,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:33,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:19:33,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:19:33,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-09-16 16:19:33,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:19:33,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:19:33,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:19:33,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:19:33,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:33,244 INFO L87 Difference]: Start difference. First operand 311304 states and 356358 transitions. Second operand 3 states. [2019-09-16 16:19:35,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:19:35,791 INFO L93 Difference]: Finished difference Result 466956 states and 532488 transitions. [2019-09-16 16:19:35,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:19:35,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-09-16 16:19:35,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:19:36,109 INFO L225 Difference]: With dead ends: 466956 [2019-09-16 16:19:36,110 INFO L226 Difference]: Without dead ends: 315402 [2019-09-16 16:19:36,216 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:36,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315402 states. [2019-09-16 16:19:45,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315402 to 315400. [2019-09-16 16:19:45,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315400 states. [2019-09-16 16:19:46,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315400 states to 315400 states and 356358 transitions. [2019-09-16 16:19:46,043 INFO L78 Accepts]: Start accepts. Automaton has 315400 states and 356358 transitions. Word has length 37 [2019-09-16 16:19:46,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:19:46,043 INFO L475 AbstractCegarLoop]: Abstraction has 315400 states and 356358 transitions. [2019-09-16 16:19:46,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:19:46,044 INFO L276 IsEmpty]: Start isEmpty. Operand 315400 states and 356358 transitions. [2019-09-16 16:19:46,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-16 16:19:46,180 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:19:46,180 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:19:46,180 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:19:46,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:19:46,181 INFO L82 PathProgramCache]: Analyzing trace with hash -471118841, now seen corresponding path program 1 times [2019-09-16 16:19:46,181 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:19:46,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:19:46,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:46,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:19:46,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:46,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:19:46,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:19:46,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:19:46,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:19:46,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:19:46,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:19:46,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:46,197 INFO L87 Difference]: Start difference. First operand 315400 states and 356358 transitions. Second operand 3 states. [2019-09-16 16:19:50,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:19:50,581 INFO L93 Difference]: Finished difference Result 507914 states and 569351 transitions. [2019-09-16 16:19:50,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:19:50,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-09-16 16:19:50,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:19:51,120 INFO L225 Difference]: With dead ends: 507914 [2019-09-16 16:19:51,120 INFO L226 Difference]: Without dead ends: 507912 [2019-09-16 16:19:51,182 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:51,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507912 states. [2019-09-16 16:20:03,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507912 to 491528. [2019-09-16 16:20:03,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491528 states. [2019-09-16 16:20:04,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491528 states to 491528 states and 544774 transitions. [2019-09-16 16:20:04,763 INFO L78 Accepts]: Start accepts. Automaton has 491528 states and 544774 transitions. Word has length 37 [2019-09-16 16:20:04,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:20:04,763 INFO L475 AbstractCegarLoop]: Abstraction has 491528 states and 544774 transitions. [2019-09-16 16:20:04,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:20:04,763 INFO L276 IsEmpty]: Start isEmpty. Operand 491528 states and 544774 transitions. [2019-09-16 16:20:05,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-16 16:20:05,024 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:20:05,024 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:20:05,024 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:20:05,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:20:05,024 INFO L82 PathProgramCache]: Analyzing trace with hash -2059466743, now seen corresponding path program 1 times [2019-09-16 16:20:05,024 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:20:05,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:20:05,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:20:05,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:20:05,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:20:05,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:20:05,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:20:05,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:20:05,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:20:05,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:20:05,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:20:05,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:20:05,042 INFO L87 Difference]: Start difference. First operand 491528 states and 544774 transitions. Second operand 3 states. [2019-09-16 16:20:15,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:20:15,067 INFO L93 Difference]: Finished difference Result 1097736 states and 1200134 transitions. [2019-09-16 16:20:15,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:20:15,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-09-16 16:20:15,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:20:15,068 INFO L225 Difference]: With dead ends: 1097736 [2019-09-16 16:20:15,068 INFO L226 Difference]: Without dead ends: 0 [2019-09-16 16:20:16,720 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:20:16,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-16 16:20:16,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-16 16:20:16,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-16 16:20:16,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-16 16:20:16,721 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2019-09-16 16:20:16,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:20:16,722 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-16 16:20:16,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:20:16,722 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-16 16:20:16,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-16 16:20:16,727 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-16 16:20:16,801 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-16 16:20:16,801 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-16 16:20:16,801 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-16 16:20:16,801 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-16 16:20:16,801 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-16 16:20:16,801 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-16 16:20:16,802 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 219) no Hoare annotation was computed. [2019-09-16 16:20:16,802 INFO L443 ceAbstractionStarter]: For program point L184-1(lines 51 214) no Hoare annotation was computed. [2019-09-16 16:20:16,802 INFO L443 ceAbstractionStarter]: For program point L118-1(lines 51 214) no Hoare annotation was computed. [2019-09-16 16:20:16,802 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 51 214) no Hoare annotation was computed. [2019-09-16 16:20:16,802 INFO L443 ceAbstractionStarter]: For program point L185(line 185) no Hoare annotation was computed. [2019-09-16 16:20:16,802 INFO L443 ceAbstractionStarter]: For program point L86(lines 86 88) no Hoare annotation was computed. [2019-09-16 16:20:16,802 INFO L443 ceAbstractionStarter]: For program point L53(lines 53 55) no Hoare annotation was computed. [2019-09-16 16:20:16,802 INFO L443 ceAbstractionStarter]: For program point L86-2(lines 51 214) no Hoare annotation was computed. [2019-09-16 16:20:16,802 INFO L443 ceAbstractionStarter]: For program point L169-1(lines 51 214) no Hoare annotation was computed. [2019-09-16 16:20:16,803 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 219) no Hoare annotation was computed. [2019-09-16 16:20:16,803 INFO L443 ceAbstractionStarter]: For program point L170(line 170) no Hoare annotation was computed. [2019-09-16 16:20:16,803 INFO L443 ceAbstractionStarter]: For program point L154-1(lines 51 214) no Hoare annotation was computed. [2019-09-16 16:20:16,803 INFO L443 ceAbstractionStarter]: For program point L204-1(lines 51 214) no Hoare annotation was computed. [2019-09-16 16:20:16,803 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 51 214) no Hoare annotation was computed. [2019-09-16 16:20:16,803 INFO L443 ceAbstractionStarter]: For program point L155(line 155) no Hoare annotation was computed. [2019-09-16 16:20:16,803 INFO L443 ceAbstractionStarter]: For program point L122-1(lines 51 214) no Hoare annotation was computed. [2019-09-16 16:20:16,803 INFO L443 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-09-16 16:20:16,803 INFO L443 ceAbstractionStarter]: For program point L106-1(lines 51 214) no Hoare annotation was computed. [2019-09-16 16:20:16,804 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 51 214) no Hoare annotation was computed. [2019-09-16 16:20:16,804 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 51 214) no Hoare annotation was computed. [2019-09-16 16:20:16,804 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-09-16 16:20:16,804 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 51 214) no Hoare annotation was computed. [2019-09-16 16:20:16,804 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-09-16 16:20:16,804 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 51 214) no Hoare annotation was computed. [2019-09-16 16:20:16,804 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 51 214) no Hoare annotation was computed. [2019-09-16 16:20:16,804 INFO L446 ceAbstractionStarter]: At program point L209-1(lines 51 214) the Hoare annotation is: true [2019-09-16 16:20:16,804 INFO L443 ceAbstractionStarter]: For program point L110-1(lines 51 214) no Hoare annotation was computed. [2019-09-16 16:20:16,804 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-09-16 16:20:16,805 INFO L443 ceAbstractionStarter]: For program point L94-1(lines 51 214) no Hoare annotation was computed. [2019-09-16 16:20:16,805 INFO L443 ceAbstractionStarter]: For program point L210(line 210) no Hoare annotation was computed. [2019-09-16 16:20:16,805 INFO L439 ceAbstractionStarter]: At program point L210-1(lines 5 219) the Hoare annotation is: false [2019-09-16 16:20:16,805 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 51 214) no Hoare annotation was computed. [2019-09-16 16:20:16,805 INFO L443 ceAbstractionStarter]: For program point L194-1(lines 51 214) no Hoare annotation was computed. [2019-09-16 16:20:16,805 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-09-16 16:20:16,805 INFO L443 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2019-09-16 16:20:16,805 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 219) the Hoare annotation is: true [2019-09-16 16:20:16,805 INFO L443 ceAbstractionStarter]: For program point L179-1(lines 51 214) no Hoare annotation was computed. [2019-09-16 16:20:16,806 INFO L443 ceAbstractionStarter]: For program point L130-1(lines 51 214) no Hoare annotation was computed. [2019-09-16 16:20:16,806 INFO L443 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-09-16 16:20:16,806 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 51 214) no Hoare annotation was computed. [2019-09-16 16:20:16,806 INFO L443 ceAbstractionStarter]: For program point L164-1(lines 51 214) no Hoare annotation was computed. [2019-09-16 16:20:16,806 INFO L443 ceAbstractionStarter]: For program point L98-1(lines 51 214) no Hoare annotation was computed. [2019-09-16 16:20:16,806 INFO L443 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2019-09-16 16:20:16,806 INFO L446 ceAbstractionStarter]: At program point L215(lines 5 219) the Hoare annotation is: true [2019-09-16 16:20:16,806 INFO L443 ceAbstractionStarter]: For program point L149-1(lines 51 214) no Hoare annotation was computed. [2019-09-16 16:20:16,806 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 217) no Hoare annotation was computed. [2019-09-16 16:20:16,807 INFO L443 ceAbstractionStarter]: For program point L199-1(lines 51 214) no Hoare annotation was computed. [2019-09-16 16:20:16,807 INFO L443 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-09-16 16:20:16,807 INFO L443 ceAbstractionStarter]: For program point L200(line 200) no Hoare annotation was computed. [2019-09-16 16:20:16,807 INFO L443 ceAbstractionStarter]: For program point L134-1(lines 51 214) no Hoare annotation was computed. [2019-09-16 16:20:16,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 04:20:16 BoogieIcfgContainer [2019-09-16 16:20:16,817 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 16:20:16,820 INFO L168 Benchmark]: Toolchain (without parser) took 103682.68 ms. Allocated memory was 129.5 MB in the beginning and 3.2 GB in the end (delta: 3.1 GB). Free memory was 85.5 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-09-16 16:20:16,821 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 129.5 MB. Free memory was 103.7 MB in the beginning and 103.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-16 16:20:16,823 INFO L168 Benchmark]: CACSL2BoogieTranslator took 433.22 ms. Allocated memory was 129.5 MB in the beginning and 197.7 MB in the end (delta: 68.2 MB). Free memory was 85.3 MB in the beginning and 173.5 MB in the end (delta: -88.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2019-09-16 16:20:16,831 INFO L168 Benchmark]: Boogie Preprocessor took 40.20 ms. Allocated memory is still 197.7 MB. Free memory was 173.5 MB in the beginning and 171.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-09-16 16:20:16,832 INFO L168 Benchmark]: RCFGBuilder took 504.10 ms. Allocated memory is still 197.7 MB. Free memory was 171.5 MB in the beginning and 149.7 MB in the end (delta: 21.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-09-16 16:20:16,834 INFO L168 Benchmark]: TraceAbstraction took 102700.44 ms. Allocated memory was 197.7 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 149.0 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-09-16 16:20:16,840 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.21 ms. Allocated memory is still 129.5 MB. Free memory was 103.7 MB in the beginning and 103.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 433.22 ms. Allocated memory was 129.5 MB in the beginning and 197.7 MB in the end (delta: 68.2 MB). Free memory was 85.3 MB in the beginning and 173.5 MB in the end (delta: -88.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.20 ms. Allocated memory is still 197.7 MB. Free memory was 173.5 MB in the beginning and 171.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 504.10 ms. Allocated memory is still 197.7 MB. Free memory was 171.5 MB in the beginning and 149.7 MB in the end (delta: 21.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 102700.44 ms. Allocated memory was 197.7 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 149.0 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 217]: 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: 51]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 56 locations, 1 error locations. SAFE Result, 102.6s OverallTime, 40 OverallIterations, 1 TraceHistogramMax, 40.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4632 SDtfs, 2311 SDslu, 3194 SDs, 0 SdLazy, 213 SolverSat, 40 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=491528occurred in iteration=39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 59.4s AutomataMinimizationTime, 40 MinimizatonAttempts, 65580 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 16394 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1225 NumberOfCodeBlocks, 1225 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1185 ConstructedInterpolants, 0 QuantifiedInterpolants, 74775 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 40 InterpolantComputations, 40 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...