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-f4eb214f-m [2019-10-13 19:14:32,783 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:14:32,785 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:14:32,803 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:14:32,803 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:14:32,805 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:14:32,807 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:14:32,819 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:14:32,822 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:14:32,824 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:14:32,825 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:14:32,826 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:14:32,826 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:14:32,827 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:14:32,828 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:14:32,829 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:14:32,830 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:14:32,831 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:14:32,832 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:14:32,834 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:14:32,836 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:14:32,836 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:14:32,837 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:14:32,838 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:14:32,840 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:14:32,841 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:14:32,841 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:14:32,842 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:14:32,842 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:14:32,843 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:14:32,843 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:14:32,844 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:14:32,845 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:14:32,845 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:14:32,846 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:14:32,847 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:14:32,847 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:14:32,847 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:14:32,848 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:14:32,849 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:14:32,849 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:14:32,850 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 19:14:32,863 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:14:32,864 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:14:32,865 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:14:32,865 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:14:32,865 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:14:32,866 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:14:32,866 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:14:32,866 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:14:32,866 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:14:32,866 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:14:32,866 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:14:32,867 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:14:32,867 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:14:32,867 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:14:32,867 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:14:32,867 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:14:32,868 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:14:32,868 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:14:32,868 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:14:32,868 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:14:32,868 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:14:32,869 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:14:32,869 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:14:32,869 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:14:32,869 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:14:32,869 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:14:32,870 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:14:32,870 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:14:32,870 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:14:33,146 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:14:33,159 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:14:33,163 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:14:33,164 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:14:33,164 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:14:33,165 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-13 19:14:33,225 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5b6effb1/a95634a42c0b4760b67730391993a0fa/FLAG27232c10c [2019-10-13 19:14:33,644 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:14:33,645 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_12.c [2019-10-13 19:14:33,653 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5b6effb1/a95634a42c0b4760b67730391993a0fa/FLAG27232c10c [2019-10-13 19:14:34,056 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5b6effb1/a95634a42c0b4760b67730391993a0fa [2019-10-13 19:14:34,066 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:14:34,067 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:14:34,068 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:14:34,069 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:14:34,072 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:14:34,073 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:14:34" (1/1) ... [2019-10-13 19:14:34,075 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77a1e17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:34, skipping insertion in model container [2019-10-13 19:14:34,076 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:14:34" (1/1) ... [2019-10-13 19:14:34,083 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:14:34,106 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:14:34,324 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:14:34,329 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:14:34,355 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:14:34,368 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:14:34,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:34 WrapperNode [2019-10-13 19:14:34,368 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:14:34,369 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:14:34,369 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:14:34,369 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:14:34,473 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:34" (1/1) ... [2019-10-13 19:14:34,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:34" (1/1) ... [2019-10-13 19:14:34,478 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:34" (1/1) ... [2019-10-13 19:14:34,479 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:34" (1/1) ... [2019-10-13 19:14:34,485 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:34" (1/1) ... [2019-10-13 19:14:34,497 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:34" (1/1) ... [2019-10-13 19:14:34,499 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:34" (1/1) ... [2019-10-13 19:14:34,503 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:14:34,503 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:14:34,504 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:14:34,504 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:14:34,505 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:14:34,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:14:34,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:14:34,558 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:14:34,558 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:14:34,558 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 19:14:34,559 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:14:34,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:14:34,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:14:34,909 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:14:34,910 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 19:14:34,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:14:34 BoogieIcfgContainer [2019-10-13 19:14:34,911 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:14:34,912 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:14:34,913 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:14:34,916 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:14:34,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:14:34" (1/3) ... [2019-10-13 19:14:34,918 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f59775 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:14:34, skipping insertion in model container [2019-10-13 19:14:34,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:34" (2/3) ... [2019-10-13 19:14:34,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f59775 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:14:34, skipping insertion in model container [2019-10-13 19:14:34,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:14:34" (3/3) ... [2019-10-13 19:14:34,922 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_12.c [2019-10-13 19:14:34,932 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:14:34,943 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 19:14:34,952 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 19:14:34,976 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:14:34,976 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:14:34,976 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:14:34,977 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:14:34,977 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:14:34,977 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:14:34,977 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:14:34,977 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:14:34,994 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2019-10-13 19:14:34,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 19:14:34,999 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:35,000 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:35,002 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:35,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:35,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1339057171, now seen corresponding path program 1 times [2019-10-13 19:14:35,014 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:35,014 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054815820] [2019-10-13 19:14:35,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:35,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:35,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:35,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:35,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:35,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:35,226 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054815820] [2019-10-13 19:14:35,227 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:35,227 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:35,228 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12585177] [2019-10-13 19:14:35,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:35,232 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:35,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:35,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:35,248 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2019-10-13 19:14:35,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:35,322 INFO L93 Difference]: Finished difference Result 99 states and 174 transitions. [2019-10-13 19:14:35,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:35,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-13 19:14:35,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:35,338 INFO L225 Difference]: With dead ends: 99 [2019-10-13 19:14:35,338 INFO L226 Difference]: Without dead ends: 84 [2019-10-13 19:14:35,341 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:35,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-10-13 19:14:35,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 58. [2019-10-13 19:14:35,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-13 19:14:35,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 105 transitions. [2019-10-13 19:14:35,384 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 105 transitions. Word has length 22 [2019-10-13 19:14:35,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:35,385 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 105 transitions. [2019-10-13 19:14:35,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:35,385 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 105 transitions. [2019-10-13 19:14:35,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 19:14:35,386 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:35,387 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:35,387 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:35,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:35,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1676046447, now seen corresponding path program 1 times [2019-10-13 19:14:35,388 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:35,388 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991137694] [2019-10-13 19:14:35,388 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:35,389 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:35,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:35,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:35,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:35,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:35,458 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991137694] [2019-10-13 19:14:35,458 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:35,459 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:35,459 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254442454] [2019-10-13 19:14:35,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:35,461 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:35,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:35,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:35,462 INFO L87 Difference]: Start difference. First operand 58 states and 105 transitions. Second operand 3 states. [2019-10-13 19:14:35,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:35,510 INFO L93 Difference]: Finished difference Result 137 states and 252 transitions. [2019-10-13 19:14:35,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:35,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-13 19:14:35,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:35,516 INFO L225 Difference]: With dead ends: 137 [2019-10-13 19:14:35,516 INFO L226 Difference]: Without dead ends: 84 [2019-10-13 19:14:35,517 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:35,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-10-13 19:14:35,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2019-10-13 19:14:35,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-10-13 19:14:35,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 149 transitions. [2019-10-13 19:14:35,530 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 149 transitions. Word has length 22 [2019-10-13 19:14:35,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:35,531 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 149 transitions. [2019-10-13 19:14:35,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:35,531 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 149 transitions. [2019-10-13 19:14:35,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 19:14:35,532 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:35,532 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:35,533 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:35,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:35,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1439113391, now seen corresponding path program 1 times [2019-10-13 19:14:35,534 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:35,534 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775532200] [2019-10-13 19:14:35,534 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:35,534 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:35,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:35,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:35,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:35,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:35,596 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775532200] [2019-10-13 19:14:35,597 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:35,597 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:35,597 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340345992] [2019-10-13 19:14:35,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:35,598 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:35,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:35,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:35,599 INFO L87 Difference]: Start difference. First operand 82 states and 149 transitions. Second operand 3 states. [2019-10-13 19:14:35,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:35,630 INFO L93 Difference]: Finished difference Result 126 states and 225 transitions. [2019-10-13 19:14:35,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:35,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-13 19:14:35,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:35,632 INFO L225 Difference]: With dead ends: 126 [2019-10-13 19:14:35,632 INFO L226 Difference]: Without dead ends: 87 [2019-10-13 19:14:35,633 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:35,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-10-13 19:14:35,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2019-10-13 19:14:35,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-13 19:14:35,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 151 transitions. [2019-10-13 19:14:35,652 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 151 transitions. Word has length 23 [2019-10-13 19:14:35,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:35,653 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 151 transitions. [2019-10-13 19:14:35,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:35,654 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 151 transitions. [2019-10-13 19:14:35,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 19:14:35,655 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:35,655 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:35,655 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:35,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:35,656 INFO L82 PathProgramCache]: Analyzing trace with hash 418045037, now seen corresponding path program 1 times [2019-10-13 19:14:35,656 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:35,657 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995221090] [2019-10-13 19:14:35,657 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:35,657 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:35,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:35,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:35,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:35,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:35,724 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995221090] [2019-10-13 19:14:35,724 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:35,724 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:35,725 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794734279] [2019-10-13 19:14:35,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:35,725 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:35,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:35,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:35,726 INFO L87 Difference]: Start difference. First operand 85 states and 151 transitions. Second operand 3 states. [2019-10-13 19:14:35,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:35,759 INFO L93 Difference]: Finished difference Result 160 states and 288 transitions. [2019-10-13 19:14:35,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:35,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-13 19:14:35,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:35,761 INFO L225 Difference]: With dead ends: 160 [2019-10-13 19:14:35,761 INFO L226 Difference]: Without dead ends: 158 [2019-10-13 19:14:35,762 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:35,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-10-13 19:14:35,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 112. [2019-10-13 19:14:35,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-10-13 19:14:35,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 200 transitions. [2019-10-13 19:14:35,774 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 200 transitions. Word has length 23 [2019-10-13 19:14:35,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:35,775 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 200 transitions. [2019-10-13 19:14:35,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:35,775 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 200 transitions. [2019-10-13 19:14:35,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 19:14:35,776 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:35,776 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:35,777 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:35,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:35,777 INFO L82 PathProgramCache]: Analyzing trace with hash -861818641, now seen corresponding path program 1 times [2019-10-13 19:14:35,777 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:35,778 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173275215] [2019-10-13 19:14:35,778 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:35,778 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:35,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:35,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:35,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:35,825 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173275215] [2019-10-13 19:14:35,825 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:35,825 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:35,825 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759366151] [2019-10-13 19:14:35,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:35,826 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:35,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:35,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:35,827 INFO L87 Difference]: Start difference. First operand 112 states and 200 transitions. Second operand 3 states. [2019-10-13 19:14:35,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:35,860 INFO L93 Difference]: Finished difference Result 264 states and 478 transitions. [2019-10-13 19:14:35,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:35,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-13 19:14:35,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:35,863 INFO L225 Difference]: With dead ends: 264 [2019-10-13 19:14:35,863 INFO L226 Difference]: Without dead ends: 160 [2019-10-13 19:14:35,864 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:35,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-10-13 19:14:35,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2019-10-13 19:14:35,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-10-13 19:14:35,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 282 transitions. [2019-10-13 19:14:35,892 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 282 transitions. Word has length 23 [2019-10-13 19:14:35,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:35,897 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 282 transitions. [2019-10-13 19:14:35,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:35,897 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 282 transitions. [2019-10-13 19:14:35,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 19:14:35,898 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:35,899 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:35,899 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:35,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:35,899 INFO L82 PathProgramCache]: Analyzing trace with hash 74707332, now seen corresponding path program 1 times [2019-10-13 19:14:35,900 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:35,900 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192335955] [2019-10-13 19:14:35,902 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:35,902 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:35,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:35,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:35,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:35,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:35,953 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192335955] [2019-10-13 19:14:35,953 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:35,954 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:35,954 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240563413] [2019-10-13 19:14:35,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:35,955 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:35,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:35,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:35,956 INFO L87 Difference]: Start difference. First operand 158 states and 282 transitions. Second operand 3 states. [2019-10-13 19:14:35,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:35,978 INFO L93 Difference]: Finished difference Result 237 states and 421 transitions. [2019-10-13 19:14:35,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:35,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-13 19:14:35,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:35,981 INFO L225 Difference]: With dead ends: 237 [2019-10-13 19:14:35,981 INFO L226 Difference]: Without dead ends: 162 [2019-10-13 19:14:35,982 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:35,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-10-13 19:14:35,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2019-10-13 19:14:35,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-10-13 19:14:35,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 282 transitions. [2019-10-13 19:14:35,993 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 282 transitions. Word has length 24 [2019-10-13 19:14:35,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:35,993 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 282 transitions. [2019-10-13 19:14:35,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:35,994 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 282 transitions. [2019-10-13 19:14:35,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 19:14:35,995 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:35,995 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:35,996 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:36,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:36,008 INFO L82 PathProgramCache]: Analyzing trace with hash -946361022, now seen corresponding path program 1 times [2019-10-13 19:14:36,008 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:36,009 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645455886] [2019-10-13 19:14:36,009 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:36,009 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:36,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:36,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:36,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:36,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:36,051 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645455886] [2019-10-13 19:14:36,051 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:36,051 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:36,051 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987526282] [2019-10-13 19:14:36,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:36,052 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:36,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:36,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:36,053 INFO L87 Difference]: Start difference. First operand 160 states and 282 transitions. Second operand 3 states. [2019-10-13 19:14:36,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:36,078 INFO L93 Difference]: Finished difference Result 300 states and 536 transitions. [2019-10-13 19:14:36,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:36,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-13 19:14:36,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:36,081 INFO L225 Difference]: With dead ends: 300 [2019-10-13 19:14:36,081 INFO L226 Difference]: Without dead ends: 298 [2019-10-13 19:14:36,082 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:36,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-10-13 19:14:36,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 216. [2019-10-13 19:14:36,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-10-13 19:14:36,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 378 transitions. [2019-10-13 19:14:36,092 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 378 transitions. Word has length 24 [2019-10-13 19:14:36,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:36,092 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 378 transitions. [2019-10-13 19:14:36,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:36,093 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 378 transitions. [2019-10-13 19:14:36,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 19:14:36,094 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:36,094 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:36,095 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:36,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:36,095 INFO L82 PathProgramCache]: Analyzing trace with hash 2068742596, now seen corresponding path program 1 times [2019-10-13 19:14:36,095 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:36,096 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469305817] [2019-10-13 19:14:36,096 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:36,096 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:36,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:36,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:36,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:36,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:36,132 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469305817] [2019-10-13 19:14:36,133 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:36,133 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:36,133 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511981275] [2019-10-13 19:14:36,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:36,134 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:36,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:36,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:36,134 INFO L87 Difference]: Start difference. First operand 216 states and 378 transitions. Second operand 3 states. [2019-10-13 19:14:36,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:36,175 INFO L93 Difference]: Finished difference Result 512 states and 904 transitions. [2019-10-13 19:14:36,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:36,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-13 19:14:36,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:36,177 INFO L225 Difference]: With dead ends: 512 [2019-10-13 19:14:36,178 INFO L226 Difference]: Without dead ends: 306 [2019-10-13 19:14:36,179 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:36,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-10-13 19:14:36,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2019-10-13 19:14:36,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-10-13 19:14:36,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 530 transitions. [2019-10-13 19:14:36,200 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 530 transitions. Word has length 24 [2019-10-13 19:14:36,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:36,200 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 530 transitions. [2019-10-13 19:14:36,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:36,200 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 530 transitions. [2019-10-13 19:14:36,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 19:14:36,203 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:36,203 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:36,204 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:36,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:36,204 INFO L82 PathProgramCache]: Analyzing trace with hash 727792804, now seen corresponding path program 1 times [2019-10-13 19:14:36,204 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:36,204 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553101338] [2019-10-13 19:14:36,205 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:36,205 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:36,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:36,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:36,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:36,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:36,241 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553101338] [2019-10-13 19:14:36,241 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:36,241 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:36,241 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296819888] [2019-10-13 19:14:36,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:36,242 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:36,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:36,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:36,243 INFO L87 Difference]: Start difference. First operand 304 states and 530 transitions. Second operand 3 states. [2019-10-13 19:14:36,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:36,268 INFO L93 Difference]: Finished difference Result 456 states and 792 transitions. [2019-10-13 19:14:36,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:36,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-13 19:14:36,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:36,271 INFO L225 Difference]: With dead ends: 456 [2019-10-13 19:14:36,271 INFO L226 Difference]: Without dead ends: 310 [2019-10-13 19:14:36,272 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:36,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-10-13 19:14:36,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308. [2019-10-13 19:14:36,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-10-13 19:14:36,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 530 transitions. [2019-10-13 19:14:36,283 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 530 transitions. Word has length 25 [2019-10-13 19:14:36,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:36,283 INFO L462 AbstractCegarLoop]: Abstraction has 308 states and 530 transitions. [2019-10-13 19:14:36,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:36,283 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 530 transitions. [2019-10-13 19:14:36,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 19:14:36,285 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:36,285 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:36,285 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:36,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:36,285 INFO L82 PathProgramCache]: Analyzing trace with hash -293275550, now seen corresponding path program 1 times [2019-10-13 19:14:36,286 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:36,286 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620732604] [2019-10-13 19:14:36,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:36,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:36,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:36,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:36,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:36,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:36,313 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620732604] [2019-10-13 19:14:36,314 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:36,315 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:36,315 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864421671] [2019-10-13 19:14:36,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:36,316 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:36,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:36,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:36,317 INFO L87 Difference]: Start difference. First operand 308 states and 530 transitions. Second operand 3 states. [2019-10-13 19:14:36,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:36,337 INFO L93 Difference]: Finished difference Result 572 states and 1000 transitions. [2019-10-13 19:14:36,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:36,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-13 19:14:36,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:36,342 INFO L225 Difference]: With dead ends: 572 [2019-10-13 19:14:36,342 INFO L226 Difference]: Without dead ends: 570 [2019-10-13 19:14:36,342 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:36,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-10-13 19:14:36,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 424. [2019-10-13 19:14:36,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2019-10-13 19:14:36,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 718 transitions. [2019-10-13 19:14:36,356 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 718 transitions. Word has length 25 [2019-10-13 19:14:36,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:36,357 INFO L462 AbstractCegarLoop]: Abstraction has 424 states and 718 transitions. [2019-10-13 19:14:36,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:36,357 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 718 transitions. [2019-10-13 19:14:36,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 19:14:36,358 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:36,359 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:36,359 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:36,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:36,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1573139228, now seen corresponding path program 1 times [2019-10-13 19:14:36,360 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:36,360 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092082388] [2019-10-13 19:14:36,360 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:36,360 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:36,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:36,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:36,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:36,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:36,383 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092082388] [2019-10-13 19:14:36,383 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:36,383 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:36,383 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806702082] [2019-10-13 19:14:36,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:36,384 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:36,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:36,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:36,385 INFO L87 Difference]: Start difference. First operand 424 states and 718 transitions. Second operand 3 states. [2019-10-13 19:14:36,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:36,412 INFO L93 Difference]: Finished difference Result 1004 states and 1712 transitions. [2019-10-13 19:14:36,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:36,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-13 19:14:36,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:36,416 INFO L225 Difference]: With dead ends: 1004 [2019-10-13 19:14:36,416 INFO L226 Difference]: Without dead ends: 594 [2019-10-13 19:14:36,417 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:36,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-10-13 19:14:36,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 592. [2019-10-13 19:14:36,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-10-13 19:14:36,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 998 transitions. [2019-10-13 19:14:36,436 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 998 transitions. Word has length 25 [2019-10-13 19:14:36,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:36,436 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 998 transitions. [2019-10-13 19:14:36,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:36,437 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 998 transitions. [2019-10-13 19:14:36,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 19:14:36,438 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:36,438 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:36,438 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:36,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:36,439 INFO L82 PathProgramCache]: Analyzing trace with hash -501393703, now seen corresponding path program 1 times [2019-10-13 19:14:36,439 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:36,439 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450176719] [2019-10-13 19:14:36,439 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:36,439 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:36,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:36,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:36,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:36,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:36,464 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450176719] [2019-10-13 19:14:36,464 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:36,464 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:36,465 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279615389] [2019-10-13 19:14:36,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:36,465 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:36,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:36,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:36,466 INFO L87 Difference]: Start difference. First operand 592 states and 998 transitions. Second operand 3 states. [2019-10-13 19:14:36,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:36,486 INFO L93 Difference]: Finished difference Result 888 states and 1492 transitions. [2019-10-13 19:14:36,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:36,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-13 19:14:36,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:36,490 INFO L225 Difference]: With dead ends: 888 [2019-10-13 19:14:36,490 INFO L226 Difference]: Without dead ends: 602 [2019-10-13 19:14:36,491 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:36,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-10-13 19:14:36,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2019-10-13 19:14:36,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-13 19:14:36,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 998 transitions. [2019-10-13 19:14:36,508 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 998 transitions. Word has length 26 [2019-10-13 19:14:36,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:36,508 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 998 transitions. [2019-10-13 19:14:36,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:36,508 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 998 transitions. [2019-10-13 19:14:36,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 19:14:36,509 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:36,510 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:36,510 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:36,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:36,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1522462057, now seen corresponding path program 1 times [2019-10-13 19:14:36,511 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:36,511 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067018100] [2019-10-13 19:14:36,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:36,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:36,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:36,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:36,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:36,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:36,533 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067018100] [2019-10-13 19:14:36,533 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:36,534 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:36,534 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090228947] [2019-10-13 19:14:36,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:36,535 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:36,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:36,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:36,535 INFO L87 Difference]: Start difference. First operand 600 states and 998 transitions. Second operand 3 states. [2019-10-13 19:14:36,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:36,558 INFO L93 Difference]: Finished difference Result 1100 states and 1864 transitions. [2019-10-13 19:14:36,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:36,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-13 19:14:36,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:36,564 INFO L225 Difference]: With dead ends: 1100 [2019-10-13 19:14:36,565 INFO L226 Difference]: Without dead ends: 1098 [2019-10-13 19:14:36,565 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:36,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2019-10-13 19:14:36,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 840. [2019-10-13 19:14:36,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-10-13 19:14:36,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1366 transitions. [2019-10-13 19:14:36,591 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1366 transitions. Word has length 26 [2019-10-13 19:14:36,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:36,592 INFO L462 AbstractCegarLoop]: Abstraction has 840 states and 1366 transitions. [2019-10-13 19:14:36,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:36,592 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1366 transitions. [2019-10-13 19:14:36,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 19:14:36,594 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:36,594 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:36,594 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:36,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:36,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1492641561, now seen corresponding path program 1 times [2019-10-13 19:14:36,595 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:36,595 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250892989] [2019-10-13 19:14:36,595 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:36,595 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:36,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:36,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:36,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:36,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:36,621 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250892989] [2019-10-13 19:14:36,621 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:36,622 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:36,622 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130347194] [2019-10-13 19:14:36,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:36,623 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:36,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:36,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:36,624 INFO L87 Difference]: Start difference. First operand 840 states and 1366 transitions. Second operand 3 states. [2019-10-13 19:14:36,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:36,661 INFO L93 Difference]: Finished difference Result 1980 states and 3240 transitions. [2019-10-13 19:14:36,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:36,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-13 19:14:36,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:36,668 INFO L225 Difference]: With dead ends: 1980 [2019-10-13 19:14:36,668 INFO L226 Difference]: Without dead ends: 1162 [2019-10-13 19:14:36,671 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:36,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2019-10-13 19:14:36,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1160. [2019-10-13 19:14:36,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160 states. [2019-10-13 19:14:36,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1878 transitions. [2019-10-13 19:14:36,706 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1878 transitions. Word has length 26 [2019-10-13 19:14:36,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:36,707 INFO L462 AbstractCegarLoop]: Abstraction has 1160 states and 1878 transitions. [2019-10-13 19:14:36,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:36,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1878 transitions. [2019-10-13 19:14:36,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 19:14:36,710 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:36,710 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:36,710 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:36,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:36,711 INFO L82 PathProgramCache]: Analyzing trace with hash 48530585, now seen corresponding path program 1 times [2019-10-13 19:14:36,711 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:36,711 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089210033] [2019-10-13 19:14:36,711 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:36,711 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:36,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:36,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:36,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:36,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:36,755 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089210033] [2019-10-13 19:14:36,755 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:36,755 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:36,755 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482069063] [2019-10-13 19:14:36,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:36,756 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:36,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:36,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:36,757 INFO L87 Difference]: Start difference. First operand 1160 states and 1878 transitions. Second operand 3 states. [2019-10-13 19:14:36,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:36,786 INFO L93 Difference]: Finished difference Result 1740 states and 2808 transitions. [2019-10-13 19:14:36,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:36,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-13 19:14:36,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:36,792 INFO L225 Difference]: With dead ends: 1740 [2019-10-13 19:14:36,792 INFO L226 Difference]: Without dead ends: 1178 [2019-10-13 19:14:36,793 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:36,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2019-10-13 19:14:36,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1176. [2019-10-13 19:14:36,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1176 states. [2019-10-13 19:14:36,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1878 transitions. [2019-10-13 19:14:36,825 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1878 transitions. Word has length 27 [2019-10-13 19:14:36,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:36,826 INFO L462 AbstractCegarLoop]: Abstraction has 1176 states and 1878 transitions. [2019-10-13 19:14:36,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:36,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1878 transitions. [2019-10-13 19:14:36,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 19:14:36,828 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:36,828 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:36,828 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:36,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:36,829 INFO L82 PathProgramCache]: Analyzing trace with hash -972537769, now seen corresponding path program 1 times [2019-10-13 19:14:36,829 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:36,829 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019412277] [2019-10-13 19:14:36,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:36,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:36,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:36,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:36,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:36,849 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019412277] [2019-10-13 19:14:36,850 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:36,850 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:36,850 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480821036] [2019-10-13 19:14:36,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:36,851 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:36,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:36,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:36,851 INFO L87 Difference]: Start difference. First operand 1176 states and 1878 transitions. Second operand 3 states. [2019-10-13 19:14:36,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:36,886 INFO L93 Difference]: Finished difference Result 2124 states and 3464 transitions. [2019-10-13 19:14:36,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:36,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-13 19:14:36,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:36,896 INFO L225 Difference]: With dead ends: 2124 [2019-10-13 19:14:36,896 INFO L226 Difference]: Without dead ends: 2122 [2019-10-13 19:14:36,897 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:36,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2019-10-13 19:14:36,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 1672. [2019-10-13 19:14:36,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2019-10-13 19:14:36,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2598 transitions. [2019-10-13 19:14:36,945 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 2598 transitions. Word has length 27 [2019-10-13 19:14:36,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:36,945 INFO L462 AbstractCegarLoop]: Abstraction has 1672 states and 2598 transitions. [2019-10-13 19:14:36,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:36,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2598 transitions. [2019-10-13 19:14:36,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 19:14:36,948 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:36,948 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:36,948 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:36,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:36,949 INFO L82 PathProgramCache]: Analyzing trace with hash 2042565849, now seen corresponding path program 1 times [2019-10-13 19:14:36,949 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:36,949 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721675226] [2019-10-13 19:14:36,949 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:36,949 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:36,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:36,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:36,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:36,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:36,968 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721675226] [2019-10-13 19:14:36,969 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:36,969 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:36,969 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761211862] [2019-10-13 19:14:36,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:36,970 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:36,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:36,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:36,970 INFO L87 Difference]: Start difference. First operand 1672 states and 2598 transitions. Second operand 3 states. [2019-10-13 19:14:37,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:37,024 INFO L93 Difference]: Finished difference Result 3916 states and 6120 transitions. [2019-10-13 19:14:37,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:37,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-13 19:14:37,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:37,039 INFO L225 Difference]: With dead ends: 3916 [2019-10-13 19:14:37,040 INFO L226 Difference]: Without dead ends: 2282 [2019-10-13 19:14:37,044 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:37,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2019-10-13 19:14:37,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 2280. [2019-10-13 19:14:37,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2280 states. [2019-10-13 19:14:37,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 3526 transitions. [2019-10-13 19:14:37,128 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 3526 transitions. Word has length 27 [2019-10-13 19:14:37,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:37,129 INFO L462 AbstractCegarLoop]: Abstraction has 2280 states and 3526 transitions. [2019-10-13 19:14:37,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:37,129 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 3526 transitions. [2019-10-13 19:14:37,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 19:14:37,134 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:37,134 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-13 19:14:37,134 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:37,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:37,135 INFO L82 PathProgramCache]: Analyzing trace with hash -83685330, now seen corresponding path program 1 times [2019-10-13 19:14:37,135 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:37,135 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169805358] [2019-10-13 19:14:37,135 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:37,136 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:37,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:37,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:37,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:37,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:37,158 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169805358] [2019-10-13 19:14:37,158 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:37,158 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:37,158 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316230274] [2019-10-13 19:14:37,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:37,159 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:37,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:37,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:37,160 INFO L87 Difference]: Start difference. First operand 2280 states and 3526 transitions. Second operand 3 states. [2019-10-13 19:14:37,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:37,219 INFO L93 Difference]: Finished difference Result 3420 states and 5272 transitions. [2019-10-13 19:14:37,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:37,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-13 19:14:37,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:37,235 INFO L225 Difference]: With dead ends: 3420 [2019-10-13 19:14:37,236 INFO L226 Difference]: Without dead ends: 2314 [2019-10-13 19:14:37,239 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:37,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2019-10-13 19:14:37,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 2312. [2019-10-13 19:14:37,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2019-10-13 19:14:37,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 3526 transitions. [2019-10-13 19:14:37,353 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 3526 transitions. Word has length 28 [2019-10-13 19:14:37,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:37,354 INFO L462 AbstractCegarLoop]: Abstraction has 2312 states and 3526 transitions. [2019-10-13 19:14:37,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:37,354 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 3526 transitions. [2019-10-13 19:14:37,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 19:14:37,358 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:37,358 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-13 19:14:37,359 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:37,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:37,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1104753684, now seen corresponding path program 1 times [2019-10-13 19:14:37,359 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:37,359 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367866943] [2019-10-13 19:14:37,360 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:37,360 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:37,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:37,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:37,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:37,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:37,394 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367866943] [2019-10-13 19:14:37,394 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:37,394 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:37,394 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039557289] [2019-10-13 19:14:37,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:37,398 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:37,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:37,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:37,399 INFO L87 Difference]: Start difference. First operand 2312 states and 3526 transitions. Second operand 3 states. [2019-10-13 19:14:37,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:37,457 INFO L93 Difference]: Finished difference Result 4108 states and 6408 transitions. [2019-10-13 19:14:37,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:37,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-13 19:14:37,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:37,477 INFO L225 Difference]: With dead ends: 4108 [2019-10-13 19:14:37,477 INFO L226 Difference]: Without dead ends: 4106 [2019-10-13 19:14:37,479 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:37,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2019-10-13 19:14:37,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 3336. [2019-10-13 19:14:37,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3336 states. [2019-10-13 19:14:37,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4934 transitions. [2019-10-13 19:14:37,565 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4934 transitions. Word has length 28 [2019-10-13 19:14:37,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:37,566 INFO L462 AbstractCegarLoop]: Abstraction has 3336 states and 4934 transitions. [2019-10-13 19:14:37,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:37,566 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4934 transitions. [2019-10-13 19:14:37,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 19:14:37,571 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:37,571 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-13 19:14:37,572 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:37,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:37,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1910349934, now seen corresponding path program 1 times [2019-10-13 19:14:37,572 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:37,572 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980782475] [2019-10-13 19:14:37,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:37,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:37,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:37,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:37,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:37,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:37,590 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980782475] [2019-10-13 19:14:37,590 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:37,590 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:37,590 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964344902] [2019-10-13 19:14:37,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:37,591 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:37,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:37,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:37,592 INFO L87 Difference]: Start difference. First operand 3336 states and 4934 transitions. Second operand 3 states. [2019-10-13 19:14:37,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:37,662 INFO L93 Difference]: Finished difference Result 7756 states and 11528 transitions. [2019-10-13 19:14:37,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:37,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-13 19:14:37,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:37,684 INFO L225 Difference]: With dead ends: 7756 [2019-10-13 19:14:37,684 INFO L226 Difference]: Without dead ends: 4490 [2019-10-13 19:14:37,690 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:37,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2019-10-13 19:14:37,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 4488. [2019-10-13 19:14:37,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4488 states. [2019-10-13 19:14:37,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4488 states to 4488 states and 6598 transitions. [2019-10-13 19:14:37,851 INFO L78 Accepts]: Start accepts. Automaton has 4488 states and 6598 transitions. Word has length 28 [2019-10-13 19:14:37,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:37,852 INFO L462 AbstractCegarLoop]: Abstraction has 4488 states and 6598 transitions. [2019-10-13 19:14:37,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:37,852 INFO L276 IsEmpty]: Start isEmpty. Operand 4488 states and 6598 transitions. [2019-10-13 19:14:37,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 19:14:37,860 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:37,860 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-13 19:14:37,860 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:37,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:37,861 INFO L82 PathProgramCache]: Analyzing trace with hash 112588942, now seen corresponding path program 1 times [2019-10-13 19:14:37,861 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:37,861 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409097445] [2019-10-13 19:14:37,861 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:37,861 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:37,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:37,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:37,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:37,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:37,881 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409097445] [2019-10-13 19:14:37,881 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:37,881 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:37,882 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977282218] [2019-10-13 19:14:37,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:37,882 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:37,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:37,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:37,883 INFO L87 Difference]: Start difference. First operand 4488 states and 6598 transitions. Second operand 3 states. [2019-10-13 19:14:37,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:37,949 INFO L93 Difference]: Finished difference Result 6732 states and 9864 transitions. [2019-10-13 19:14:37,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:37,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-13 19:14:37,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:37,976 INFO L225 Difference]: With dead ends: 6732 [2019-10-13 19:14:37,976 INFO L226 Difference]: Without dead ends: 4554 [2019-10-13 19:14:37,986 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:37,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4554 states. [2019-10-13 19:14:38,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4554 to 4552. [2019-10-13 19:14:38,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4552 states. [2019-10-13 19:14:38,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4552 states to 4552 states and 6598 transitions. [2019-10-13 19:14:38,107 INFO L78 Accepts]: Start accepts. Automaton has 4552 states and 6598 transitions. Word has length 29 [2019-10-13 19:14:38,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:38,107 INFO L462 AbstractCegarLoop]: Abstraction has 4552 states and 6598 transitions. [2019-10-13 19:14:38,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:38,107 INFO L276 IsEmpty]: Start isEmpty. Operand 4552 states and 6598 transitions. [2019-10-13 19:14:38,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 19:14:38,113 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:38,113 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-13 19:14:38,113 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:38,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:38,114 INFO L82 PathProgramCache]: Analyzing trace with hash -908479412, now seen corresponding path program 1 times [2019-10-13 19:14:38,114 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:38,114 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460915766] [2019-10-13 19:14:38,114 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:38,115 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:38,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:38,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:38,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:38,139 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460915766] [2019-10-13 19:14:38,139 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:38,139 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:38,140 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525127214] [2019-10-13 19:14:38,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:38,140 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:38,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:38,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:38,141 INFO L87 Difference]: Start difference. First operand 4552 states and 6598 transitions. Second operand 3 states. [2019-10-13 19:14:38,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:38,274 INFO L93 Difference]: Finished difference Result 13260 states and 19016 transitions. [2019-10-13 19:14:38,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:38,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-13 19:14:38,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:38,302 INFO L225 Difference]: With dead ends: 13260 [2019-10-13 19:14:38,302 INFO L226 Difference]: Without dead ends: 8842 [2019-10-13 19:14:38,314 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:38,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8842 states. [2019-10-13 19:14:38,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8842 to 8840. [2019-10-13 19:14:38,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8840 states. [2019-10-13 19:14:38,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8840 states to 8840 states and 12422 transitions. [2019-10-13 19:14:38,615 INFO L78 Accepts]: Start accepts. Automaton has 8840 states and 12422 transitions. Word has length 29 [2019-10-13 19:14:38,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:38,615 INFO L462 AbstractCegarLoop]: Abstraction has 8840 states and 12422 transitions. [2019-10-13 19:14:38,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:38,615 INFO L276 IsEmpty]: Start isEmpty. Operand 8840 states and 12422 transitions. [2019-10-13 19:14:38,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 19:14:38,625 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:38,625 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-13 19:14:38,626 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:38,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:38,627 INFO L82 PathProgramCache]: Analyzing trace with hash 371384266, now seen corresponding path program 1 times [2019-10-13 19:14:38,627 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:38,627 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697520162] [2019-10-13 19:14:38,627 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:38,627 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:38,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:38,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:38,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:38,650 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697520162] [2019-10-13 19:14:38,650 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:38,651 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:38,651 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731056088] [2019-10-13 19:14:38,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:38,651 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:38,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:38,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:38,652 INFO L87 Difference]: Start difference. First operand 8840 states and 12422 transitions. Second operand 3 states. [2019-10-13 19:14:38,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:38,780 INFO L93 Difference]: Finished difference Result 10124 states and 14728 transitions. [2019-10-13 19:14:38,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:38,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-13 19:14:38,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:38,805 INFO L225 Difference]: With dead ends: 10124 [2019-10-13 19:14:38,805 INFO L226 Difference]: Without dead ends: 10122 [2019-10-13 19:14:38,810 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:38,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10122 states. [2019-10-13 19:14:39,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10122 to 8840. [2019-10-13 19:14:39,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8840 states. [2019-10-13 19:14:39,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8840 states to 8840 states and 12294 transitions. [2019-10-13 19:14:39,177 INFO L78 Accepts]: Start accepts. Automaton has 8840 states and 12294 transitions. Word has length 29 [2019-10-13 19:14:39,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:39,178 INFO L462 AbstractCegarLoop]: Abstraction has 8840 states and 12294 transitions. [2019-10-13 19:14:39,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:39,178 INFO L276 IsEmpty]: Start isEmpty. Operand 8840 states and 12294 transitions. [2019-10-13 19:14:39,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 19:14:39,188 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:39,188 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-13 19:14:39,188 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:39,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:39,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1902124419, now seen corresponding path program 1 times [2019-10-13 19:14:39,189 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:39,189 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668430788] [2019-10-13 19:14:39,189 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:39,189 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:39,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:39,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:39,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:39,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:39,207 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668430788] [2019-10-13 19:14:39,207 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:39,208 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:39,208 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901090764] [2019-10-13 19:14:39,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:39,208 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:39,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:39,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:39,209 INFO L87 Difference]: Start difference. First operand 8840 states and 12294 transitions. Second operand 3 states. [2019-10-13 19:14:39,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:39,372 INFO L93 Difference]: Finished difference Result 15244 states and 21640 transitions. [2019-10-13 19:14:39,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:39,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-13 19:14:39,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:39,406 INFO L225 Difference]: With dead ends: 15244 [2019-10-13 19:14:39,406 INFO L226 Difference]: Without dead ends: 15242 [2019-10-13 19:14:39,414 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:39,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15242 states. [2019-10-13 19:14:39,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15242 to 13192. [2019-10-13 19:14:39,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13192 states. [2019-10-13 19:14:39,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13192 states to 13192 states and 17798 transitions. [2019-10-13 19:14:39,921 INFO L78 Accepts]: Start accepts. Automaton has 13192 states and 17798 transitions. Word has length 30 [2019-10-13 19:14:39,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:39,921 INFO L462 AbstractCegarLoop]: Abstraction has 13192 states and 17798 transitions. [2019-10-13 19:14:39,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:39,921 INFO L276 IsEmpty]: Start isEmpty. Operand 13192 states and 17798 transitions. [2019-10-13 19:14:39,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 19:14:39,941 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:39,941 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-13 19:14:39,942 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:39,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:39,942 INFO L82 PathProgramCache]: Analyzing trace with hash 622260741, now seen corresponding path program 1 times [2019-10-13 19:14:39,942 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:39,943 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059785036] [2019-10-13 19:14:39,943 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:39,943 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:39,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:39,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:39,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:39,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:39,971 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059785036] [2019-10-13 19:14:39,971 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:39,971 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:39,972 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355542525] [2019-10-13 19:14:39,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:39,972 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:39,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:39,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:39,973 INFO L87 Difference]: Start difference. First operand 13192 states and 17798 transitions. Second operand 3 states. [2019-10-13 19:14:40,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:40,208 INFO L93 Difference]: Finished difference Result 30348 states and 41096 transitions. [2019-10-13 19:14:40,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:40,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-13 19:14:40,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:40,244 INFO L225 Difference]: With dead ends: 30348 [2019-10-13 19:14:40,245 INFO L226 Difference]: Without dead ends: 17290 [2019-10-13 19:14:40,270 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:40,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17290 states. [2019-10-13 19:14:41,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17290 to 17288. [2019-10-13 19:14:41,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17288 states. [2019-10-13 19:14:41,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17288 states to 17288 states and 23046 transitions. [2019-10-13 19:14:41,142 INFO L78 Accepts]: Start accepts. Automaton has 17288 states and 23046 transitions. Word has length 30 [2019-10-13 19:14:41,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:41,143 INFO L462 AbstractCegarLoop]: Abstraction has 17288 states and 23046 transitions. [2019-10-13 19:14:41,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:41,143 INFO L276 IsEmpty]: Start isEmpty. Operand 17288 states and 23046 transitions. [2019-10-13 19:14:41,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-13 19:14:41,162 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:41,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, 1, 1] [2019-10-13 19:14:41,162 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:41,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:41,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1163469695, now seen corresponding path program 1 times [2019-10-13 19:14:41,163 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:41,163 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130003816] [2019-10-13 19:14:41,163 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:41,164 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:41,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:41,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:41,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:41,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:41,183 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130003816] [2019-10-13 19:14:41,183 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:41,184 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:41,184 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834100133] [2019-10-13 19:14:41,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:41,184 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:41,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:41,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:41,185 INFO L87 Difference]: Start difference. First operand 17288 states and 23046 transitions. Second operand 3 states. [2019-10-13 19:14:41,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:41,359 INFO L93 Difference]: Finished difference Result 26124 states and 34824 transitions. [2019-10-13 19:14:41,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:41,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-13 19:14:41,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:41,390 INFO L225 Difference]: With dead ends: 26124 [2019-10-13 19:14:41,390 INFO L226 Difference]: Without dead ends: 17674 [2019-10-13 19:14:41,410 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:41,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17674 states. [2019-10-13 19:14:41,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17674 to 17672. [2019-10-13 19:14:41,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17672 states. [2019-10-13 19:14:41,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17672 states to 17672 states and 23302 transitions. [2019-10-13 19:14:41,869 INFO L78 Accepts]: Start accepts. Automaton has 17672 states and 23302 transitions. Word has length 31 [2019-10-13 19:14:41,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:41,869 INFO L462 AbstractCegarLoop]: Abstraction has 17672 states and 23302 transitions. [2019-10-13 19:14:41,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:41,869 INFO L276 IsEmpty]: Start isEmpty. Operand 17672 states and 23302 transitions. [2019-10-13 19:14:41,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-13 19:14:41,889 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:41,889 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-13 19:14:41,889 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:41,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:41,890 INFO L82 PathProgramCache]: Analyzing trace with hash 2110429247, now seen corresponding path program 1 times [2019-10-13 19:14:41,890 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:41,890 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929443899] [2019-10-13 19:14:41,890 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:41,890 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:41,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:41,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:41,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:41,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:41,912 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929443899] [2019-10-13 19:14:41,913 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:41,913 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:41,913 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379488670] [2019-10-13 19:14:41,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:41,913 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:41,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:41,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:41,914 INFO L87 Difference]: Start difference. First operand 17672 states and 23302 transitions. Second operand 3 states. [2019-10-13 19:14:42,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:42,192 INFO L93 Difference]: Finished difference Result 29708 states and 39688 transitions. [2019-10-13 19:14:42,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:42,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-13 19:14:42,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:42,246 INFO L225 Difference]: With dead ends: 29708 [2019-10-13 19:14:42,246 INFO L226 Difference]: Without dead ends: 29706 [2019-10-13 19:14:42,258 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:42,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29706 states. [2019-10-13 19:14:42,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29706 to 26632. [2019-10-13 19:14:42,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26632 states. [2019-10-13 19:14:42,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26632 states to 26632 states and 34054 transitions. [2019-10-13 19:14:42,783 INFO L78 Accepts]: Start accepts. Automaton has 26632 states and 34054 transitions. Word has length 31 [2019-10-13 19:14:42,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:42,783 INFO L462 AbstractCegarLoop]: Abstraction has 26632 states and 34054 transitions. [2019-10-13 19:14:42,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:42,783 INFO L276 IsEmpty]: Start isEmpty. Operand 26632 states and 34054 transitions. [2019-10-13 19:14:42,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-13 19:14:42,820 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:42,820 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-13 19:14:42,820 INFO L410 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:42,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:42,821 INFO L82 PathProgramCache]: Analyzing trace with hash 830565569, now seen corresponding path program 1 times [2019-10-13 19:14:42,821 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:42,821 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115213489] [2019-10-13 19:14:42,821 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:42,822 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:42,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:42,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:42,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:42,840 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115213489] [2019-10-13 19:14:42,840 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:42,840 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:42,841 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682685434] [2019-10-13 19:14:42,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:42,841 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:42,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:42,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:42,842 INFO L87 Difference]: Start difference. First operand 26632 states and 34054 transitions. Second operand 3 states. [2019-10-13 19:14:43,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:43,153 INFO L93 Difference]: Finished difference Result 60428 states and 77064 transitions. [2019-10-13 19:14:43,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:43,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-13 19:14:43,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:43,213 INFO L225 Difference]: With dead ends: 60428 [2019-10-13 19:14:43,214 INFO L226 Difference]: Without dead ends: 34314 [2019-10-13 19:14:43,266 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:43,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34314 states. [2019-10-13 19:14:44,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34314 to 34312. [2019-10-13 19:14:44,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34312 states. [2019-10-13 19:14:44,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34312 states to 34312 states and 43014 transitions. [2019-10-13 19:14:44,062 INFO L78 Accepts]: Start accepts. Automaton has 34312 states and 43014 transitions. Word has length 31 [2019-10-13 19:14:44,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:44,063 INFO L462 AbstractCegarLoop]: Abstraction has 34312 states and 43014 transitions. [2019-10-13 19:14:44,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:44,063 INFO L276 IsEmpty]: Start isEmpty. Operand 34312 states and 43014 transitions. [2019-10-13 19:14:44,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-13 19:14:44,092 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:44,093 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-13 19:14:44,093 INFO L410 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:44,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:44,093 INFO L82 PathProgramCache]: Analyzing trace with hash 999013018, now seen corresponding path program 1 times [2019-10-13 19:14:44,093 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:44,094 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962264632] [2019-10-13 19:14:44,094 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:44,094 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:44,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:44,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:44,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:44,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:44,113 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962264632] [2019-10-13 19:14:44,113 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:44,113 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:44,113 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186970137] [2019-10-13 19:14:44,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:44,114 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:44,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:44,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:44,114 INFO L87 Difference]: Start difference. First operand 34312 states and 43014 transitions. Second operand 3 states. [2019-10-13 19:14:44,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:44,552 INFO L93 Difference]: Finished difference Result 51468 states and 64264 transitions. [2019-10-13 19:14:44,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:44,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-13 19:14:44,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:44,626 INFO L225 Difference]: With dead ends: 51468 [2019-10-13 19:14:44,626 INFO L226 Difference]: Without dead ends: 34826 [2019-10-13 19:14:44,649 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:44,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34826 states. [2019-10-13 19:14:45,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34826 to 34824. [2019-10-13 19:14:45,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34824 states. [2019-10-13 19:14:45,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34824 states to 34824 states and 43014 transitions. [2019-10-13 19:14:45,153 INFO L78 Accepts]: Start accepts. Automaton has 34824 states and 43014 transitions. Word has length 32 [2019-10-13 19:14:45,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:45,154 INFO L462 AbstractCegarLoop]: Abstraction has 34824 states and 43014 transitions. [2019-10-13 19:14:45,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:45,154 INFO L276 IsEmpty]: Start isEmpty. Operand 34824 states and 43014 transitions. [2019-10-13 19:14:45,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-13 19:14:45,182 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:45,182 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-13 19:14:45,182 INFO L410 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:45,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:45,183 INFO L82 PathProgramCache]: Analyzing trace with hash -22055336, now seen corresponding path program 1 times [2019-10-13 19:14:45,183 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:45,183 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448743657] [2019-10-13 19:14:45,183 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:45,184 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:45,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:45,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:45,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:45,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:45,207 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448743657] [2019-10-13 19:14:45,207 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:45,208 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:45,208 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329767970] [2019-10-13 19:14:45,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:45,208 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:45,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:45,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:45,209 INFO L87 Difference]: Start difference. First operand 34824 states and 43014 transitions. Second operand 3 states. [2019-10-13 19:14:45,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:45,857 INFO L93 Difference]: Finished difference Result 57356 states and 71176 transitions. [2019-10-13 19:14:45,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:45,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-13 19:14:45,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:45,914 INFO L225 Difference]: With dead ends: 57356 [2019-10-13 19:14:45,914 INFO L226 Difference]: Without dead ends: 57354 [2019-10-13 19:14:45,923 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:45,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57354 states. [2019-10-13 19:14:46,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57354 to 53256. [2019-10-13 19:14:46,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53256 states. [2019-10-13 19:14:47,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53256 states to 53256 states and 64006 transitions. [2019-10-13 19:14:47,780 INFO L78 Accepts]: Start accepts. Automaton has 53256 states and 64006 transitions. Word has length 32 [2019-10-13 19:14:47,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:47,781 INFO L462 AbstractCegarLoop]: Abstraction has 53256 states and 64006 transitions. [2019-10-13 19:14:47,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:47,781 INFO L276 IsEmpty]: Start isEmpty. Operand 53256 states and 64006 transitions. [2019-10-13 19:14:47,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-13 19:14:47,811 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:47,812 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-13 19:14:47,812 INFO L410 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:47,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:47,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1301919014, now seen corresponding path program 1 times [2019-10-13 19:14:47,812 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:47,813 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211885825] [2019-10-13 19:14:47,813 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:47,813 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:47,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:47,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:47,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:47,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:47,830 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211885825] [2019-10-13 19:14:47,830 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:47,830 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:47,830 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612254146] [2019-10-13 19:14:47,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:47,831 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:47,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:47,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:47,831 INFO L87 Difference]: Start difference. First operand 53256 states and 64006 transitions. Second operand 3 states. [2019-10-13 19:14:48,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:48,306 INFO L93 Difference]: Finished difference Result 119820 states and 142856 transitions. [2019-10-13 19:14:48,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:48,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-13 19:14:48,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:48,376 INFO L225 Difference]: With dead ends: 119820 [2019-10-13 19:14:48,376 INFO L226 Difference]: Without dead ends: 67594 [2019-10-13 19:14:48,426 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:48,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67594 states. [2019-10-13 19:14:49,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67594 to 67592. [2019-10-13 19:14:49,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67592 states. [2019-10-13 19:14:49,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67592 states to 67592 states and 78854 transitions. [2019-10-13 19:14:49,445 INFO L78 Accepts]: Start accepts. Automaton has 67592 states and 78854 transitions. Word has length 32 [2019-10-13 19:14:49,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:49,445 INFO L462 AbstractCegarLoop]: Abstraction has 67592 states and 78854 transitions. [2019-10-13 19:14:49,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:49,445 INFO L276 IsEmpty]: Start isEmpty. Operand 67592 states and 78854 transitions. [2019-10-13 19:14:49,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-13 19:14:49,471 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:49,471 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-13 19:14:49,471 INFO L410 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:49,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:49,471 INFO L82 PathProgramCache]: Analyzing trace with hash -683499274, now seen corresponding path program 1 times [2019-10-13 19:14:49,472 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:49,472 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899772925] [2019-10-13 19:14:49,472 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:49,472 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:49,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:49,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:49,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:49,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:49,492 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899772925] [2019-10-13 19:14:49,493 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:49,493 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:49,493 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115966717] [2019-10-13 19:14:49,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:49,494 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:49,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:49,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:49,494 INFO L87 Difference]: Start difference. First operand 67592 states and 78854 transitions. Second operand 3 states. [2019-10-13 19:14:49,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:49,924 INFO L93 Difference]: Finished difference Result 101388 states and 117768 transitions. [2019-10-13 19:14:49,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:49,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-13 19:14:49,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:50,289 INFO L225 Difference]: With dead ends: 101388 [2019-10-13 19:14:50,289 INFO L226 Difference]: Without dead ends: 68618 [2019-10-13 19:14:50,303 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:50,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68618 states. [2019-10-13 19:14:50,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68618 to 68616. [2019-10-13 19:14:50,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68616 states. [2019-10-13 19:14:50,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68616 states to 68616 states and 78854 transitions. [2019-10-13 19:14:50,917 INFO L78 Accepts]: Start accepts. Automaton has 68616 states and 78854 transitions. Word has length 33 [2019-10-13 19:14:50,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:50,918 INFO L462 AbstractCegarLoop]: Abstraction has 68616 states and 78854 transitions. [2019-10-13 19:14:50,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:50,918 INFO L276 IsEmpty]: Start isEmpty. Operand 68616 states and 78854 transitions. [2019-10-13 19:14:50,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-13 19:14:50,943 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:50,943 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-13 19:14:50,943 INFO L410 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:50,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:50,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1704567628, now seen corresponding path program 1 times [2019-10-13 19:14:50,944 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:50,944 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100999015] [2019-10-13 19:14:50,944 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:50,944 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:50,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:50,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:50,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:50,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:50,969 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100999015] [2019-10-13 19:14:50,970 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:50,970 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:50,970 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820542483] [2019-10-13 19:14:50,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:50,970 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:50,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:50,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:50,971 INFO L87 Difference]: Start difference. First operand 68616 states and 78854 transitions. Second operand 3 states. [2019-10-13 19:14:52,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:52,726 INFO L93 Difference]: Finished difference Result 110602 states and 125959 transitions. [2019-10-13 19:14:52,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:52,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-13 19:14:52,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:52,804 INFO L225 Difference]: With dead ends: 110602 [2019-10-13 19:14:52,805 INFO L226 Difference]: Without dead ends: 110600 [2019-10-13 19:14:52,815 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:52,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110600 states. [2019-10-13 19:14:53,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110600 to 106504. [2019-10-13 19:14:53,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106504 states. [2019-10-13 19:14:53,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106504 states to 106504 states and 119814 transitions. [2019-10-13 19:14:53,898 INFO L78 Accepts]: Start accepts. Automaton has 106504 states and 119814 transitions. Word has length 33 [2019-10-13 19:14:53,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:53,898 INFO L462 AbstractCegarLoop]: Abstraction has 106504 states and 119814 transitions. [2019-10-13 19:14:53,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:53,899 INFO L276 IsEmpty]: Start isEmpty. Operand 106504 states and 119814 transitions. [2019-10-13 19:14:53,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-13 19:14:53,947 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:53,947 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-13 19:14:53,947 INFO L410 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:53,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:53,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1310535990, now seen corresponding path program 1 times [2019-10-13 19:14:53,948 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:53,948 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023827192] [2019-10-13 19:14:53,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:53,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:53,965 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023827192] [2019-10-13 19:14:53,965 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:53,965 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:53,965 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855883752] [2019-10-13 19:14:53,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:53,966 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:53,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:53,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:53,966 INFO L87 Difference]: Start difference. First operand 106504 states and 119814 transitions. Second operand 3 states. [2019-10-13 19:14:56,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:56,652 INFO L93 Difference]: Finished difference Result 237576 states and 263174 transitions. [2019-10-13 19:14:56,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:56,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-13 19:14:56,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:56,653 INFO L225 Difference]: With dead ends: 237576 [2019-10-13 19:14:56,653 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 19:14:56,792 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:56,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 19:14:56,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 19:14:56,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 19:14:56,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 19:14:56,794 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2019-10-13 19:14:56,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:56,794 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 19:14:56,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:56,794 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 19:14:56,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 19:14:56,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 19:14:56,834 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-13 19:14:56,834 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 19:14:56,835 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 19:14:56,835 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-13 19:14:56,835 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 19:14:56,835 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 19:14:56,836 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 45 186) no Hoare annotation was computed. [2019-10-13 19:14:56,836 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 191) no Hoare annotation was computed. [2019-10-13 19:14:56,836 INFO L443 ceAbstractionStarter]: For program point L151-1(lines 45 186) no Hoare annotation was computed. [2019-10-13 19:14:56,836 INFO L443 ceAbstractionStarter]: For program point L176-1(lines 45 186) no Hoare annotation was computed. [2019-10-13 19:14:56,836 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-10-13 19:14:56,837 INFO L443 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-10-13 19:14:56,837 INFO L443 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-10-13 19:14:56,837 INFO L443 ceAbstractionStarter]: For program point L136-1(lines 45 186) no Hoare annotation was computed. [2019-10-13 19:14:56,837 INFO L443 ceAbstractionStarter]: For program point L161-1(lines 45 186) no Hoare annotation was computed. [2019-10-13 19:14:56,837 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 45 186) no Hoare annotation was computed. [2019-10-13 19:14:56,837 INFO L443 ceAbstractionStarter]: For program point L112-1(lines 45 186) no Hoare annotation was computed. [2019-10-13 19:14:56,838 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 191) no Hoare annotation was computed. [2019-10-13 19:14:56,838 INFO L443 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2019-10-13 19:14:56,838 INFO L443 ceAbstractionStarter]: For program point L104-1(lines 45 186) no Hoare annotation was computed. [2019-10-13 19:14:56,838 INFO L443 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-10-13 19:14:56,838 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 45 186) no Hoare annotation was computed. [2019-10-13 19:14:56,839 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 191) the Hoare annotation is: true [2019-10-13 19:14:56,839 INFO L446 ceAbstractionStarter]: At program point L187(lines 5 191) the Hoare annotation is: true [2019-10-13 19:14:56,839 INFO L443 ceAbstractionStarter]: For program point L88-1(lines 45 186) no Hoare annotation was computed. [2019-10-13 19:14:56,839 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2019-10-13 19:14:56,839 INFO L443 ceAbstractionStarter]: For program point L146-1(lines 45 186) no Hoare annotation was computed. [2019-10-13 19:14:56,840 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 49) no Hoare annotation was computed. [2019-10-13 19:14:56,840 INFO L443 ceAbstractionStarter]: For program point L80-1(lines 45 186) no Hoare annotation was computed. [2019-10-13 19:14:56,840 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 45 186) no Hoare annotation was computed. [2019-10-13 19:14:56,840 INFO L443 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-10-13 19:14:56,840 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-10-13 19:14:56,840 INFO L443 ceAbstractionStarter]: For program point L131-1(lines 45 186) no Hoare annotation was computed. [2019-10-13 19:14:56,841 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 45 186) no Hoare annotation was computed. [2019-10-13 19:14:56,841 INFO L446 ceAbstractionStarter]: At program point L181-1(lines 45 186) the Hoare annotation is: true [2019-10-13 19:14:56,841 INFO L443 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-10-13 19:14:56,841 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-10-13 19:14:56,841 INFO L443 ceAbstractionStarter]: For program point L182(line 182) no Hoare annotation was computed. [2019-10-13 19:14:56,842 INFO L439 ceAbstractionStarter]: At program point L182-1(lines 5 191) the Hoare annotation is: false [2019-10-13 19:14:56,842 INFO L443 ceAbstractionStarter]: For program point L116-1(lines 45 186) no Hoare annotation was computed. [2019-10-13 19:14:56,842 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 45 186) no Hoare annotation was computed. [2019-10-13 19:14:56,842 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 45 186) no Hoare annotation was computed. [2019-10-13 19:14:56,842 INFO L443 ceAbstractionStarter]: For program point L166-1(lines 45 186) no Hoare annotation was computed. [2019-10-13 19:14:56,843 INFO L443 ceAbstractionStarter]: For program point L100-1(lines 45 186) no Hoare annotation was computed. [2019-10-13 19:14:56,843 INFO L443 ceAbstractionStarter]: For program point L92-1(lines 45 186) no Hoare annotation was computed. [2019-10-13 19:14:56,843 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 45 186) no Hoare annotation was computed. [2019-10-13 19:14:56,843 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-10-13 19:14:56,843 INFO L443 ceAbstractionStarter]: For program point L76(lines 76 78) no Hoare annotation was computed. [2019-10-13 19:14:56,843 INFO L443 ceAbstractionStarter]: For program point L76-2(lines 45 186) no Hoare annotation was computed. [2019-10-13 19:14:56,844 INFO L443 ceAbstractionStarter]: For program point L167(line 167) no Hoare annotation was computed. [2019-10-13 19:14:56,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 07:14:56 BoogieIcfgContainer [2019-10-13 19:14:56,854 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 19:14:56,857 INFO L168 Benchmark]: Toolchain (without parser) took 22789.01 ms. Allocated memory was 145.2 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 103.1 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 385.5 MB. Max. memory is 7.1 GB. [2019-10-13 19:14:56,859 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-13 19:14:56,859 INFO L168 Benchmark]: CACSL2BoogieTranslator took 300.19 ms. Allocated memory is still 145.2 MB. Free memory was 102.9 MB in the beginning and 91.5 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. [2019-10-13 19:14:56,860 INFO L168 Benchmark]: Boogie Preprocessor took 133.97 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 91.5 MB in the beginning and 180.4 MB in the end (delta: -88.9 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2019-10-13 19:14:56,861 INFO L168 Benchmark]: RCFGBuilder took 407.78 ms. Allocated memory is still 202.9 MB. Free memory was 180.4 MB in the beginning and 159.3 MB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2019-10-13 19:14:56,865 INFO L168 Benchmark]: TraceAbstraction took 21942.13 ms. Allocated memory was 202.9 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 159.3 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 384.0 MB. Max. memory is 7.1 GB. [2019-10-13 19:14:56,873 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 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 300.19 ms. Allocated memory is still 145.2 MB. Free memory was 102.9 MB in the beginning and 91.5 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 133.97 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 91.5 MB in the beginning and 180.4 MB in the end (delta: -88.9 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 407.78 ms. Allocated memory is still 202.9 MB. Free memory was 180.4 MB in the beginning and 159.3 MB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 21942.13 ms. Allocated memory was 202.9 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 159.3 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 384.0 MB. 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: 21.8s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 10.2s, 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: 9.8s 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.2s SatisfiabilityAnalysisTime, 0.7s 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...