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_12.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:13:33,629 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:13:33,631 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:13:33,644 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:13:33,644 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:13:33,645 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:13:33,647 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:13:33,648 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:13:33,650 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:13:33,651 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:13:33,652 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:13:33,653 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:13:33,653 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:13:33,654 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:13:33,655 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:13:33,656 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:13:33,657 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:13:33,658 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:13:33,660 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:13:33,662 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:13:33,664 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:13:33,665 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:13:33,667 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:13:33,667 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:13:33,669 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:13:33,670 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:13:33,670 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:13:33,671 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:13:33,671 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:13:33,672 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:13:33,672 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:13:33,673 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:13:33,674 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:13:33,675 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:13:33,676 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:13:33,676 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:13:33,677 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:13:33,677 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:13:33,677 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:13:33,678 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:13:33,679 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:13:33,679 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 23:13:33,694 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:13:33,694 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:13:33,696 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:13:33,696 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:13:33,696 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:13:33,696 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:13:33,697 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:13:33,697 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:13:33,697 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:13:33,697 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:13:33,697 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:13:33,698 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:13:33,698 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:13:33,698 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:13:33,698 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:13:33,698 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:13:33,699 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:13:33,699 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:13:33,699 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:13:33,699 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:13:33,699 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:13:33,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:13:33,700 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:13:33,700 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:13:33,700 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:13:33,700 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:13:33,701 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:13:33,701 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:13:33,701 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:13:33,972 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:13:33,983 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:13:33,987 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:13:33,989 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:13:33,989 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:13:33,990 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_12.c [2019-10-14 23:13:34,055 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8ba54cda/7f6b15df4413469b91cb5672cc174402/FLAG9e3b7c91c [2019-10-14 23:13:34,542 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:13:34,542 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_12.c [2019-10-14 23:13:34,550 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8ba54cda/7f6b15df4413469b91cb5672cc174402/FLAG9e3b7c91c [2019-10-14 23:13:34,926 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8ba54cda/7f6b15df4413469b91cb5672cc174402 [2019-10-14 23:13:34,936 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:13:34,939 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:13:34,940 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:13:34,941 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:13:34,945 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:13:34,946 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:13:34" (1/1) ... [2019-10-14 23:13:34,949 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cc444e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:34, skipping insertion in model container [2019-10-14 23:13:34,950 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:13:34" (1/1) ... [2019-10-14 23:13:34,958 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:13:34,987 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:13:35,253 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:13:35,259 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:13:35,314 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:13:35,410 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:13:35,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:35 WrapperNode [2019-10-14 23:13:35,410 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:13:35,411 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:13:35,412 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:13:35,412 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:13:35,424 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:35" (1/1) ... [2019-10-14 23:13:35,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:35" (1/1) ... [2019-10-14 23:13:35,429 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:35" (1/1) ... [2019-10-14 23:13:35,430 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:35" (1/1) ... [2019-10-14 23:13:35,436 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:35" (1/1) ... [2019-10-14 23:13:35,448 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:35" (1/1) ... [2019-10-14 23:13:35,449 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:35" (1/1) ... [2019-10-14 23:13:35,452 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:13:35,452 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:13:35,452 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:13:35,453 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:13:35,453 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:13:35,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:13:35,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:13:35,513 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:13:35,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:13:35,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:13:35,514 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:13:35,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:13:35,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:13:35,879 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:13:35,879 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-14 23:13:35,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:13:35 BoogieIcfgContainer [2019-10-14 23:13:35,881 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:13:35,882 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:13:35,882 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:13:35,885 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:13:35,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:13:34" (1/3) ... [2019-10-14 23:13:35,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@204dc672 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:13:35, skipping insertion in model container [2019-10-14 23:13:35,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:35" (2/3) ... [2019-10-14 23:13:35,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@204dc672 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:13:35, skipping insertion in model container [2019-10-14 23:13:35,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:13:35" (3/3) ... [2019-10-14 23:13:35,888 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_12.c [2019-10-14 23:13:35,898 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:13:35,904 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:13:35,913 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:13:35,938 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:13:35,938 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:13:35,939 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:13:35,939 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:13:35,939 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:13:35,939 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:13:35,939 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:13:35,939 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:13:35,958 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2019-10-14 23:13:35,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 23:13:35,963 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:35,964 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:35,966 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:35,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:35,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1339057171, now seen corresponding path program 1 times [2019-10-14 23:13:35,978 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:35,979 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005123058] [2019-10-14 23:13:35,979 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:35,979 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:35,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:36,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:36,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:36,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:36,177 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005123058] [2019-10-14 23:13:36,178 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:36,178 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:36,179 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066989723] [2019-10-14 23:13:36,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:36,184 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:36,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:36,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:36,200 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2019-10-14 23:13:36,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:36,259 INFO L93 Difference]: Finished difference Result 99 states and 174 transitions. [2019-10-14 23:13:36,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:36,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-14 23:13:36,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:36,275 INFO L225 Difference]: With dead ends: 99 [2019-10-14 23:13:36,275 INFO L226 Difference]: Without dead ends: 84 [2019-10-14 23:13:36,278 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:36,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-10-14 23:13:36,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 58. [2019-10-14 23:13:36,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-14 23:13:36,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 105 transitions. [2019-10-14 23:13:36,327 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 105 transitions. Word has length 22 [2019-10-14 23:13:36,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:36,327 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 105 transitions. [2019-10-14 23:13:36,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:36,327 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 105 transitions. [2019-10-14 23:13:36,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 23:13:36,328 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:36,329 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:36,329 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:36,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:36,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1676046447, now seen corresponding path program 1 times [2019-10-14 23:13:36,330 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:36,330 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420243714] [2019-10-14 23:13:36,331 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:36,331 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:36,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:36,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:36,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:36,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:36,404 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420243714] [2019-10-14 23:13:36,404 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:36,405 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:36,405 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452453747] [2019-10-14 23:13:36,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:36,407 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:36,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:36,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:36,408 INFO L87 Difference]: Start difference. First operand 58 states and 105 transitions. Second operand 3 states. [2019-10-14 23:13:36,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:36,437 INFO L93 Difference]: Finished difference Result 137 states and 252 transitions. [2019-10-14 23:13:36,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:36,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-14 23:13:36,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:36,440 INFO L225 Difference]: With dead ends: 137 [2019-10-14 23:13:36,440 INFO L226 Difference]: Without dead ends: 84 [2019-10-14 23:13:36,442 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:36,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-10-14 23:13:36,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2019-10-14 23:13:36,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-10-14 23:13:36,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 149 transitions. [2019-10-14 23:13:36,455 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 149 transitions. Word has length 22 [2019-10-14 23:13:36,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:36,455 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 149 transitions. [2019-10-14 23:13:36,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:36,455 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 149 transitions. [2019-10-14 23:13:36,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-14 23:13:36,457 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:36,457 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:36,457 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:36,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:36,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1439113391, now seen corresponding path program 1 times [2019-10-14 23:13:36,458 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:36,458 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221494497] [2019-10-14 23:13:36,459 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:36,459 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:36,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:36,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:36,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:36,519 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221494497] [2019-10-14 23:13:36,519 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:36,519 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:36,520 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506352099] [2019-10-14 23:13:36,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:36,520 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:36,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:36,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:36,521 INFO L87 Difference]: Start difference. First operand 82 states and 149 transitions. Second operand 3 states. [2019-10-14 23:13:36,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:36,568 INFO L93 Difference]: Finished difference Result 126 states and 225 transitions. [2019-10-14 23:13:36,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:36,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-14 23:13:36,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:36,571 INFO L225 Difference]: With dead ends: 126 [2019-10-14 23:13:36,571 INFO L226 Difference]: Without dead ends: 87 [2019-10-14 23:13:36,572 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:36,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-10-14 23:13:36,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2019-10-14 23:13:36,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-14 23:13:36,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 151 transitions. [2019-10-14 23:13:36,594 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 151 transitions. Word has length 23 [2019-10-14 23:13:36,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:36,594 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 151 transitions. [2019-10-14 23:13:36,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:36,595 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 151 transitions. [2019-10-14 23:13:36,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-14 23:13:36,596 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:36,596 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:36,596 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:36,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:36,597 INFO L82 PathProgramCache]: Analyzing trace with hash 418045037, now seen corresponding path program 1 times [2019-10-14 23:13:36,597 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:36,597 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027086502] [2019-10-14 23:13:36,597 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:36,597 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:36,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:36,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:36,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:36,663 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027086502] [2019-10-14 23:13:36,663 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:36,664 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:36,664 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565339553] [2019-10-14 23:13:36,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:36,665 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:36,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:36,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:36,668 INFO L87 Difference]: Start difference. First operand 85 states and 151 transitions. Second operand 3 states. [2019-10-14 23:13:36,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:36,701 INFO L93 Difference]: Finished difference Result 160 states and 288 transitions. [2019-10-14 23:13:36,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:36,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-14 23:13:36,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:36,704 INFO L225 Difference]: With dead ends: 160 [2019-10-14 23:13:36,704 INFO L226 Difference]: Without dead ends: 158 [2019-10-14 23:13:36,705 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:36,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-10-14 23:13:36,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 112. [2019-10-14 23:13:36,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-10-14 23:13:36,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 200 transitions. [2019-10-14 23:13:36,718 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 200 transitions. Word has length 23 [2019-10-14 23:13:36,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:36,719 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 200 transitions. [2019-10-14 23:13:36,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:36,719 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 200 transitions. [2019-10-14 23:13:36,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-14 23:13:36,720 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:36,720 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:36,721 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:36,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:36,721 INFO L82 PathProgramCache]: Analyzing trace with hash -861818641, now seen corresponding path program 1 times [2019-10-14 23:13:36,721 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:36,722 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528606943] [2019-10-14 23:13:36,722 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:36,722 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:36,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:36,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:36,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:36,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:36,777 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528606943] [2019-10-14 23:13:36,778 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:36,778 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:36,779 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597930161] [2019-10-14 23:13:36,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:36,780 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:36,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:36,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:36,781 INFO L87 Difference]: Start difference. First operand 112 states and 200 transitions. Second operand 3 states. [2019-10-14 23:13:36,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:36,807 INFO L93 Difference]: Finished difference Result 264 states and 478 transitions. [2019-10-14 23:13:36,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:36,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-14 23:13:36,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:36,810 INFO L225 Difference]: With dead ends: 264 [2019-10-14 23:13:36,810 INFO L226 Difference]: Without dead ends: 160 [2019-10-14 23:13:36,811 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:36,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-10-14 23:13:36,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2019-10-14 23:13:36,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-10-14 23:13:36,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 282 transitions. [2019-10-14 23:13:36,832 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 282 transitions. Word has length 23 [2019-10-14 23:13:36,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:36,835 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 282 transitions. [2019-10-14 23:13:36,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:36,836 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 282 transitions. [2019-10-14 23:13:36,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-14 23:13:36,837 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:36,837 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:36,838 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:36,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:36,838 INFO L82 PathProgramCache]: Analyzing trace with hash 74707332, now seen corresponding path program 1 times [2019-10-14 23:13:36,838 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:36,839 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676561436] [2019-10-14 23:13:36,839 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:36,839 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:36,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:36,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:36,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:36,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:36,881 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676561436] [2019-10-14 23:13:36,882 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:36,882 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:36,882 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439805848] [2019-10-14 23:13:36,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:36,883 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:36,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:36,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:36,884 INFO L87 Difference]: Start difference. First operand 158 states and 282 transitions. Second operand 3 states. [2019-10-14 23:13:36,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:36,901 INFO L93 Difference]: Finished difference Result 237 states and 421 transitions. [2019-10-14 23:13:36,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:36,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-14 23:13:36,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:36,903 INFO L225 Difference]: With dead ends: 237 [2019-10-14 23:13:36,904 INFO L226 Difference]: Without dead ends: 162 [2019-10-14 23:13:36,905 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:36,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-10-14 23:13:36,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2019-10-14 23:13:36,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-10-14 23:13:36,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 282 transitions. [2019-10-14 23:13:36,917 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 282 transitions. Word has length 24 [2019-10-14 23:13:36,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:36,917 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 282 transitions. [2019-10-14 23:13:36,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:36,918 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 282 transitions. [2019-10-14 23:13:36,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-14 23:13:36,919 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:36,919 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:36,919 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:36,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:36,920 INFO L82 PathProgramCache]: Analyzing trace with hash -946361022, now seen corresponding path program 1 times [2019-10-14 23:13:36,920 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:36,920 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179999967] [2019-10-14 23:13:36,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:36,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:36,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:36,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:37,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:37,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:37,021 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179999967] [2019-10-14 23:13:37,021 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:37,021 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:37,021 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758900506] [2019-10-14 23:13:37,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:37,022 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:37,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:37,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:37,026 INFO L87 Difference]: Start difference. First operand 160 states and 282 transitions. Second operand 3 states. [2019-10-14 23:13:37,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:37,053 INFO L93 Difference]: Finished difference Result 300 states and 536 transitions. [2019-10-14 23:13:37,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:37,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-14 23:13:37,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:37,056 INFO L225 Difference]: With dead ends: 300 [2019-10-14 23:13:37,057 INFO L226 Difference]: Without dead ends: 298 [2019-10-14 23:13:37,057 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:37,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-10-14 23:13:37,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 216. [2019-10-14 23:13:37,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-10-14 23:13:37,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 378 transitions. [2019-10-14 23:13:37,074 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 378 transitions. Word has length 24 [2019-10-14 23:13:37,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:37,075 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 378 transitions. [2019-10-14 23:13:37,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:37,075 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 378 transitions. [2019-10-14 23:13:37,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-14 23:13:37,077 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:37,077 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:37,077 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:37,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:37,078 INFO L82 PathProgramCache]: Analyzing trace with hash 2068742596, now seen corresponding path program 1 times [2019-10-14 23:13:37,078 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:37,078 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299535950] [2019-10-14 23:13:37,078 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:37,079 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:37,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:37,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:37,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:37,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:37,128 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299535950] [2019-10-14 23:13:37,128 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:37,129 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:37,129 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768815370] [2019-10-14 23:13:37,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:37,129 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:37,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:37,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:37,130 INFO L87 Difference]: Start difference. First operand 216 states and 378 transitions. Second operand 3 states. [2019-10-14 23:13:37,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:37,166 INFO L93 Difference]: Finished difference Result 512 states and 904 transitions. [2019-10-14 23:13:37,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:37,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-14 23:13:37,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:37,172 INFO L225 Difference]: With dead ends: 512 [2019-10-14 23:13:37,172 INFO L226 Difference]: Without dead ends: 306 [2019-10-14 23:13:37,176 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:37,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-10-14 23:13:37,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2019-10-14 23:13:37,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-10-14 23:13:37,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 530 transitions. [2019-10-14 23:13:37,200 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 530 transitions. Word has length 24 [2019-10-14 23:13:37,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:37,201 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 530 transitions. [2019-10-14 23:13:37,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:37,201 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 530 transitions. [2019-10-14 23:13:37,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-14 23:13:37,210 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:37,210 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:37,211 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:37,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:37,211 INFO L82 PathProgramCache]: Analyzing trace with hash 727792804, now seen corresponding path program 1 times [2019-10-14 23:13:37,211 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:37,212 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492198228] [2019-10-14 23:13:37,212 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:37,212 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:37,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:37,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:37,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:37,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:37,274 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492198228] [2019-10-14 23:13:37,275 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:37,275 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:37,275 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475483873] [2019-10-14 23:13:37,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:37,276 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:37,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:37,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:37,277 INFO L87 Difference]: Start difference. First operand 304 states and 530 transitions. Second operand 3 states. [2019-10-14 23:13:37,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:37,303 INFO L93 Difference]: Finished difference Result 456 states and 792 transitions. [2019-10-14 23:13:37,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:37,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-14 23:13:37,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:37,306 INFO L225 Difference]: With dead ends: 456 [2019-10-14 23:13:37,307 INFO L226 Difference]: Without dead ends: 310 [2019-10-14 23:13:37,308 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:37,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-10-14 23:13:37,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308. [2019-10-14 23:13:37,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-10-14 23:13:37,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 530 transitions. [2019-10-14 23:13:37,320 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 530 transitions. Word has length 25 [2019-10-14 23:13:37,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:37,322 INFO L462 AbstractCegarLoop]: Abstraction has 308 states and 530 transitions. [2019-10-14 23:13:37,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:37,322 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 530 transitions. [2019-10-14 23:13:37,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-14 23:13:37,323 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:37,323 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:37,326 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:37,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:37,327 INFO L82 PathProgramCache]: Analyzing trace with hash -293275550, now seen corresponding path program 1 times [2019-10-14 23:13:37,328 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:37,334 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758353479] [2019-10-14 23:13:37,335 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:37,335 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:37,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:37,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:37,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:37,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:37,372 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758353479] [2019-10-14 23:13:37,372 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:37,373 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:37,373 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952954079] [2019-10-14 23:13:37,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:37,374 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:37,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:37,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:37,375 INFO L87 Difference]: Start difference. First operand 308 states and 530 transitions. Second operand 3 states. [2019-10-14 23:13:37,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:37,397 INFO L93 Difference]: Finished difference Result 572 states and 1000 transitions. [2019-10-14 23:13:37,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:37,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-14 23:13:37,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:37,403 INFO L225 Difference]: With dead ends: 572 [2019-10-14 23:13:37,403 INFO L226 Difference]: Without dead ends: 570 [2019-10-14 23:13:37,403 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:37,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-10-14 23:13:37,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 424. [2019-10-14 23:13:37,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2019-10-14 23:13:37,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 718 transitions. [2019-10-14 23:13:37,418 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 718 transitions. Word has length 25 [2019-10-14 23:13:37,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:37,418 INFO L462 AbstractCegarLoop]: Abstraction has 424 states and 718 transitions. [2019-10-14 23:13:37,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:37,418 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 718 transitions. [2019-10-14 23:13:37,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-14 23:13:37,420 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:37,420 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:37,420 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:37,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:37,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1573139228, now seen corresponding path program 1 times [2019-10-14 23:13:37,421 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:37,421 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141651403] [2019-10-14 23:13:37,421 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:37,421 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:37,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:37,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:37,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:37,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:37,447 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141651403] [2019-10-14 23:13:37,448 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:37,448 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:37,448 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098170125] [2019-10-14 23:13:37,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:37,449 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:37,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:37,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:37,449 INFO L87 Difference]: Start difference. First operand 424 states and 718 transitions. Second operand 3 states. [2019-10-14 23:13:37,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:37,487 INFO L93 Difference]: Finished difference Result 1004 states and 1712 transitions. [2019-10-14 23:13:37,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:37,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-14 23:13:37,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:37,492 INFO L225 Difference]: With dead ends: 1004 [2019-10-14 23:13:37,492 INFO L226 Difference]: Without dead ends: 594 [2019-10-14 23:13:37,493 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:37,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-10-14 23:13:37,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 592. [2019-10-14 23:13:37,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-10-14 23:13:37,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 998 transitions. [2019-10-14 23:13:37,519 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 998 transitions. Word has length 25 [2019-10-14 23:13:37,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:37,519 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 998 transitions. [2019-10-14 23:13:37,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:37,519 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 998 transitions. [2019-10-14 23:13:37,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-14 23:13:37,520 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:37,521 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:37,521 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:37,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:37,521 INFO L82 PathProgramCache]: Analyzing trace with hash -501393703, now seen corresponding path program 1 times [2019-10-14 23:13:37,522 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:37,522 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294386304] [2019-10-14 23:13:37,522 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:37,522 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:37,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:37,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:37,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:37,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:37,561 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294386304] [2019-10-14 23:13:37,562 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:37,562 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:37,562 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76679967] [2019-10-14 23:13:37,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:37,563 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:37,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:37,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:37,564 INFO L87 Difference]: Start difference. First operand 592 states and 998 transitions. Second operand 3 states. [2019-10-14 23:13:37,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:37,586 INFO L93 Difference]: Finished difference Result 888 states and 1492 transitions. [2019-10-14 23:13:37,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:37,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-14 23:13:37,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:37,591 INFO L225 Difference]: With dead ends: 888 [2019-10-14 23:13:37,591 INFO L226 Difference]: Without dead ends: 602 [2019-10-14 23:13:37,592 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:37,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-10-14 23:13:37,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2019-10-14 23:13:37,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-14 23:13:37,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 998 transitions. [2019-10-14 23:13:37,609 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 998 transitions. Word has length 26 [2019-10-14 23:13:37,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:37,610 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 998 transitions. [2019-10-14 23:13:37,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:37,610 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 998 transitions. [2019-10-14 23:13:37,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-14 23:13:37,611 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:37,611 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:37,611 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:37,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:37,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1522462057, now seen corresponding path program 1 times [2019-10-14 23:13:37,612 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:37,612 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176081878] [2019-10-14 23:13:37,612 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:37,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:37,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:37,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:37,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:37,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:37,649 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176081878] [2019-10-14 23:13:37,649 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:37,649 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:37,649 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075265894] [2019-10-14 23:13:37,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:37,650 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:37,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:37,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:37,651 INFO L87 Difference]: Start difference. First operand 600 states and 998 transitions. Second operand 3 states. [2019-10-14 23:13:37,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:37,678 INFO L93 Difference]: Finished difference Result 1100 states and 1864 transitions. [2019-10-14 23:13:37,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:37,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-14 23:13:37,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:37,686 INFO L225 Difference]: With dead ends: 1100 [2019-10-14 23:13:37,687 INFO L226 Difference]: Without dead ends: 1098 [2019-10-14 23:13:37,687 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:37,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2019-10-14 23:13:37,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 840. [2019-10-14 23:13:37,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-10-14 23:13:37,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1366 transitions. [2019-10-14 23:13:37,718 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1366 transitions. Word has length 26 [2019-10-14 23:13:37,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:37,719 INFO L462 AbstractCegarLoop]: Abstraction has 840 states and 1366 transitions. [2019-10-14 23:13:37,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:37,719 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1366 transitions. [2019-10-14 23:13:37,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-14 23:13:37,721 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:37,721 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:37,721 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:37,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:37,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1492641561, now seen corresponding path program 1 times [2019-10-14 23:13:37,722 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:37,722 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980683174] [2019-10-14 23:13:37,722 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:37,722 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:37,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:37,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-10-14 23:13:37,750 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980683174] [2019-10-14 23:13:37,750 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:37,751 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:37,751 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333948638] [2019-10-14 23:13:37,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:37,752 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:37,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:37,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:37,753 INFO L87 Difference]: Start difference. First operand 840 states and 1366 transitions. Second operand 3 states. [2019-10-14 23:13:37,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:37,786 INFO L93 Difference]: Finished difference Result 1980 states and 3240 transitions. [2019-10-14 23:13:37,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:37,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-14 23:13:37,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:37,793 INFO L225 Difference]: With dead ends: 1980 [2019-10-14 23:13:37,793 INFO L226 Difference]: Without dead ends: 1162 [2019-10-14 23:13:37,795 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:37,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2019-10-14 23:13:37,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1160. [2019-10-14 23:13:37,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160 states. [2019-10-14 23:13:37,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1878 transitions. [2019-10-14 23:13:37,835 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1878 transitions. Word has length 26 [2019-10-14 23:13:37,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:37,835 INFO L462 AbstractCegarLoop]: Abstraction has 1160 states and 1878 transitions. [2019-10-14 23:13:37,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:37,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1878 transitions. [2019-10-14 23:13:37,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-14 23:13:37,838 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:37,838 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:37,838 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:37,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:37,839 INFO L82 PathProgramCache]: Analyzing trace with hash 48530585, now seen corresponding path program 1 times [2019-10-14 23:13:37,839 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:37,839 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497742775] [2019-10-14 23:13:37,839 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:37,839 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:37,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:37,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:37,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:37,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:37,890 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497742775] [2019-10-14 23:13:37,891 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:37,891 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:37,891 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907715221] [2019-10-14 23:13:37,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:37,892 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:37,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:37,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:37,893 INFO L87 Difference]: Start difference. First operand 1160 states and 1878 transitions. Second operand 3 states. [2019-10-14 23:13:37,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:37,930 INFO L93 Difference]: Finished difference Result 1740 states and 2808 transitions. [2019-10-14 23:13:37,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:37,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-14 23:13:37,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:37,936 INFO L225 Difference]: With dead ends: 1740 [2019-10-14 23:13:37,936 INFO L226 Difference]: Without dead ends: 1178 [2019-10-14 23:13:37,940 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:37,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2019-10-14 23:13:37,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1176. [2019-10-14 23:13:37,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1176 states. [2019-10-14 23:13:37,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1878 transitions. [2019-10-14 23:13:37,981 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1878 transitions. Word has length 27 [2019-10-14 23:13:37,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:37,981 INFO L462 AbstractCegarLoop]: Abstraction has 1176 states and 1878 transitions. [2019-10-14 23:13:37,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:37,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1878 transitions. [2019-10-14 23:13:37,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-14 23:13:37,984 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:37,984 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:37,984 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:37,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:37,985 INFO L82 PathProgramCache]: Analyzing trace with hash -972537769, now seen corresponding path program 1 times [2019-10-14 23:13:37,985 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:37,985 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221399317] [2019-10-14 23:13:37,985 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:37,986 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:37,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:37,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:38,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:38,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:38,019 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221399317] [2019-10-14 23:13:38,019 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:38,019 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:38,019 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255652119] [2019-10-14 23:13:38,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:38,020 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:38,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:38,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:38,021 INFO L87 Difference]: Start difference. First operand 1176 states and 1878 transitions. Second operand 3 states. [2019-10-14 23:13:38,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:38,066 INFO L93 Difference]: Finished difference Result 2124 states and 3464 transitions. [2019-10-14 23:13:38,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:38,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-14 23:13:38,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:38,077 INFO L225 Difference]: With dead ends: 2124 [2019-10-14 23:13:38,077 INFO L226 Difference]: Without dead ends: 2122 [2019-10-14 23:13:38,078 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:38,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2019-10-14 23:13:38,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 1672. [2019-10-14 23:13:38,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2019-10-14 23:13:38,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2598 transitions. [2019-10-14 23:13:38,131 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 2598 transitions. Word has length 27 [2019-10-14 23:13:38,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:38,132 INFO L462 AbstractCegarLoop]: Abstraction has 1672 states and 2598 transitions. [2019-10-14 23:13:38,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:38,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2598 transitions. [2019-10-14 23:13:38,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-14 23:13:38,135 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:38,135 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:38,135 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:38,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:38,135 INFO L82 PathProgramCache]: Analyzing trace with hash 2042565849, now seen corresponding path program 1 times [2019-10-14 23:13:38,136 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:38,136 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575142755] [2019-10-14 23:13:38,136 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:38,136 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:38,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:38,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:38,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:38,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:38,164 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575142755] [2019-10-14 23:13:38,164 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:38,164 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:38,164 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574394181] [2019-10-14 23:13:38,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:38,165 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:38,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:38,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:38,165 INFO L87 Difference]: Start difference. First operand 1672 states and 2598 transitions. Second operand 3 states. [2019-10-14 23:13:38,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:38,211 INFO L93 Difference]: Finished difference Result 3916 states and 6120 transitions. [2019-10-14 23:13:38,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:38,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-14 23:13:38,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:38,222 INFO L225 Difference]: With dead ends: 3916 [2019-10-14 23:13:38,223 INFO L226 Difference]: Without dead ends: 2282 [2019-10-14 23:13:38,226 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:38,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2019-10-14 23:13:38,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 2280. [2019-10-14 23:13:38,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2280 states. [2019-10-14 23:13:38,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 3526 transitions. [2019-10-14 23:13:38,292 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 3526 transitions. Word has length 27 [2019-10-14 23:13:38,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:38,292 INFO L462 AbstractCegarLoop]: Abstraction has 2280 states and 3526 transitions. [2019-10-14 23:13:38,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:38,292 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 3526 transitions. [2019-10-14 23:13:38,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-14 23:13:38,295 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:38,295 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:38,295 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:38,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:38,297 INFO L82 PathProgramCache]: Analyzing trace with hash -83685330, now seen corresponding path program 1 times [2019-10-14 23:13:38,297 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:38,297 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164120469] [2019-10-14 23:13:38,297 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:38,297 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:38,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:38,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:38,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:38,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:38,316 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164120469] [2019-10-14 23:13:38,317 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:38,317 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:38,317 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465577114] [2019-10-14 23:13:38,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:38,318 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:38,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:38,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:38,318 INFO L87 Difference]: Start difference. First operand 2280 states and 3526 transitions. Second operand 3 states. [2019-10-14 23:13:38,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:38,364 INFO L93 Difference]: Finished difference Result 3420 states and 5272 transitions. [2019-10-14 23:13:38,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:38,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-14 23:13:38,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:38,375 INFO L225 Difference]: With dead ends: 3420 [2019-10-14 23:13:38,375 INFO L226 Difference]: Without dead ends: 2314 [2019-10-14 23:13:38,378 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:38,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2019-10-14 23:13:38,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 2312. [2019-10-14 23:13:38,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2019-10-14 23:13:38,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 3526 transitions. [2019-10-14 23:13:38,448 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 3526 transitions. Word has length 28 [2019-10-14 23:13:38,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:38,448 INFO L462 AbstractCegarLoop]: Abstraction has 2312 states and 3526 transitions. [2019-10-14 23:13:38,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:38,448 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 3526 transitions. [2019-10-14 23:13:38,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-14 23:13:38,451 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:38,451 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:38,451 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:38,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:38,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1104753684, now seen corresponding path program 1 times [2019-10-14 23:13:38,452 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:38,452 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070704205] [2019-10-14 23:13:38,452 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:38,452 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:38,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:38,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:38,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:38,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:38,490 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070704205] [2019-10-14 23:13:38,491 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:38,491 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:38,491 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228958770] [2019-10-14 23:13:38,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:38,492 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:38,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:38,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:38,492 INFO L87 Difference]: Start difference. First operand 2312 states and 3526 transitions. Second operand 3 states. [2019-10-14 23:13:38,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:38,553 INFO L93 Difference]: Finished difference Result 4108 states and 6408 transitions. [2019-10-14 23:13:38,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:38,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-14 23:13:38,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:38,572 INFO L225 Difference]: With dead ends: 4108 [2019-10-14 23:13:38,572 INFO L226 Difference]: Without dead ends: 4106 [2019-10-14 23:13:38,574 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:38,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2019-10-14 23:13:38,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 3336. [2019-10-14 23:13:38,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3336 states. [2019-10-14 23:13:38,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4934 transitions. [2019-10-14 23:13:38,657 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4934 transitions. Word has length 28 [2019-10-14 23:13:38,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:38,657 INFO L462 AbstractCegarLoop]: Abstraction has 3336 states and 4934 transitions. [2019-10-14 23:13:38,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:38,658 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4934 transitions. [2019-10-14 23:13:38,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-14 23:13:38,662 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:38,662 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:38,663 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:38,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:38,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1910349934, now seen corresponding path program 1 times [2019-10-14 23:13:38,663 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:38,664 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561724415] [2019-10-14 23:13:38,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:38,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:38,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:38,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:38,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:38,683 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561724415] [2019-10-14 23:13:38,683 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:38,683 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:38,683 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275930824] [2019-10-14 23:13:38,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:38,684 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:38,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:38,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:38,685 INFO L87 Difference]: Start difference. First operand 3336 states and 4934 transitions. Second operand 3 states. [2019-10-14 23:13:38,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:38,752 INFO L93 Difference]: Finished difference Result 7756 states and 11528 transitions. [2019-10-14 23:13:38,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:38,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-14 23:13:38,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:38,772 INFO L225 Difference]: With dead ends: 7756 [2019-10-14 23:13:38,772 INFO L226 Difference]: Without dead ends: 4490 [2019-10-14 23:13:38,779 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:38,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2019-10-14 23:13:38,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 4488. [2019-10-14 23:13:38,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4488 states. [2019-10-14 23:13:38,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4488 states to 4488 states and 6598 transitions. [2019-10-14 23:13:38,898 INFO L78 Accepts]: Start accepts. Automaton has 4488 states and 6598 transitions. Word has length 28 [2019-10-14 23:13:38,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:38,899 INFO L462 AbstractCegarLoop]: Abstraction has 4488 states and 6598 transitions. [2019-10-14 23:13:38,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:38,899 INFO L276 IsEmpty]: Start isEmpty. Operand 4488 states and 6598 transitions. [2019-10-14 23:13:38,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-14 23:13:38,904 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:38,904 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:38,905 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:38,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:38,905 INFO L82 PathProgramCache]: Analyzing trace with hash 112588942, now seen corresponding path program 1 times [2019-10-14 23:13:38,905 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:38,905 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835186750] [2019-10-14 23:13:38,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:38,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:38,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:38,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:38,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:38,927 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835186750] [2019-10-14 23:13:38,927 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:38,927 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:38,927 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578042431] [2019-10-14 23:13:38,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:38,928 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:38,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:38,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:38,928 INFO L87 Difference]: Start difference. First operand 4488 states and 6598 transitions. Second operand 3 states. [2019-10-14 23:13:39,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:39,015 INFO L93 Difference]: Finished difference Result 6732 states and 9864 transitions. [2019-10-14 23:13:39,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:39,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-14 23:13:39,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:39,035 INFO L225 Difference]: With dead ends: 6732 [2019-10-14 23:13:39,035 INFO L226 Difference]: Without dead ends: 4554 [2019-10-14 23:13:39,040 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:39,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4554 states. [2019-10-14 23:13:39,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4554 to 4552. [2019-10-14 23:13:39,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4552 states. [2019-10-14 23:13:39,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4552 states to 4552 states and 6598 transitions. [2019-10-14 23:13:39,156 INFO L78 Accepts]: Start accepts. Automaton has 4552 states and 6598 transitions. Word has length 29 [2019-10-14 23:13:39,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:39,157 INFO L462 AbstractCegarLoop]: Abstraction has 4552 states and 6598 transitions. [2019-10-14 23:13:39,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:39,157 INFO L276 IsEmpty]: Start isEmpty. Operand 4552 states and 6598 transitions. [2019-10-14 23:13:39,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-14 23:13:39,162 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:39,162 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:39,162 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:39,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:39,163 INFO L82 PathProgramCache]: Analyzing trace with hash -908479412, now seen corresponding path program 1 times [2019-10-14 23:13:39,163 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:39,163 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174623243] [2019-10-14 23:13:39,163 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:39,163 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:39,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:39,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:39,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:39,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:39,188 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174623243] [2019-10-14 23:13:39,189 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:39,189 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:39,189 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072684879] [2019-10-14 23:13:39,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:39,190 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:39,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:39,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:39,190 INFO L87 Difference]: Start difference. First operand 4552 states and 6598 transitions. Second operand 3 states. [2019-10-14 23:13:39,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:39,326 INFO L93 Difference]: Finished difference Result 13260 states and 19016 transitions. [2019-10-14 23:13:39,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:39,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-14 23:13:39,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:39,348 INFO L225 Difference]: With dead ends: 13260 [2019-10-14 23:13:39,348 INFO L226 Difference]: Without dead ends: 8842 [2019-10-14 23:13:39,360 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:39,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8842 states. [2019-10-14 23:13:39,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8842 to 8840. [2019-10-14 23:13:39,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8840 states. [2019-10-14 23:13:39,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8840 states to 8840 states and 12422 transitions. [2019-10-14 23:13:39,690 INFO L78 Accepts]: Start accepts. Automaton has 8840 states and 12422 transitions. Word has length 29 [2019-10-14 23:13:39,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:39,690 INFO L462 AbstractCegarLoop]: Abstraction has 8840 states and 12422 transitions. [2019-10-14 23:13:39,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:39,690 INFO L276 IsEmpty]: Start isEmpty. Operand 8840 states and 12422 transitions. [2019-10-14 23:13:39,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-14 23:13:39,702 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:39,702 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:39,704 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:39,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:39,704 INFO L82 PathProgramCache]: Analyzing trace with hash 371384266, now seen corresponding path program 1 times [2019-10-14 23:13:39,704 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:39,704 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804476997] [2019-10-14 23:13:39,705 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:39,705 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:39,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:39,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:39,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:39,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:39,725 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804476997] [2019-10-14 23:13:39,726 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:39,726 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:39,726 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437091540] [2019-10-14 23:13:39,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:39,726 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:39,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:39,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:39,727 INFO L87 Difference]: Start difference. First operand 8840 states and 12422 transitions. Second operand 3 states. [2019-10-14 23:13:39,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:39,856 INFO L93 Difference]: Finished difference Result 10124 states and 14728 transitions. [2019-10-14 23:13:39,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:39,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-14 23:13:39,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:39,876 INFO L225 Difference]: With dead ends: 10124 [2019-10-14 23:13:39,876 INFO L226 Difference]: Without dead ends: 10122 [2019-10-14 23:13:39,881 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:39,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10122 states. [2019-10-14 23:13:40,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10122 to 8840. [2019-10-14 23:13:40,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8840 states. [2019-10-14 23:13:40,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8840 states to 8840 states and 12294 transitions. [2019-10-14 23:13:40,141 INFO L78 Accepts]: Start accepts. Automaton has 8840 states and 12294 transitions. Word has length 29 [2019-10-14 23:13:40,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:40,141 INFO L462 AbstractCegarLoop]: Abstraction has 8840 states and 12294 transitions. [2019-10-14 23:13:40,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:40,142 INFO L276 IsEmpty]: Start isEmpty. Operand 8840 states and 12294 transitions. [2019-10-14 23:13:40,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-14 23:13:40,154 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:40,154 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:40,155 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:40,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:40,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1902124419, now seen corresponding path program 1 times [2019-10-14 23:13:40,155 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:40,156 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421413145] [2019-10-14 23:13:40,156 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:40,156 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:40,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:40,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:40,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:40,184 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421413145] [2019-10-14 23:13:40,185 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:40,185 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:40,185 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450780549] [2019-10-14 23:13:40,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:40,186 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:40,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:40,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:40,187 INFO L87 Difference]: Start difference. First operand 8840 states and 12294 transitions. Second operand 3 states. [2019-10-14 23:13:40,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:40,496 INFO L93 Difference]: Finished difference Result 15244 states and 21640 transitions. [2019-10-14 23:13:40,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:40,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-14 23:13:40,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:40,525 INFO L225 Difference]: With dead ends: 15244 [2019-10-14 23:13:40,525 INFO L226 Difference]: Without dead ends: 15242 [2019-10-14 23:13:40,529 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:40,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15242 states. [2019-10-14 23:13:40,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15242 to 13192. [2019-10-14 23:13:40,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13192 states. [2019-10-14 23:13:40,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13192 states to 13192 states and 17798 transitions. [2019-10-14 23:13:40,835 INFO L78 Accepts]: Start accepts. Automaton has 13192 states and 17798 transitions. Word has length 30 [2019-10-14 23:13:40,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:40,836 INFO L462 AbstractCegarLoop]: Abstraction has 13192 states and 17798 transitions. [2019-10-14 23:13:40,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:40,836 INFO L276 IsEmpty]: Start isEmpty. Operand 13192 states and 17798 transitions. [2019-10-14 23:13:40,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-14 23:13:40,856 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:40,856 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:40,856 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:40,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:40,857 INFO L82 PathProgramCache]: Analyzing trace with hash 622260741, now seen corresponding path program 1 times [2019-10-14 23:13:40,857 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:40,857 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400644097] [2019-10-14 23:13:40,857 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:40,857 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:40,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:40,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:40,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:40,882 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400644097] [2019-10-14 23:13:40,882 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:40,883 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:40,883 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58244212] [2019-10-14 23:13:40,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:40,883 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:40,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:40,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:40,884 INFO L87 Difference]: Start difference. First operand 13192 states and 17798 transitions. Second operand 3 states. [2019-10-14 23:13:41,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:41,270 INFO L93 Difference]: Finished difference Result 30348 states and 41096 transitions. [2019-10-14 23:13:41,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:41,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-14 23:13:41,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:41,299 INFO L225 Difference]: With dead ends: 30348 [2019-10-14 23:13:41,299 INFO L226 Difference]: Without dead ends: 17290 [2019-10-14 23:13:41,322 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:41,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17290 states. [2019-10-14 23:13:41,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17290 to 17288. [2019-10-14 23:13:41,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17288 states. [2019-10-14 23:13:41,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17288 states to 17288 states and 23046 transitions. [2019-10-14 23:13:41,652 INFO L78 Accepts]: Start accepts. Automaton has 17288 states and 23046 transitions. Word has length 30 [2019-10-14 23:13:41,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:41,653 INFO L462 AbstractCegarLoop]: Abstraction has 17288 states and 23046 transitions. [2019-10-14 23:13:41,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:41,653 INFO L276 IsEmpty]: Start isEmpty. Operand 17288 states and 23046 transitions. [2019-10-14 23:13:41,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-14 23:13:41,671 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:41,672 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:41,672 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:41,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:41,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1163469695, now seen corresponding path program 1 times [2019-10-14 23:13:41,672 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:41,673 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320702134] [2019-10-14 23:13:41,673 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:41,673 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:41,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:41,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:41,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:41,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:41,694 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320702134] [2019-10-14 23:13:41,694 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:41,694 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:41,694 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940427822] [2019-10-14 23:13:41,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:41,695 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:41,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:41,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:41,695 INFO L87 Difference]: Start difference. First operand 17288 states and 23046 transitions. Second operand 3 states. [2019-10-14 23:13:42,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:42,294 INFO L93 Difference]: Finished difference Result 26124 states and 34824 transitions. [2019-10-14 23:13:42,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:42,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-14 23:13:42,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:42,323 INFO L225 Difference]: With dead ends: 26124 [2019-10-14 23:13:42,323 INFO L226 Difference]: Without dead ends: 17674 [2019-10-14 23:13:42,339 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:42,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17674 states. [2019-10-14 23:13:42,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17674 to 17672. [2019-10-14 23:13:42,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17672 states. [2019-10-14 23:13:42,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17672 states to 17672 states and 23302 transitions. [2019-10-14 23:13:42,659 INFO L78 Accepts]: Start accepts. Automaton has 17672 states and 23302 transitions. Word has length 31 [2019-10-14 23:13:42,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:42,659 INFO L462 AbstractCegarLoop]: Abstraction has 17672 states and 23302 transitions. [2019-10-14 23:13:42,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:42,659 INFO L276 IsEmpty]: Start isEmpty. Operand 17672 states and 23302 transitions. [2019-10-14 23:13:42,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-14 23:13:42,677 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:42,677 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:42,677 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:42,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:42,678 INFO L82 PathProgramCache]: Analyzing trace with hash 2110429247, now seen corresponding path program 1 times [2019-10-14 23:13:42,678 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:42,678 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877089224] [2019-10-14 23:13:42,678 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:42,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:42,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:42,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:42,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:42,698 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877089224] [2019-10-14 23:13:42,698 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:42,698 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:42,698 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466165898] [2019-10-14 23:13:42,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:42,699 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:42,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:42,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:42,699 INFO L87 Difference]: Start difference. First operand 17672 states and 23302 transitions. Second operand 3 states. [2019-10-14 23:13:43,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:43,108 INFO L93 Difference]: Finished difference Result 29708 states and 39688 transitions. [2019-10-14 23:13:43,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:43,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-14 23:13:43,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:43,157 INFO L225 Difference]: With dead ends: 29708 [2019-10-14 23:13:43,158 INFO L226 Difference]: Without dead ends: 29706 [2019-10-14 23:13:43,163 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:43,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29706 states. [2019-10-14 23:13:43,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29706 to 26632. [2019-10-14 23:13:43,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26632 states. [2019-10-14 23:13:43,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26632 states to 26632 states and 34054 transitions. [2019-10-14 23:13:43,644 INFO L78 Accepts]: Start accepts. Automaton has 26632 states and 34054 transitions. Word has length 31 [2019-10-14 23:13:43,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:43,644 INFO L462 AbstractCegarLoop]: Abstraction has 26632 states and 34054 transitions. [2019-10-14 23:13:43,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:43,644 INFO L276 IsEmpty]: Start isEmpty. Operand 26632 states and 34054 transitions. [2019-10-14 23:13:43,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-14 23:13:43,679 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:43,680 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:43,680 INFO L410 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:43,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:43,680 INFO L82 PathProgramCache]: Analyzing trace with hash 830565569, now seen corresponding path program 1 times [2019-10-14 23:13:43,680 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:43,681 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069887094] [2019-10-14 23:13:43,681 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:43,681 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:43,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:43,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:43,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:43,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:43,852 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069887094] [2019-10-14 23:13:43,853 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:43,853 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:43,853 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044492625] [2019-10-14 23:13:43,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:43,854 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:43,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:43,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:43,854 INFO L87 Difference]: Start difference. First operand 26632 states and 34054 transitions. Second operand 3 states. [2019-10-14 23:13:44,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:44,299 INFO L93 Difference]: Finished difference Result 60428 states and 77064 transitions. [2019-10-14 23:13:44,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:44,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-14 23:13:44,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:44,371 INFO L225 Difference]: With dead ends: 60428 [2019-10-14 23:13:44,371 INFO L226 Difference]: Without dead ends: 34314 [2019-10-14 23:13:44,418 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:44,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34314 states. [2019-10-14 23:13:45,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34314 to 34312. [2019-10-14 23:13:45,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34312 states. [2019-10-14 23:13:45,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34312 states to 34312 states and 43014 transitions. [2019-10-14 23:13:45,309 INFO L78 Accepts]: Start accepts. Automaton has 34312 states and 43014 transitions. Word has length 31 [2019-10-14 23:13:45,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:45,310 INFO L462 AbstractCegarLoop]: Abstraction has 34312 states and 43014 transitions. [2019-10-14 23:13:45,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:45,310 INFO L276 IsEmpty]: Start isEmpty. Operand 34312 states and 43014 transitions. [2019-10-14 23:13:45,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-14 23:13:45,354 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:45,354 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:45,354 INFO L410 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:45,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:45,355 INFO L82 PathProgramCache]: Analyzing trace with hash 999013018, now seen corresponding path program 1 times [2019-10-14 23:13:45,355 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:45,355 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953654000] [2019-10-14 23:13:45,356 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:45,356 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:45,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:45,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:45,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:45,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:45,394 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953654000] [2019-10-14 23:13:45,395 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:45,395 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:45,395 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141174744] [2019-10-14 23:13:45,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:45,396 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:45,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:45,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:45,397 INFO L87 Difference]: Start difference. First operand 34312 states and 43014 transitions. Second operand 3 states. [2019-10-14 23:13:45,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:45,821 INFO L93 Difference]: Finished difference Result 51468 states and 64264 transitions. [2019-10-14 23:13:45,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:45,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-14 23:13:45,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:45,907 INFO L225 Difference]: With dead ends: 51468 [2019-10-14 23:13:45,907 INFO L226 Difference]: Without dead ends: 34826 [2019-10-14 23:13:45,937 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:45,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34826 states. [2019-10-14 23:13:47,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34826 to 34824. [2019-10-14 23:13:47,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34824 states. [2019-10-14 23:13:47,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34824 states to 34824 states and 43014 transitions. [2019-10-14 23:13:47,397 INFO L78 Accepts]: Start accepts. Automaton has 34824 states and 43014 transitions. Word has length 32 [2019-10-14 23:13:47,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:47,397 INFO L462 AbstractCegarLoop]: Abstraction has 34824 states and 43014 transitions. [2019-10-14 23:13:47,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:47,397 INFO L276 IsEmpty]: Start isEmpty. Operand 34824 states and 43014 transitions. [2019-10-14 23:13:47,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-14 23:13:47,440 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:47,441 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:47,441 INFO L410 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:47,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:47,442 INFO L82 PathProgramCache]: Analyzing trace with hash -22055336, now seen corresponding path program 1 times [2019-10-14 23:13:47,442 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:47,443 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27832454] [2019-10-14 23:13:47,443 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:47,443 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:47,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:47,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:47,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:47,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:47,473 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27832454] [2019-10-14 23:13:47,473 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:47,474 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:47,474 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189567446] [2019-10-14 23:13:47,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:47,475 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:47,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:47,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:47,476 INFO L87 Difference]: Start difference. First operand 34824 states and 43014 transitions. Second operand 3 states. [2019-10-14 23:13:48,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:48,047 INFO L93 Difference]: Finished difference Result 57356 states and 71176 transitions. [2019-10-14 23:13:48,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:48,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-14 23:13:48,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:48,111 INFO L225 Difference]: With dead ends: 57356 [2019-10-14 23:13:48,112 INFO L226 Difference]: Without dead ends: 57354 [2019-10-14 23:13:48,130 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:48,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57354 states. [2019-10-14 23:13:49,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57354 to 53256. [2019-10-14 23:13:49,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53256 states. [2019-10-14 23:13:49,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53256 states to 53256 states and 64006 transitions. [2019-10-14 23:13:49,147 INFO L78 Accepts]: Start accepts. Automaton has 53256 states and 64006 transitions. Word has length 32 [2019-10-14 23:13:49,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:49,148 INFO L462 AbstractCegarLoop]: Abstraction has 53256 states and 64006 transitions. [2019-10-14 23:13:49,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:49,148 INFO L276 IsEmpty]: Start isEmpty. Operand 53256 states and 64006 transitions. [2019-10-14 23:13:49,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-14 23:13:49,192 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:49,192 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:49,192 INFO L410 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:49,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:49,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1301919014, now seen corresponding path program 1 times [2019-10-14 23:13:49,193 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:49,193 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493571894] [2019-10-14 23:13:49,193 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:49,193 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:49,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:49,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:49,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:49,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:49,211 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493571894] [2019-10-14 23:13:49,211 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:49,212 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:49,212 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355235108] [2019-10-14 23:13:49,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:49,213 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:49,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:49,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:49,214 INFO L87 Difference]: Start difference. First operand 53256 states and 64006 transitions. Second operand 3 states. [2019-10-14 23:13:50,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:50,199 INFO L93 Difference]: Finished difference Result 119820 states and 142856 transitions. [2019-10-14 23:13:50,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:50,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-14 23:13:50,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:50,280 INFO L225 Difference]: With dead ends: 119820 [2019-10-14 23:13:50,280 INFO L226 Difference]: Without dead ends: 67594 [2019-10-14 23:13:50,323 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:50,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67594 states. [2019-10-14 23:13:51,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67594 to 67592. [2019-10-14 23:13:51,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67592 states. [2019-10-14 23:13:51,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67592 states to 67592 states and 78854 transitions. [2019-10-14 23:13:51,191 INFO L78 Accepts]: Start accepts. Automaton has 67592 states and 78854 transitions. Word has length 32 [2019-10-14 23:13:51,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:51,191 INFO L462 AbstractCegarLoop]: Abstraction has 67592 states and 78854 transitions. [2019-10-14 23:13:51,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:51,191 INFO L276 IsEmpty]: Start isEmpty. Operand 67592 states and 78854 transitions. [2019-10-14 23:13:51,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-14 23:13:51,252 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:51,252 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:51,253 INFO L410 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:51,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:51,253 INFO L82 PathProgramCache]: Analyzing trace with hash -683499274, now seen corresponding path program 1 times [2019-10-14 23:13:51,254 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:51,254 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701086998] [2019-10-14 23:13:51,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:51,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:51,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:51,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:51,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:51,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:51,280 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701086998] [2019-10-14 23:13:51,280 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:51,280 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:51,280 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427263905] [2019-10-14 23:13:51,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:51,281 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:51,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:51,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:51,282 INFO L87 Difference]: Start difference. First operand 67592 states and 78854 transitions. Second operand 3 states. [2019-10-14 23:13:51,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:51,929 INFO L93 Difference]: Finished difference Result 101388 states and 117768 transitions. [2019-10-14 23:13:51,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:51,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-14 23:13:51,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:51,987 INFO L225 Difference]: With dead ends: 101388 [2019-10-14 23:13:51,987 INFO L226 Difference]: Without dead ends: 68618 [2019-10-14 23:13:52,021 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:52,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68618 states. [2019-10-14 23:13:54,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68618 to 68616. [2019-10-14 23:13:54,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68616 states. [2019-10-14 23:13:54,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68616 states to 68616 states and 78854 transitions. [2019-10-14 23:13:54,407 INFO L78 Accepts]: Start accepts. Automaton has 68616 states and 78854 transitions. Word has length 33 [2019-10-14 23:13:54,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:54,408 INFO L462 AbstractCegarLoop]: Abstraction has 68616 states and 78854 transitions. [2019-10-14 23:13:54,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:54,408 INFO L276 IsEmpty]: Start isEmpty. Operand 68616 states and 78854 transitions. [2019-10-14 23:13:54,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-14 23:13:54,441 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:54,441 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:54,441 INFO L410 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:54,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:54,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1704567628, now seen corresponding path program 1 times [2019-10-14 23:13:54,442 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:54,442 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728648570] [2019-10-14 23:13:54,442 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:54,442 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:54,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:54,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:54,470 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728648570] [2019-10-14 23:13:54,470 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:54,470 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:54,470 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126595883] [2019-10-14 23:13:54,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:54,471 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:54,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:54,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:54,472 INFO L87 Difference]: Start difference. First operand 68616 states and 78854 transitions. Second operand 3 states. [2019-10-14 23:13:55,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:55,147 INFO L93 Difference]: Finished difference Result 110602 states and 125959 transitions. [2019-10-14 23:13:55,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:55,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-14 23:13:55,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:55,261 INFO L225 Difference]: With dead ends: 110602 [2019-10-14 23:13:55,261 INFO L226 Difference]: Without dead ends: 110600 [2019-10-14 23:13:55,283 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:55,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110600 states. [2019-10-14 23:13:56,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110600 to 106504. [2019-10-14 23:13:56,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106504 states. [2019-10-14 23:13:56,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106504 states to 106504 states and 119814 transitions. [2019-10-14 23:13:56,776 INFO L78 Accepts]: Start accepts. Automaton has 106504 states and 119814 transitions. Word has length 33 [2019-10-14 23:13:56,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:56,777 INFO L462 AbstractCegarLoop]: Abstraction has 106504 states and 119814 transitions. [2019-10-14 23:13:56,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:56,777 INFO L276 IsEmpty]: Start isEmpty. Operand 106504 states and 119814 transitions. [2019-10-14 23:13:56,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-14 23:13:56,854 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:56,854 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:56,855 INFO L410 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:56,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:56,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1310535990, now seen corresponding path program 1 times [2019-10-14 23:13:56,855 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:56,855 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28292423] [2019-10-14 23:13:56,855 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:56,855 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:56,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:56,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:56,874 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28292423] [2019-10-14 23:13:56,874 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:56,875 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:56,875 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817996647] [2019-10-14 23:13:56,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:56,875 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:56,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:56,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:56,876 INFO L87 Difference]: Start difference. First operand 106504 states and 119814 transitions. Second operand 3 states. [2019-10-14 23:13:58,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:58,519 INFO L93 Difference]: Finished difference Result 237576 states and 263174 transitions. [2019-10-14 23:13:58,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:58,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-14 23:13:58,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:58,520 INFO L225 Difference]: With dead ends: 237576 [2019-10-14 23:13:58,520 INFO L226 Difference]: Without dead ends: 0 [2019-10-14 23:13:58,662 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:58,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-14 23:13:58,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-14 23:13:58,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-14 23:13:58,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-14 23:13:58,664 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2019-10-14 23:13:58,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:58,664 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-14 23:13:58,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:58,664 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-14 23:13:58,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-14 23:13:58,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-14 23:13:58,708 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-14 23:13:58,708 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:13:58,708 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:13:58,708 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-14 23:13:58,709 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-14 23:13:58,709 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-14 23:13:58,709 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 45 186) no Hoare annotation was computed. [2019-10-14 23:13:58,709 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 191) no Hoare annotation was computed. [2019-10-14 23:13:58,709 INFO L443 ceAbstractionStarter]: For program point L151-1(lines 45 186) no Hoare annotation was computed. [2019-10-14 23:13:58,709 INFO L443 ceAbstractionStarter]: For program point L176-1(lines 45 186) no Hoare annotation was computed. [2019-10-14 23:13:58,709 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-10-14 23:13:58,709 INFO L443 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-10-14 23:13:58,709 INFO L443 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-10-14 23:13:58,710 INFO L443 ceAbstractionStarter]: For program point L136-1(lines 45 186) no Hoare annotation was computed. [2019-10-14 23:13:58,710 INFO L443 ceAbstractionStarter]: For program point L161-1(lines 45 186) no Hoare annotation was computed. [2019-10-14 23:13:58,710 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 45 186) no Hoare annotation was computed. [2019-10-14 23:13:58,710 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2019-10-14 23:13:58,710 INFO L443 ceAbstractionStarter]: For program point L112-1(lines 45 186) no Hoare annotation was computed. [2019-10-14 23:13:58,710 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 191) no Hoare annotation was computed. [2019-10-14 23:13:58,710 INFO L443 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2019-10-14 23:13:58,710 INFO L443 ceAbstractionStarter]: For program point L104-1(lines 45 186) no Hoare annotation was computed. [2019-10-14 23:13:58,711 INFO L443 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-10-14 23:13:58,711 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 45 186) no Hoare annotation was computed. [2019-10-14 23:13:58,711 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 191) the Hoare annotation is: true [2019-10-14 23:13:58,711 INFO L446 ceAbstractionStarter]: At program point L187(lines 5 191) the Hoare annotation is: true [2019-10-14 23:13:58,711 INFO L443 ceAbstractionStarter]: For program point L88-1(lines 45 186) no Hoare annotation was computed. [2019-10-14 23:13:58,711 INFO L443 ceAbstractionStarter]: For program point L146-1(lines 45 186) no Hoare annotation was computed. [2019-10-14 23:13:58,711 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 49) no Hoare annotation was computed. [2019-10-14 23:13:58,711 INFO L443 ceAbstractionStarter]: For program point L80-1(lines 45 186) no Hoare annotation was computed. [2019-10-14 23:13:58,712 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 45 186) no Hoare annotation was computed. [2019-10-14 23:13:58,712 INFO L443 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-10-14 23:13:58,712 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-10-14 23:13:58,712 INFO L443 ceAbstractionStarter]: For program point L131-1(lines 45 186) no Hoare annotation was computed. [2019-10-14 23:13:58,712 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 45 186) no Hoare annotation was computed. [2019-10-14 23:13:58,712 INFO L446 ceAbstractionStarter]: At program point L181-1(lines 45 186) the Hoare annotation is: true [2019-10-14 23:13:58,712 INFO L443 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-10-14 23:13:58,712 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-10-14 23:13:58,712 INFO L443 ceAbstractionStarter]: For program point L182(line 182) no Hoare annotation was computed. [2019-10-14 23:13:58,713 INFO L439 ceAbstractionStarter]: At program point L182-1(lines 5 191) the Hoare annotation is: false [2019-10-14 23:13:58,713 INFO L443 ceAbstractionStarter]: For program point L116-1(lines 45 186) no Hoare annotation was computed. [2019-10-14 23:13:58,713 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 45 186) no Hoare annotation was computed. [2019-10-14 23:13:58,713 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 45 186) no Hoare annotation was computed. [2019-10-14 23:13:58,713 INFO L443 ceAbstractionStarter]: For program point L166-1(lines 45 186) no Hoare annotation was computed. [2019-10-14 23:13:58,713 INFO L443 ceAbstractionStarter]: For program point L100-1(lines 45 186) no Hoare annotation was computed. [2019-10-14 23:13:58,713 INFO L443 ceAbstractionStarter]: For program point L92-1(lines 45 186) no Hoare annotation was computed. [2019-10-14 23:13:58,713 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 45 186) no Hoare annotation was computed. [2019-10-14 23:13:58,713 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-10-14 23:13:58,713 INFO L443 ceAbstractionStarter]: For program point L76(lines 76 78) no Hoare annotation was computed. [2019-10-14 23:13:58,714 INFO L443 ceAbstractionStarter]: For program point L76-2(lines 45 186) no Hoare annotation was computed. [2019-10-14 23:13:58,714 INFO L443 ceAbstractionStarter]: For program point L167(line 167) no Hoare annotation was computed. [2019-10-14 23:13:58,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:13:58 BoogieIcfgContainer [2019-10-14 23:13:58,723 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-14 23:13:58,725 INFO L168 Benchmark]: Toolchain (without parser) took 23787.39 ms. Allocated memory was 137.4 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 101.8 MB in the beginning and 726.0 MB in the end (delta: -624.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-10-14 23:13:58,726 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 137.4 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-10-14 23:13:58,727 INFO L168 Benchmark]: CACSL2BoogieTranslator took 470.82 ms. Allocated memory was 137.4 MB in the beginning and 200.8 MB in the end (delta: 63.4 MB). Free memory was 101.6 MB in the beginning and 179.7 MB in the end (delta: -78.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. [2019-10-14 23:13:58,727 INFO L168 Benchmark]: Boogie Preprocessor took 40.61 ms. Allocated memory is still 200.8 MB. Free memory was 179.7 MB in the beginning and 177.3 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-10-14 23:13:58,728 INFO L168 Benchmark]: RCFGBuilder took 428.75 ms. Allocated memory is still 200.8 MB. Free memory was 177.3 MB in the beginning and 156.8 MB in the end (delta: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2019-10-14 23:13:58,728 INFO L168 Benchmark]: TraceAbstraction took 22841.03 ms. Allocated memory was 200.8 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 156.1 MB in the beginning and 726.0 MB in the end (delta: -569.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-10-14 23:13:58,733 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.22 ms. Allocated memory is still 137.4 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 470.82 ms. Allocated memory was 137.4 MB in the beginning and 200.8 MB in the end (delta: 63.4 MB). Free memory was 101.6 MB in the beginning and 179.7 MB in the end (delta: -78.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.61 ms. Allocated memory is still 200.8 MB. Free memory was 179.7 MB in the beginning and 177.3 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 428.75 ms. Allocated memory is still 200.8 MB. Free memory was 177.3 MB in the beginning and 156.8 MB in the end (delta: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 22841.03 ms. Allocated memory was 200.8 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 156.1 MB in the beginning and 726.0 MB in the end (delta: -569.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 189]: 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: 1 - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 50 locations, 1 error locations. Result: SAFE, OverallTime: 22.7s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3416 SDtfs, 1682 SDslu, 2343 SDs, 0 SdLazy, 181 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 170 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106504occurred in iteration=33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.9s AutomataMinimizationTime, 34 MinimizatonAttempts, 16420 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 4106 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 938 NumberOfCodeBlocks, 938 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 904 ConstructedInterpolants, 0 QuantifiedInterpolants, 49976 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...