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/ssh-simplified/s3_srvr_1.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 19:50:24,905 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:50:24,908 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:50:24,927 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:50:24,927 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:50:24,930 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:50:24,932 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:50:24,942 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:50:24,946 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:50:24,950 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:50:24,952 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:50:24,954 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:50:24,955 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:50:24,956 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:50:24,959 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:50:24,960 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:50:24,962 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:50:24,962 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:50:24,964 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:50:24,969 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:50:24,973 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:50:24,977 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:50:24,980 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:50:24,981 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:50:24,983 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:50:24,983 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:50:24,983 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:50:24,985 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:50:24,986 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:50:24,987 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:50:24,987 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:50:24,989 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:50:24,989 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:50:24,990 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:50:24,992 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:50:24,992 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:50:24,993 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:50:24,993 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:50:24,993 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:50:24,994 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:50:24,995 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:50:24,996 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:50:25,029 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:50:25,029 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:50:25,035 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:50:25,036 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:50:25,036 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:50:25,036 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:50:25,036 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:50:25,037 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:50:25,037 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:50:25,037 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:50:25,037 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:50:25,037 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:50:25,038 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:50:25,038 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:50:25,038 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:50:25,038 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:50:25,039 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:50:25,039 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:50:25,039 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:50:25,039 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:50:25,039 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:50:25,039 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:50:25,040 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:50:25,040 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:50:25,040 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:50:25,040 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:50:25,041 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:50:25,041 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:50:25,041 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:50:25,341 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:50:25,357 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:50:25,361 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:50:25,362 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:50:25,363 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:50:25,364 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_1.cil-2.c [2019-10-13 19:50:25,438 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/760b9a555/d44ef4569b4b44f59658d7c5c54212d4/FLAG27d097f81 [2019-10-13 19:50:25,993 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:50:25,994 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_1.cil-2.c [2019-10-13 19:50:26,018 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/760b9a555/d44ef4569b4b44f59658d7c5c54212d4/FLAG27d097f81 [2019-10-13 19:50:26,272 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/760b9a555/d44ef4569b4b44f59658d7c5c54212d4 [2019-10-13 19:50:26,282 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:50:26,284 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:50:26,286 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:50:26,286 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:50:26,292 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:50:26,293 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:50:26" (1/1) ... [2019-10-13 19:50:26,297 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b7220a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:26, skipping insertion in model container [2019-10-13 19:50:26,297 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:50:26" (1/1) ... [2019-10-13 19:50:26,306 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:50:26,364 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:50:26,629 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:50:26,635 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:50:26,802 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:50:26,817 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:50:26,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:26 WrapperNode [2019-10-13 19:50:26,818 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:50:26,819 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:50:26,819 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:50:26,819 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:50:26,834 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:26" (1/1) ... [2019-10-13 19:50:26,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:26" (1/1) ... [2019-10-13 19:50:26,845 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:26" (1/1) ... [2019-10-13 19:50:26,845 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:26" (1/1) ... [2019-10-13 19:50:26,864 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:26" (1/1) ... [2019-10-13 19:50:26,892 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:26" (1/1) ... [2019-10-13 19:50:26,900 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:26" (1/1) ... [2019-10-13 19:50:26,908 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:50:26,908 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:50:26,909 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:50:26,909 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:50:26,910 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:26" (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:50:26,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:50:26,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:50:26,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-10-13 19:50:26,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ERR [2019-10-13 19:50:26,967 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:50:26,967 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:50:26,967 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 19:50:26,967 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 19:50:26,967 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-13 19:50:26,968 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-13 19:50:26,968 INFO L130 BoogieDeclarations]: Found specification of procedure ERR [2019-10-13 19:50:26,968 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-10-13 19:50:26,968 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:50:26,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:50:26,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:50:27,238 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 19:50:27,734 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-13 19:50:27,734 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-13 19:50:27,737 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:50:27,737 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 19:50:27,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:50:27 BoogieIcfgContainer [2019-10-13 19:50:27,739 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:50:27,741 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:50:27,741 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:50:27,744 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:50:27,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:50:26" (1/3) ... [2019-10-13 19:50:27,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@186a68f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:50:27, skipping insertion in model container [2019-10-13 19:50:27,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:26" (2/3) ... [2019-10-13 19:50:27,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@186a68f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:50:27, skipping insertion in model container [2019-10-13 19:50:27,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:50:27" (3/3) ... [2019-10-13 19:50:27,749 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_1.cil-2.c [2019-10-13 19:50:27,759 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:50:27,768 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 19:50:27,780 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 19:50:27,809 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:50:27,809 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:50:27,809 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:50:27,810 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:50:27,810 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:50:27,810 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:50:27,810 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:50:27,810 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:50:27,834 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states. [2019-10-13 19:50:27,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-13 19:50:27,845 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:27,846 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:27,848 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:27,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:27,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1696698376, now seen corresponding path program 1 times [2019-10-13 19:50:27,864 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:27,865 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049389960] [2019-10-13 19:50:27,865 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:27,865 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:27,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:27,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:28,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:28,168 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:50:28,169 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049389960] [2019-10-13 19:50:28,170 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:28,170 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:28,170 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534105378] [2019-10-13 19:50:28,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:28,176 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:28,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:28,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:28,195 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 5 states. [2019-10-13 19:50:28,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:28,669 INFO L93 Difference]: Finished difference Result 345 states and 585 transitions. [2019-10-13 19:50:28,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:28,671 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-10-13 19:50:28,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:28,684 INFO L225 Difference]: With dead ends: 345 [2019-10-13 19:50:28,685 INFO L226 Difference]: Without dead ends: 183 [2019-10-13 19:50:28,689 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:28,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-10-13 19:50:28,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 178. [2019-10-13 19:50:28,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-10-13 19:50:28,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 284 transitions. [2019-10-13 19:50:28,769 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 284 transitions. Word has length 51 [2019-10-13 19:50:28,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:28,772 INFO L462 AbstractCegarLoop]: Abstraction has 178 states and 284 transitions. [2019-10-13 19:50:28,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:28,772 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 284 transitions. [2019-10-13 19:50:28,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-13 19:50:28,776 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:28,777 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:28,779 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:28,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:28,781 INFO L82 PathProgramCache]: Analyzing trace with hash 742008338, now seen corresponding path program 1 times [2019-10-13 19:50:28,781 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:28,781 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442953786] [2019-10-13 19:50:28,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:28,782 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:28,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:28,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:28,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:28,955 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:50:28,956 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442953786] [2019-10-13 19:50:28,956 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:28,957 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:28,957 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137749398] [2019-10-13 19:50:28,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:28,959 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:28,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:28,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:28,960 INFO L87 Difference]: Start difference. First operand 178 states and 284 transitions. Second operand 5 states. [2019-10-13 19:50:29,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:29,251 INFO L93 Difference]: Finished difference Result 391 states and 639 transitions. [2019-10-13 19:50:29,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:29,251 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-10-13 19:50:29,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:29,255 INFO L225 Difference]: With dead ends: 391 [2019-10-13 19:50:29,255 INFO L226 Difference]: Without dead ends: 224 [2019-10-13 19:50:29,257 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:29,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-10-13 19:50:29,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 219. [2019-10-13 19:50:29,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-10-13 19:50:29,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 361 transitions. [2019-10-13 19:50:29,278 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 361 transitions. Word has length 52 [2019-10-13 19:50:29,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:29,279 INFO L462 AbstractCegarLoop]: Abstraction has 219 states and 361 transitions. [2019-10-13 19:50:29,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:29,279 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 361 transitions. [2019-10-13 19:50:29,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-13 19:50:29,282 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:29,283 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:29,283 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:29,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:29,284 INFO L82 PathProgramCache]: Analyzing trace with hash 201696029, now seen corresponding path program 1 times [2019-10-13 19:50:29,284 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:29,284 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655936580] [2019-10-13 19:50:29,285 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:29,285 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:29,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:29,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:29,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:29,418 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:50:29,419 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655936580] [2019-10-13 19:50:29,419 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:29,420 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:29,424 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534489408] [2019-10-13 19:50:29,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:29,426 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:29,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:29,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:29,433 INFO L87 Difference]: Start difference. First operand 219 states and 361 transitions. Second operand 5 states. [2019-10-13 19:50:29,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:29,691 INFO L93 Difference]: Finished difference Result 456 states and 763 transitions. [2019-10-13 19:50:29,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:29,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-10-13 19:50:29,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:29,695 INFO L225 Difference]: With dead ends: 456 [2019-10-13 19:50:29,695 INFO L226 Difference]: Without dead ends: 250 [2019-10-13 19:50:29,697 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:29,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-10-13 19:50:29,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2019-10-13 19:50:29,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-13 19:50:29,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 417 transitions. [2019-10-13 19:50:29,714 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 417 transitions. Word has length 80 [2019-10-13 19:50:29,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:29,715 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 417 transitions. [2019-10-13 19:50:29,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:29,715 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 417 transitions. [2019-10-13 19:50:29,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-13 19:50:29,718 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:29,718 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 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:50:29,719 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:29,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:29,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1556256498, now seen corresponding path program 1 times [2019-10-13 19:50:29,719 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:29,720 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732741220] [2019-10-13 19:50:29,720 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:29,720 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:29,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:29,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:29,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:29,837 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:50:29,837 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732741220] [2019-10-13 19:50:29,838 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:29,838 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:29,838 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241751298] [2019-10-13 19:50:29,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:29,840 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:29,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:29,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:29,841 INFO L87 Difference]: Start difference. First operand 250 states and 417 transitions. Second operand 5 states. [2019-10-13 19:50:30,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:30,081 INFO L93 Difference]: Finished difference Result 533 states and 899 transitions. [2019-10-13 19:50:30,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:30,081 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-10-13 19:50:30,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:30,084 INFO L225 Difference]: With dead ends: 533 [2019-10-13 19:50:30,084 INFO L226 Difference]: Without dead ends: 296 [2019-10-13 19:50:30,085 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:30,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-10-13 19:50:30,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 292. [2019-10-13 19:50:30,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-10-13 19:50:30,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 492 transitions. [2019-10-13 19:50:30,100 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 492 transitions. Word has length 91 [2019-10-13 19:50:30,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:30,101 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 492 transitions. [2019-10-13 19:50:30,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:30,101 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 492 transitions. [2019-10-13 19:50:30,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-13 19:50:30,103 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:30,103 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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:50:30,103 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:30,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:30,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1933322156, now seen corresponding path program 1 times [2019-10-13 19:50:30,104 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:30,104 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622004180] [2019-10-13 19:50:30,104 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:30,104 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:30,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:30,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:30,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:30,181 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:50:30,181 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622004180] [2019-10-13 19:50:30,182 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:30,182 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:30,182 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161003349] [2019-10-13 19:50:30,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:30,183 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:30,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:30,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:30,184 INFO L87 Difference]: Start difference. First operand 292 states and 492 transitions. Second operand 5 states. [2019-10-13 19:50:30,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:30,445 INFO L93 Difference]: Finished difference Result 575 states and 972 transitions. [2019-10-13 19:50:30,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:30,446 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-10-13 19:50:30,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:30,448 INFO L225 Difference]: With dead ends: 575 [2019-10-13 19:50:30,449 INFO L226 Difference]: Without dead ends: 294 [2019-10-13 19:50:30,450 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:30,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-10-13 19:50:30,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 290. [2019-10-13 19:50:30,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-10-13 19:50:30,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 487 transitions. [2019-10-13 19:50:30,464 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 487 transitions. Word has length 92 [2019-10-13 19:50:30,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:30,464 INFO L462 AbstractCegarLoop]: Abstraction has 290 states and 487 transitions. [2019-10-13 19:50:30,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:30,465 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 487 transitions. [2019-10-13 19:50:30,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-13 19:50:30,466 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:30,466 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:30,466 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:30,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:30,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1585840345, now seen corresponding path program 1 times [2019-10-13 19:50:30,467 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:30,467 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377814601] [2019-10-13 19:50:30,467 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:30,468 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:30,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:30,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:30,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:30,545 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-13 19:50:30,545 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377814601] [2019-10-13 19:50:30,546 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:30,546 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:30,547 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407087980] [2019-10-13 19:50:30,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:30,548 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:30,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:30,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:30,550 INFO L87 Difference]: Start difference. First operand 290 states and 487 transitions. Second operand 5 states. [2019-10-13 19:50:30,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:30,733 INFO L93 Difference]: Finished difference Result 584 states and 985 transitions. [2019-10-13 19:50:30,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:30,739 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-10-13 19:50:30,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:30,741 INFO L225 Difference]: With dead ends: 584 [2019-10-13 19:50:30,741 INFO L226 Difference]: Without dead ends: 307 [2019-10-13 19:50:30,744 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:30,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-10-13 19:50:30,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2019-10-13 19:50:30,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-10-13 19:50:30,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 509 transitions. [2019-10-13 19:50:30,762 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 509 transitions. Word has length 92 [2019-10-13 19:50:30,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:30,762 INFO L462 AbstractCegarLoop]: Abstraction has 305 states and 509 transitions. [2019-10-13 19:50:30,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:30,763 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 509 transitions. [2019-10-13 19:50:30,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-13 19:50:30,765 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:30,765 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:30,765 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:30,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:30,765 INFO L82 PathProgramCache]: Analyzing trace with hash 6376232, now seen corresponding path program 1 times [2019-10-13 19:50:30,766 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:30,766 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758967867] [2019-10-13 19:50:30,766 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:30,766 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:30,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:30,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:30,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:30,874 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-13 19:50:30,875 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758967867] [2019-10-13 19:50:30,875 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:30,875 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:30,875 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983686228] [2019-10-13 19:50:30,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:30,877 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:30,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:30,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:30,877 INFO L87 Difference]: Start difference. First operand 305 states and 509 transitions. Second operand 5 states. [2019-10-13 19:50:31,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:31,072 INFO L93 Difference]: Finished difference Result 599 states and 1003 transitions. [2019-10-13 19:50:31,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:31,072 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-10-13 19:50:31,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:31,075 INFO L225 Difference]: With dead ends: 599 [2019-10-13 19:50:31,075 INFO L226 Difference]: Without dead ends: 307 [2019-10-13 19:50:31,076 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:31,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-10-13 19:50:31,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2019-10-13 19:50:31,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-10-13 19:50:31,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 505 transitions. [2019-10-13 19:50:31,089 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 505 transitions. Word has length 93 [2019-10-13 19:50:31,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:31,089 INFO L462 AbstractCegarLoop]: Abstraction has 305 states and 505 transitions. [2019-10-13 19:50:31,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:31,090 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 505 transitions. [2019-10-13 19:50:31,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 19:50:31,091 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:31,091 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:31,092 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:31,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:31,092 INFO L82 PathProgramCache]: Analyzing trace with hash -854791455, now seen corresponding path program 1 times [2019-10-13 19:50:31,092 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:31,092 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664468045] [2019-10-13 19:50:31,093 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:31,093 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:31,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:31,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:31,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:31,145 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-13 19:50:31,146 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664468045] [2019-10-13 19:50:31,146 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:31,146 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:31,147 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529513866] [2019-10-13 19:50:31,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:31,147 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:31,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:31,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:31,148 INFO L87 Difference]: Start difference. First operand 305 states and 505 transitions. Second operand 5 states. [2019-10-13 19:50:31,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:31,326 INFO L93 Difference]: Finished difference Result 606 states and 1005 transitions. [2019-10-13 19:50:31,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:31,326 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-13 19:50:31,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:31,329 INFO L225 Difference]: With dead ends: 606 [2019-10-13 19:50:31,329 INFO L226 Difference]: Without dead ends: 314 [2019-10-13 19:50:31,330 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:31,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-10-13 19:50:31,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2019-10-13 19:50:31,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-10-13 19:50:31,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 511 transitions. [2019-10-13 19:50:31,344 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 511 transitions. Word has length 106 [2019-10-13 19:50:31,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:31,345 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 511 transitions. [2019-10-13 19:50:31,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:31,345 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 511 transitions. [2019-10-13 19:50:31,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 19:50:31,350 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:31,350 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:31,350 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:31,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:31,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1777100668, now seen corresponding path program 1 times [2019-10-13 19:50:31,351 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:31,351 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922037039] [2019-10-13 19:50:31,351 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:31,351 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:31,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:31,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:31,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:31,419 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-13 19:50:31,420 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922037039] [2019-10-13 19:50:31,421 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:31,421 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:31,422 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778179428] [2019-10-13 19:50:31,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:31,423 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:31,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:31,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:31,424 INFO L87 Difference]: Start difference. First operand 314 states and 511 transitions. Second operand 5 states. [2019-10-13 19:50:31,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:31,717 INFO L93 Difference]: Finished difference Result 646 states and 1058 transitions. [2019-10-13 19:50:31,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:31,717 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-13 19:50:31,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:31,721 INFO L225 Difference]: With dead ends: 646 [2019-10-13 19:50:31,722 INFO L226 Difference]: Without dead ends: 345 [2019-10-13 19:50:31,723 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:31,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-10-13 19:50:31,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343. [2019-10-13 19:50:31,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-10-13 19:50:31,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 558 transitions. [2019-10-13 19:50:31,750 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 558 transitions. Word has length 106 [2019-10-13 19:50:31,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:31,753 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 558 transitions. [2019-10-13 19:50:31,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:31,754 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 558 transitions. [2019-10-13 19:50:31,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-13 19:50:31,757 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:31,757 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:31,758 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:31,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:31,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1284309403, now seen corresponding path program 1 times [2019-10-13 19:50:31,759 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:31,759 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283192165] [2019-10-13 19:50:31,759 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:31,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:31,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:31,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:31,880 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-13 19:50:31,881 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283192165] [2019-10-13 19:50:31,881 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:31,882 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:31,882 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173541144] [2019-10-13 19:50:31,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:31,883 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:31,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:31,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:31,884 INFO L87 Difference]: Start difference. First operand 343 states and 558 transitions. Second operand 5 states. [2019-10-13 19:50:32,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:32,096 INFO L93 Difference]: Finished difference Result 675 states and 1101 transitions. [2019-10-13 19:50:32,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:32,097 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-10-13 19:50:32,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:32,099 INFO L225 Difference]: With dead ends: 675 [2019-10-13 19:50:32,100 INFO L226 Difference]: Without dead ends: 345 [2019-10-13 19:50:32,103 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:32,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-10-13 19:50:32,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343. [2019-10-13 19:50:32,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-10-13 19:50:32,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 554 transitions. [2019-10-13 19:50:32,119 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 554 transitions. Word has length 107 [2019-10-13 19:50:32,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:32,119 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 554 transitions. [2019-10-13 19:50:32,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:32,120 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 554 transitions. [2019-10-13 19:50:32,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-13 19:50:32,121 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:32,121 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:32,121 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:32,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:32,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1845761004, now seen corresponding path program 1 times [2019-10-13 19:50:32,123 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:32,123 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117479894] [2019-10-13 19:50:32,123 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:32,123 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:32,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:32,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:32,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:32,185 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-13 19:50:32,186 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117479894] [2019-10-13 19:50:32,186 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:32,186 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:32,186 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792569220] [2019-10-13 19:50:32,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:32,187 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:32,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:32,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:32,188 INFO L87 Difference]: Start difference. First operand 343 states and 554 transitions. Second operand 5 states. [2019-10-13 19:50:32,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:32,379 INFO L93 Difference]: Finished difference Result 708 states and 1151 transitions. [2019-10-13 19:50:32,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:32,380 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2019-10-13 19:50:32,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:32,382 INFO L225 Difference]: With dead ends: 708 [2019-10-13 19:50:32,383 INFO L226 Difference]: Without dead ends: 378 [2019-10-13 19:50:32,384 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:32,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-10-13 19:50:32,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 370. [2019-10-13 19:50:32,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-10-13 19:50:32,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 596 transitions. [2019-10-13 19:50:32,400 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 596 transitions. Word has length 108 [2019-10-13 19:50:32,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:32,400 INFO L462 AbstractCegarLoop]: Abstraction has 370 states and 596 transitions. [2019-10-13 19:50:32,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:32,400 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 596 transitions. [2019-10-13 19:50:32,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-13 19:50:32,402 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:32,402 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:32,403 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:32,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:32,403 INFO L82 PathProgramCache]: Analyzing trace with hash -2036530603, now seen corresponding path program 1 times [2019-10-13 19:50:32,403 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:32,403 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535039898] [2019-10-13 19:50:32,404 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:32,404 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:32,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:32,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:32,462 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-13 19:50:32,463 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535039898] [2019-10-13 19:50:32,463 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:32,463 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:32,463 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128959567] [2019-10-13 19:50:32,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:32,464 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:32,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:32,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:32,465 INFO L87 Difference]: Start difference. First operand 370 states and 596 transitions. Second operand 5 states. [2019-10-13 19:50:32,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:32,680 INFO L93 Difference]: Finished difference Result 735 states and 1188 transitions. [2019-10-13 19:50:32,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:32,681 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-10-13 19:50:32,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:32,684 INFO L225 Difference]: With dead ends: 735 [2019-10-13 19:50:32,684 INFO L226 Difference]: Without dead ends: 378 [2019-10-13 19:50:32,685 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:32,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-10-13 19:50:32,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 370. [2019-10-13 19:50:32,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-10-13 19:50:32,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 591 transitions. [2019-10-13 19:50:32,705 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 591 transitions. Word has length 109 [2019-10-13 19:50:32,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:32,706 INFO L462 AbstractCegarLoop]: Abstraction has 370 states and 591 transitions. [2019-10-13 19:50:32,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:32,706 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 591 transitions. [2019-10-13 19:50:32,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-13 19:50:32,708 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:32,709 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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:50:32,709 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:32,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:32,710 INFO L82 PathProgramCache]: Analyzing trace with hash -346552109, now seen corresponding path program 1 times [2019-10-13 19:50:32,710 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:32,710 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344935795] [2019-10-13 19:50:32,710 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:32,711 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:32,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:32,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:32,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:32,764 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-13 19:50:32,764 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344935795] [2019-10-13 19:50:32,764 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:32,765 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:32,765 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425771772] [2019-10-13 19:50:32,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:32,765 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:32,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:32,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:32,766 INFO L87 Difference]: Start difference. First operand 370 states and 591 transitions. Second operand 5 states. [2019-10-13 19:50:32,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:32,955 INFO L93 Difference]: Finished difference Result 752 states and 1206 transitions. [2019-10-13 19:50:32,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:32,955 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 112 [2019-10-13 19:50:32,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:32,958 INFO L225 Difference]: With dead ends: 752 [2019-10-13 19:50:32,958 INFO L226 Difference]: Without dead ends: 395 [2019-10-13 19:50:32,959 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:32,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-10-13 19:50:32,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 391. [2019-10-13 19:50:32,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-10-13 19:50:32,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 620 transitions. [2019-10-13 19:50:32,978 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 620 transitions. Word has length 112 [2019-10-13 19:50:32,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:32,978 INFO L462 AbstractCegarLoop]: Abstraction has 391 states and 620 transitions. [2019-10-13 19:50:32,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:32,978 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 620 transitions. [2019-10-13 19:50:32,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-13 19:50:32,980 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:32,981 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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:50:32,981 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:32,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:32,981 INFO L82 PathProgramCache]: Analyzing trace with hash 768287860, now seen corresponding path program 1 times [2019-10-13 19:50:32,982 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:32,982 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752112773] [2019-10-13 19:50:32,982 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:32,982 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:32,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:33,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:33,028 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-13 19:50:33,028 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752112773] [2019-10-13 19:50:33,028 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:33,029 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:33,029 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357053601] [2019-10-13 19:50:33,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:33,030 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:33,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:33,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:33,030 INFO L87 Difference]: Start difference. First operand 391 states and 620 transitions. Second operand 5 states. [2019-10-13 19:50:33,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:33,226 INFO L93 Difference]: Finished difference Result 773 states and 1229 transitions. [2019-10-13 19:50:33,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:33,227 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2019-10-13 19:50:33,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:33,229 INFO L225 Difference]: With dead ends: 773 [2019-10-13 19:50:33,230 INFO L226 Difference]: Without dead ends: 395 [2019-10-13 19:50:33,231 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:33,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-10-13 19:50:33,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 391. [2019-10-13 19:50:33,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-10-13 19:50:33,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 614 transitions. [2019-10-13 19:50:33,252 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 614 transitions. Word has length 113 [2019-10-13 19:50:33,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:33,252 INFO L462 AbstractCegarLoop]: Abstraction has 391 states and 614 transitions. [2019-10-13 19:50:33,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:33,252 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 614 transitions. [2019-10-13 19:50:33,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-13 19:50:33,254 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:33,254 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:33,255 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:33,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:33,255 INFO L82 PathProgramCache]: Analyzing trace with hash -105487368, now seen corresponding path program 1 times [2019-10-13 19:50:33,255 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:33,255 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57719135] [2019-10-13 19:50:33,255 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:33,256 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:33,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:33,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:33,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:33,334 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-13 19:50:33,334 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57719135] [2019-10-13 19:50:33,335 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:33,335 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:33,335 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047185614] [2019-10-13 19:50:33,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:33,336 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:33,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:33,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:33,336 INFO L87 Difference]: Start difference. First operand 391 states and 614 transitions. Second operand 3 states. [2019-10-13 19:50:33,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:33,399 INFO L93 Difference]: Finished difference Result 1144 states and 1806 transitions. [2019-10-13 19:50:33,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:33,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-10-13 19:50:33,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:33,404 INFO L225 Difference]: With dead ends: 1144 [2019-10-13 19:50:33,404 INFO L226 Difference]: Without dead ends: 766 [2019-10-13 19:50:33,405 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:50:33,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2019-10-13 19:50:33,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 766. [2019-10-13 19:50:33,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 766 states. [2019-10-13 19:50:33,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1207 transitions. [2019-10-13 19:50:33,437 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1207 transitions. Word has length 128 [2019-10-13 19:50:33,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:33,438 INFO L462 AbstractCegarLoop]: Abstraction has 766 states and 1207 transitions. [2019-10-13 19:50:33,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:33,438 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1207 transitions. [2019-10-13 19:50:33,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-13 19:50:33,440 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:33,441 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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:50:33,441 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:33,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:33,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1228256447, now seen corresponding path program 1 times [2019-10-13 19:50:33,442 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:33,442 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688001853] [2019-10-13 19:50:33,442 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:33,442 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:33,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:33,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:33,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:33,489 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-13 19:50:33,489 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688001853] [2019-10-13 19:50:33,490 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:33,490 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:33,490 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558767028] [2019-10-13 19:50:33,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:33,491 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:33,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:33,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:33,491 INFO L87 Difference]: Start difference. First operand 766 states and 1207 transitions. Second operand 5 states. [2019-10-13 19:50:33,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:33,739 INFO L93 Difference]: Finished difference Result 1603 states and 2533 transitions. [2019-10-13 19:50:33,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:33,740 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 129 [2019-10-13 19:50:33,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:33,744 INFO L225 Difference]: With dead ends: 1603 [2019-10-13 19:50:33,744 INFO L226 Difference]: Without dead ends: 850 [2019-10-13 19:50:33,746 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:33,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2019-10-13 19:50:33,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 842. [2019-10-13 19:50:33,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 842 states. [2019-10-13 19:50:33,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1325 transitions. [2019-10-13 19:50:33,784 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1325 transitions. Word has length 129 [2019-10-13 19:50:33,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:33,784 INFO L462 AbstractCegarLoop]: Abstraction has 842 states and 1325 transitions. [2019-10-13 19:50:33,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:33,785 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1325 transitions. [2019-10-13 19:50:33,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-13 19:50:33,787 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:33,787 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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:50:33,787 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:33,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:33,788 INFO L82 PathProgramCache]: Analyzing trace with hash 998366491, now seen corresponding path program 1 times [2019-10-13 19:50:33,788 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:33,788 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128961316] [2019-10-13 19:50:33,788 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:33,789 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:33,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:33,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:33,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:33,856 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-13 19:50:33,856 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128961316] [2019-10-13 19:50:33,857 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:33,857 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:33,857 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230197912] [2019-10-13 19:50:33,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:33,858 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:33,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:33,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:33,858 INFO L87 Difference]: Start difference. First operand 842 states and 1325 transitions. Second operand 5 states. [2019-10-13 19:50:34,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:34,214 INFO L93 Difference]: Finished difference Result 1679 states and 2645 transitions. [2019-10-13 19:50:34,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:34,215 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2019-10-13 19:50:34,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:34,222 INFO L225 Difference]: With dead ends: 1679 [2019-10-13 19:50:34,222 INFO L226 Difference]: Without dead ends: 846 [2019-10-13 19:50:34,228 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:34,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2019-10-13 19:50:34,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 838. [2019-10-13 19:50:34,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-10-13 19:50:34,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1313 transitions. [2019-10-13 19:50:34,295 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1313 transitions. Word has length 130 [2019-10-13 19:50:34,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:34,295 INFO L462 AbstractCegarLoop]: Abstraction has 838 states and 1313 transitions. [2019-10-13 19:50:34,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:34,295 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1313 transitions. [2019-10-13 19:50:34,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-13 19:50:34,301 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:34,301 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:34,301 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:34,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:34,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1190868920, now seen corresponding path program 1 times [2019-10-13 19:50:34,303 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:34,304 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779311558] [2019-10-13 19:50:34,304 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:34,304 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:34,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:34,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:34,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:34,410 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-10-13 19:50:34,411 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779311558] [2019-10-13 19:50:34,411 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:34,412 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:34,412 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579786817] [2019-10-13 19:50:34,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:34,413 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:34,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:34,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:34,414 INFO L87 Difference]: Start difference. First operand 838 states and 1313 transitions. Second operand 5 states. [2019-10-13 19:50:34,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:34,768 INFO L93 Difference]: Finished difference Result 1739 states and 2729 transitions. [2019-10-13 19:50:34,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:34,769 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 162 [2019-10-13 19:50:34,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:34,776 INFO L225 Difference]: With dead ends: 1739 [2019-10-13 19:50:34,776 INFO L226 Difference]: Without dead ends: 914 [2019-10-13 19:50:34,778 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:34,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2019-10-13 19:50:34,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 910. [2019-10-13 19:50:34,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 910 states. [2019-10-13 19:50:34,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1421 transitions. [2019-10-13 19:50:34,838 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1421 transitions. Word has length 162 [2019-10-13 19:50:34,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:34,839 INFO L462 AbstractCegarLoop]: Abstraction has 910 states and 1421 transitions. [2019-10-13 19:50:34,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:34,839 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1421 transitions. [2019-10-13 19:50:34,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-13 19:50:34,845 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:34,846 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:34,846 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:34,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:34,847 INFO L82 PathProgramCache]: Analyzing trace with hash -618678002, now seen corresponding path program 1 times [2019-10-13 19:50:34,847 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:34,847 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527960179] [2019-10-13 19:50:34,848 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:34,848 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:34,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:34,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:34,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:34,938 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-10-13 19:50:34,938 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527960179] [2019-10-13 19:50:34,939 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:34,939 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:34,939 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711515857] [2019-10-13 19:50:34,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:34,940 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:34,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:34,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:34,942 INFO L87 Difference]: Start difference. First operand 910 states and 1421 transitions. Second operand 5 states. [2019-10-13 19:50:35,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:35,374 INFO L93 Difference]: Finished difference Result 1811 states and 2829 transitions. [2019-10-13 19:50:35,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:35,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 163 [2019-10-13 19:50:35,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:35,381 INFO L225 Difference]: With dead ends: 1811 [2019-10-13 19:50:35,382 INFO L226 Difference]: Without dead ends: 910 [2019-10-13 19:50:35,384 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:35,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2019-10-13 19:50:35,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 906. [2019-10-13 19:50:35,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2019-10-13 19:50:35,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1407 transitions. [2019-10-13 19:50:35,453 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1407 transitions. Word has length 163 [2019-10-13 19:50:35,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:35,454 INFO L462 AbstractCegarLoop]: Abstraction has 906 states and 1407 transitions. [2019-10-13 19:50:35,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:35,454 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1407 transitions. [2019-10-13 19:50:35,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-13 19:50:35,460 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:35,461 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:35,461 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:35,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:35,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1613187866, now seen corresponding path program 1 times [2019-10-13 19:50:35,462 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:35,463 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617289485] [2019-10-13 19:50:35,463 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:35,463 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:35,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:35,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:35,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:35,580 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-10-13 19:50:35,581 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617289485] [2019-10-13 19:50:35,581 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:35,581 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:35,582 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449134449] [2019-10-13 19:50:35,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:35,584 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:35,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:35,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:35,585 INFO L87 Difference]: Start difference. First operand 906 states and 1407 transitions. Second operand 5 states. [2019-10-13 19:50:35,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:35,842 INFO L93 Difference]: Finished difference Result 1871 states and 2909 transitions. [2019-10-13 19:50:35,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:35,843 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 193 [2019-10-13 19:50:35,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:35,848 INFO L225 Difference]: With dead ends: 1871 [2019-10-13 19:50:35,848 INFO L226 Difference]: Without dead ends: 978 [2019-10-13 19:50:35,853 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:35,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2019-10-13 19:50:35,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 974. [2019-10-13 19:50:35,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2019-10-13 19:50:35,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1505 transitions. [2019-10-13 19:50:35,900 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1505 transitions. Word has length 193 [2019-10-13 19:50:35,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:35,900 INFO L462 AbstractCegarLoop]: Abstraction has 974 states and 1505 transitions. [2019-10-13 19:50:35,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:35,901 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1505 transitions. [2019-10-13 19:50:35,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-10-13 19:50:35,904 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:35,905 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:35,905 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:35,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:35,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1368180736, now seen corresponding path program 1 times [2019-10-13 19:50:35,905 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:35,906 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934517592] [2019-10-13 19:50:35,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:35,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:35,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:35,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:35,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:35,971 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-10-13 19:50:35,972 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934517592] [2019-10-13 19:50:35,972 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:35,972 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:35,972 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644116150] [2019-10-13 19:50:35,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:35,974 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:35,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:35,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:35,978 INFO L87 Difference]: Start difference. First operand 974 states and 1505 transitions. Second operand 5 states. [2019-10-13 19:50:36,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:36,271 INFO L93 Difference]: Finished difference Result 1939 states and 2997 transitions. [2019-10-13 19:50:36,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:36,272 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 194 [2019-10-13 19:50:36,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:36,279 INFO L225 Difference]: With dead ends: 1939 [2019-10-13 19:50:36,279 INFO L226 Difference]: Without dead ends: 974 [2019-10-13 19:50:36,282 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:36,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2019-10-13 19:50:36,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 970. [2019-10-13 19:50:36,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2019-10-13 19:50:36,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1489 transitions. [2019-10-13 19:50:36,347 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1489 transitions. Word has length 194 [2019-10-13 19:50:36,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:36,348 INFO L462 AbstractCegarLoop]: Abstraction has 970 states and 1489 transitions. [2019-10-13 19:50:36,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:36,348 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1489 transitions. [2019-10-13 19:50:36,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-13 19:50:36,355 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:36,355 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:36,356 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:36,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:36,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1741358840, now seen corresponding path program 1 times [2019-10-13 19:50:36,356 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:36,357 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880309033] [2019-10-13 19:50:36,357 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:36,357 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:36,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:36,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:36,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:36,488 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-10-13 19:50:36,489 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880309033] [2019-10-13 19:50:36,489 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:36,489 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:36,490 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487531830] [2019-10-13 19:50:36,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:36,491 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:36,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:36,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:36,491 INFO L87 Difference]: Start difference. First operand 970 states and 1489 transitions. Second operand 5 states. [2019-10-13 19:50:36,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:36,730 INFO L93 Difference]: Finished difference Result 2003 states and 3085 transitions. [2019-10-13 19:50:36,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:36,730 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 212 [2019-10-13 19:50:36,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:36,736 INFO L225 Difference]: With dead ends: 2003 [2019-10-13 19:50:36,736 INFO L226 Difference]: Without dead ends: 1046 [2019-10-13 19:50:36,738 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:36,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2019-10-13 19:50:36,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 1020. [2019-10-13 19:50:36,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2019-10-13 19:50:36,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1553 transitions. [2019-10-13 19:50:36,783 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1553 transitions. Word has length 212 [2019-10-13 19:50:36,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:36,783 INFO L462 AbstractCegarLoop]: Abstraction has 1020 states and 1553 transitions. [2019-10-13 19:50:36,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:36,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1553 transitions. [2019-10-13 19:50:36,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-13 19:50:36,787 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:36,787 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:36,788 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:36,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:36,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1179693335, now seen corresponding path program 1 times [2019-10-13 19:50:36,788 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:36,788 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424777706] [2019-10-13 19:50:36,789 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:36,789 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:36,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:36,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:36,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:36,864 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-10-13 19:50:36,865 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424777706] [2019-10-13 19:50:36,865 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:36,865 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:36,865 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347002738] [2019-10-13 19:50:36,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:36,866 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:36,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:36,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:36,867 INFO L87 Difference]: Start difference. First operand 1020 states and 1553 transitions. Second operand 5 states. [2019-10-13 19:50:37,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:37,136 INFO L93 Difference]: Finished difference Result 2053 states and 3131 transitions. [2019-10-13 19:50:37,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:37,136 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 213 [2019-10-13 19:50:37,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:37,142 INFO L225 Difference]: With dead ends: 2053 [2019-10-13 19:50:37,142 INFO L226 Difference]: Without dead ends: 1046 [2019-10-13 19:50:37,144 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:37,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2019-10-13 19:50:37,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 1020. [2019-10-13 19:50:37,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2019-10-13 19:50:37,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1535 transitions. [2019-10-13 19:50:37,189 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1535 transitions. Word has length 213 [2019-10-13 19:50:37,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:37,190 INFO L462 AbstractCegarLoop]: Abstraction has 1020 states and 1535 transitions. [2019-10-13 19:50:37,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:37,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1535 transitions. [2019-10-13 19:50:37,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-10-13 19:50:37,194 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:37,194 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:37,195 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:37,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:37,195 INFO L82 PathProgramCache]: Analyzing trace with hash 2078256648, now seen corresponding path program 1 times [2019-10-13 19:50:37,195 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:37,196 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587250576] [2019-10-13 19:50:37,196 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:37,196 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:37,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:37,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:37,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:37,274 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-10-13 19:50:37,275 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587250576] [2019-10-13 19:50:37,275 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:37,275 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:37,276 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358429839] [2019-10-13 19:50:37,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:37,276 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:37,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:37,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:37,277 INFO L87 Difference]: Start difference. First operand 1020 states and 1535 transitions. Second operand 5 states. [2019-10-13 19:50:37,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:37,536 INFO L93 Difference]: Finished difference Result 2035 states and 3063 transitions. [2019-10-13 19:50:37,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:37,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 224 [2019-10-13 19:50:37,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:37,544 INFO L225 Difference]: With dead ends: 2035 [2019-10-13 19:50:37,544 INFO L226 Difference]: Without dead ends: 1028 [2019-10-13 19:50:37,548 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:37,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2019-10-13 19:50:37,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 1020. [2019-10-13 19:50:37,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2019-10-13 19:50:37,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1523 transitions. [2019-10-13 19:50:37,604 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1523 transitions. Word has length 224 [2019-10-13 19:50:37,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:37,604 INFO L462 AbstractCegarLoop]: Abstraction has 1020 states and 1523 transitions. [2019-10-13 19:50:37,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:37,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1523 transitions. [2019-10-13 19:50:37,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-10-13 19:50:37,610 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:37,610 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:37,610 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:37,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:37,611 INFO L82 PathProgramCache]: Analyzing trace with hash -836415730, now seen corresponding path program 1 times [2019-10-13 19:50:37,611 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:37,611 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242235578] [2019-10-13 19:50:37,611 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:37,612 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:37,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:37,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:37,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:37,736 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-10-13 19:50:37,736 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242235578] [2019-10-13 19:50:37,737 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:37,737 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:37,738 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789382729] [2019-10-13 19:50:37,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:37,739 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:37,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:37,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:37,739 INFO L87 Difference]: Start difference. First operand 1020 states and 1523 transitions. Second operand 5 states. [2019-10-13 19:50:37,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:37,997 INFO L93 Difference]: Finished difference Result 2035 states and 3039 transitions. [2019-10-13 19:50:37,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:37,998 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 225 [2019-10-13 19:50:37,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:38,003 INFO L225 Difference]: With dead ends: 2035 [2019-10-13 19:50:38,003 INFO L226 Difference]: Without dead ends: 1010 [2019-10-13 19:50:38,006 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:38,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2019-10-13 19:50:38,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 1002. [2019-10-13 19:50:38,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1002 states. [2019-10-13 19:50:38,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1485 transitions. [2019-10-13 19:50:38,048 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1485 transitions. Word has length 225 [2019-10-13 19:50:38,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:38,048 INFO L462 AbstractCegarLoop]: Abstraction has 1002 states and 1485 transitions. [2019-10-13 19:50:38,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:38,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1485 transitions. [2019-10-13 19:50:38,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-10-13 19:50:38,053 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:38,053 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:38,054 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:38,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:38,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1494389851, now seen corresponding path program 1 times [2019-10-13 19:50:38,054 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:38,054 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686832610] [2019-10-13 19:50:38,055 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:38,055 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:38,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:38,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:38,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:38,137 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-10-13 19:50:38,137 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686832610] [2019-10-13 19:50:38,138 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:38,138 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:38,138 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613406520] [2019-10-13 19:50:38,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:38,139 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:38,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:38,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:38,139 INFO L87 Difference]: Start difference. First operand 1002 states and 1485 transitions. Second operand 5 states. [2019-10-13 19:50:38,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:38,357 INFO L93 Difference]: Finished difference Result 2045 states and 3037 transitions. [2019-10-13 19:50:38,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:38,358 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 233 [2019-10-13 19:50:38,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:38,363 INFO L225 Difference]: With dead ends: 2045 [2019-10-13 19:50:38,363 INFO L226 Difference]: Without dead ends: 1056 [2019-10-13 19:50:38,365 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:38,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2019-10-13 19:50:38,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 1048. [2019-10-13 19:50:38,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2019-10-13 19:50:38,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1539 transitions. [2019-10-13 19:50:38,413 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1539 transitions. Word has length 233 [2019-10-13 19:50:38,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:38,413 INFO L462 AbstractCegarLoop]: Abstraction has 1048 states and 1539 transitions. [2019-10-13 19:50:38,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:38,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1539 transitions. [2019-10-13 19:50:38,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-10-13 19:50:38,417 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:38,418 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:38,418 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:38,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:38,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1829546886, now seen corresponding path program 1 times [2019-10-13 19:50:38,419 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:38,419 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630355249] [2019-10-13 19:50:38,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:38,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:38,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:38,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:38,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:38,517 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-10-13 19:50:38,517 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630355249] [2019-10-13 19:50:38,518 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:38,518 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:38,519 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31104664] [2019-10-13 19:50:38,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:38,520 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:38,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:38,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:38,521 INFO L87 Difference]: Start difference. First operand 1048 states and 1539 transitions. Second operand 5 states. [2019-10-13 19:50:38,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:38,807 INFO L93 Difference]: Finished difference Result 2091 states and 3071 transitions. [2019-10-13 19:50:38,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:38,807 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 234 [2019-10-13 19:50:38,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:38,812 INFO L225 Difference]: With dead ends: 2091 [2019-10-13 19:50:38,813 INFO L226 Difference]: Without dead ends: 1048 [2019-10-13 19:50:38,815 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:38,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2019-10-13 19:50:38,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 1040. [2019-10-13 19:50:38,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1040 states. [2019-10-13 19:50:38,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1507 transitions. [2019-10-13 19:50:38,867 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1507 transitions. Word has length 234 [2019-10-13 19:50:38,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:38,867 INFO L462 AbstractCegarLoop]: Abstraction has 1040 states and 1507 transitions. [2019-10-13 19:50:38,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:38,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1507 transitions. [2019-10-13 19:50:38,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-10-13 19:50:38,873 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:38,873 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:38,874 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:38,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:38,874 INFO L82 PathProgramCache]: Analyzing trace with hash 678328095, now seen corresponding path program 1 times [2019-10-13 19:50:38,874 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:38,875 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995584560] [2019-10-13 19:50:38,875 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:38,875 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:38,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:38,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:38,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:38,970 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 466 proven. 26 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-10-13 19:50:38,970 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995584560] [2019-10-13 19:50:38,970 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723623675] [2019-10-13 19:50:38,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:50:39,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:39,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 19:50:39,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:50:39,249 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-10-13 19:50:39,249 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:50:39,250 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-13 19:50:39,250 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901898153] [2019-10-13 19:50:39,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:39,251 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:39,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:39,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:39,251 INFO L87 Difference]: Start difference. First operand 1040 states and 1507 transitions. Second operand 3 states. [2019-10-13 19:50:39,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:39,370 INFO L93 Difference]: Finished difference Result 2579 states and 3740 transitions. [2019-10-13 19:50:39,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:39,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 270 [2019-10-13 19:50:39,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:39,378 INFO L225 Difference]: With dead ends: 2579 [2019-10-13 19:50:39,379 INFO L226 Difference]: Without dead ends: 1552 [2019-10-13 19:50:39,381 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:39,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2019-10-13 19:50:39,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1552. [2019-10-13 19:50:39,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1552 states. [2019-10-13 19:50:39,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 2249 transitions. [2019-10-13 19:50:39,498 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 2249 transitions. Word has length 270 [2019-10-13 19:50:39,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:39,499 INFO L462 AbstractCegarLoop]: Abstraction has 1552 states and 2249 transitions. [2019-10-13 19:50:39,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:39,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 2249 transitions. [2019-10-13 19:50:39,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-10-13 19:50:39,504 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:39,504 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:39,711 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:50:39,711 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:39,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:39,712 INFO L82 PathProgramCache]: Analyzing trace with hash -230386138, now seen corresponding path program 1 times [2019-10-13 19:50:39,712 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:39,713 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182217099] [2019-10-13 19:50:39,713 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:39,713 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:39,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:39,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:39,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:39,913 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 430 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-10-13 19:50:39,913 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182217099] [2019-10-13 19:50:39,914 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:39,914 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:39,914 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146865810] [2019-10-13 19:50:39,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:39,915 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:39,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:39,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:39,916 INFO L87 Difference]: Start difference. First operand 1552 states and 2249 transitions. Second operand 3 states. [2019-10-13 19:50:40,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:40,054 INFO L93 Difference]: Finished difference Result 4547 states and 6592 transitions. [2019-10-13 19:50:40,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:40,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 278 [2019-10-13 19:50:40,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:40,069 INFO L225 Difference]: With dead ends: 4547 [2019-10-13 19:50:40,070 INFO L226 Difference]: Without dead ends: 3008 [2019-10-13 19:50:40,075 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:50:40,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2019-10-13 19:50:40,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 3007. [2019-10-13 19:50:40,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3007 states. [2019-10-13 19:50:40,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3007 states to 3007 states and 4350 transitions. [2019-10-13 19:50:40,263 INFO L78 Accepts]: Start accepts. Automaton has 3007 states and 4350 transitions. Word has length 278 [2019-10-13 19:50:40,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:40,264 INFO L462 AbstractCegarLoop]: Abstraction has 3007 states and 4350 transitions. [2019-10-13 19:50:40,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:40,264 INFO L276 IsEmpty]: Start isEmpty. Operand 3007 states and 4350 transitions. [2019-10-13 19:50:40,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-10-13 19:50:40,282 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:40,282 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:40,283 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:40,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:40,283 INFO L82 PathProgramCache]: Analyzing trace with hash -860287162, now seen corresponding path program 1 times [2019-10-13 19:50:40,285 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:40,285 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978446048] [2019-10-13 19:50:40,285 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:40,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:40,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:40,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:40,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:40,569 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 536 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-10-13 19:50:40,569 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978446048] [2019-10-13 19:50:40,570 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:40,570 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:40,570 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304080861] [2019-10-13 19:50:40,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:40,571 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:40,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:40,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:40,572 INFO L87 Difference]: Start difference. First operand 3007 states and 4350 transitions. Second operand 3 states. [2019-10-13 19:50:40,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:40,985 INFO L93 Difference]: Finished difference Result 6121 states and 8875 transitions. [2019-10-13 19:50:40,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:40,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 315 [2019-10-13 19:50:40,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:41,000 INFO L225 Difference]: With dead ends: 6121 [2019-10-13 19:50:41,000 INFO L226 Difference]: Without dead ends: 2006 [2019-10-13 19:50:41,011 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:50:41,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2006 states. [2019-10-13 19:50:41,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2006 to 1986. [2019-10-13 19:50:41,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1986 states. [2019-10-13 19:50:41,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1986 states to 1986 states and 2824 transitions. [2019-10-13 19:50:41,162 INFO L78 Accepts]: Start accepts. Automaton has 1986 states and 2824 transitions. Word has length 315 [2019-10-13 19:50:41,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:41,163 INFO L462 AbstractCegarLoop]: Abstraction has 1986 states and 2824 transitions. [2019-10-13 19:50:41,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:41,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1986 states and 2824 transitions. [2019-10-13 19:50:41,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-10-13 19:50:41,170 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:41,171 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:41,171 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:41,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:41,172 INFO L82 PathProgramCache]: Analyzing trace with hash 2044603392, now seen corresponding path program 1 times [2019-10-13 19:50:41,172 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:41,172 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336826250] [2019-10-13 19:50:41,173 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:41,173 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:41,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:41,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:41,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:41,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1398 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2019-10-13 19:50:41,437 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336826250] [2019-10-13 19:50:41,443 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892542462] [2019-10-13 19:50:41,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:50:41,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:41,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:50:41,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:50:41,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1398 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 904 trivial. 0 not checked. [2019-10-13 19:50:41,880 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:50:41,880 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-13 19:50:41,883 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308064202] [2019-10-13 19:50:41,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:41,885 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:41,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:41,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:41,885 INFO L87 Difference]: Start difference. First operand 1986 states and 2824 transitions. Second operand 3 states. [2019-10-13 19:50:42,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:42,020 INFO L93 Difference]: Finished difference Result 4612 states and 6551 transitions. [2019-10-13 19:50:42,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:42,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 382 [2019-10-13 19:50:42,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:42,046 INFO L225 Difference]: With dead ends: 4612 [2019-10-13 19:50:42,046 INFO L226 Difference]: Without dead ends: 2639 [2019-10-13 19:50:42,054 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:42,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2639 states. [2019-10-13 19:50:42,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2639 to 2639. [2019-10-13 19:50:42,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2639 states. [2019-10-13 19:50:42,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2639 states and 3738 transitions. [2019-10-13 19:50:42,185 INFO L78 Accepts]: Start accepts. Automaton has 2639 states and 3738 transitions. Word has length 382 [2019-10-13 19:50:42,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:42,186 INFO L462 AbstractCegarLoop]: Abstraction has 2639 states and 3738 transitions. [2019-10-13 19:50:42,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:42,186 INFO L276 IsEmpty]: Start isEmpty. Operand 2639 states and 3738 transitions. [2019-10-13 19:50:42,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2019-10-13 19:50:42,193 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:42,194 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:42,398 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:50:42,398 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:42,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:42,400 INFO L82 PathProgramCache]: Analyzing trace with hash 134700959, now seen corresponding path program 1 times [2019-10-13 19:50:42,400 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:42,400 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547977055] [2019-10-13 19:50:42,401 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:42,401 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:42,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:42,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:42,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:42,752 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-10-13 19:50:42,753 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547977055] [2019-10-13 19:50:42,753 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709389729] [2019-10-13 19:50:42,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:50:42,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:42,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:50:42,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:50:43,131 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 867 proven. 0 refuted. 0 times theorem prover too weak. 1155 trivial. 0 not checked. [2019-10-13 19:50:43,131 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:50:43,132 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-13 19:50:43,132 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228846549] [2019-10-13 19:50:43,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:43,133 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:43,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:43,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:43,133 INFO L87 Difference]: Start difference. First operand 2639 states and 3738 transitions. Second operand 3 states. [2019-10-13 19:50:43,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:43,262 INFO L93 Difference]: Finished difference Result 2700 states and 3825 transitions. [2019-10-13 19:50:43,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:43,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 453 [2019-10-13 19:50:43,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:43,273 INFO L225 Difference]: With dead ends: 2700 [2019-10-13 19:50:43,273 INFO L226 Difference]: Without dead ends: 2106 [2019-10-13 19:50:43,275 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 455 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:43,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2106 states. [2019-10-13 19:50:43,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2106 to 2048. [2019-10-13 19:50:43,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2048 states. [2019-10-13 19:50:43,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 2048 states and 2908 transitions. [2019-10-13 19:50:43,398 INFO L78 Accepts]: Start accepts. Automaton has 2048 states and 2908 transitions. Word has length 453 [2019-10-13 19:50:43,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:43,399 INFO L462 AbstractCegarLoop]: Abstraction has 2048 states and 2908 transitions. [2019-10-13 19:50:43,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:43,399 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 2908 transitions. [2019-10-13 19:50:43,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2019-10-13 19:50:43,408 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:43,408 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:43,620 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:50:43,621 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:43,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:43,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1776341599, now seen corresponding path program 1 times [2019-10-13 19:50:43,622 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:43,622 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074651427] [2019-10-13 19:50:43,623 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:43,623 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:43,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:43,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:43,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-10-13 19:50:43,799 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074651427] [2019-10-13 19:50:43,799 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957686833] [2019-10-13 19:50:43,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:50:43,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:43,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:50:43,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:50:44,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-10-13 19:50:44,073 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:50:44,073 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-13 19:50:44,073 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508753012] [2019-10-13 19:50:44,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:50:44,074 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:44,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:50:44,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:50:44,075 INFO L87 Difference]: Start difference. First operand 2048 states and 2908 transitions. Second operand 4 states. [2019-10-13 19:50:44,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:44,488 INFO L93 Difference]: Finished difference Result 4236 states and 6005 transitions. [2019-10-13 19:50:44,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:44,488 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 453 [2019-10-13 19:50:44,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:44,494 INFO L225 Difference]: With dead ends: 4236 [2019-10-13 19:50:44,494 INFO L226 Difference]: Without dead ends: 2157 [2019-10-13 19:50:44,498 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 457 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:44,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2157 states. [2019-10-13 19:50:44,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2157 to 1910. [2019-10-13 19:50:44,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1910 states. [2019-10-13 19:50:44,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 2609 transitions. [2019-10-13 19:50:44,583 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 2609 transitions. Word has length 453 [2019-10-13 19:50:44,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:44,584 INFO L462 AbstractCegarLoop]: Abstraction has 1910 states and 2609 transitions. [2019-10-13 19:50:44,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:50:44,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 2609 transitions. [2019-10-13 19:50:44,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 855 [2019-10-13 19:50:44,595 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:44,595 INFO L380 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 24, 24, 23, 23, 22, 22, 21, 21, 21, 21, 18, 15, 15, 12, 12, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:44,807 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:50:44,808 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:44,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:44,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1812552048, now seen corresponding path program 1 times [2019-10-13 19:50:44,808 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:44,808 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869198308] [2019-10-13 19:50:44,809 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:44,809 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:44,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:44,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:44,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:45,228 INFO L134 CoverageAnalysis]: Checked inductivity of 8111 backedges. 4746 proven. 26 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2019-10-13 19:50:45,229 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869198308] [2019-10-13 19:50:45,229 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748339615] [2019-10-13 19:50:45,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:50:45,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:45,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 1301 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:50:45,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:50:45,758 INFO L134 CoverageAnalysis]: Checked inductivity of 8111 backedges. 4746 proven. 26 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2019-10-13 19:50:45,759 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:50:45,759 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-13 19:50:45,759 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706884258] [2019-10-13 19:50:45,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:50:45,760 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:45,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:50:45,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:50:45,761 INFO L87 Difference]: Start difference. First operand 1910 states and 2609 transitions. Second operand 4 states. [2019-10-13 19:50:46,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:46,112 INFO L93 Difference]: Finished difference Result 4572 states and 6296 transitions. [2019-10-13 19:50:46,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:50:46,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 854 [2019-10-13 19:50:46,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:46,119 INFO L225 Difference]: With dead ends: 4572 [2019-10-13 19:50:46,120 INFO L226 Difference]: Without dead ends: 2540 [2019-10-13 19:50:46,124 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 861 GetRequests, 858 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:46,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2540 states. [2019-10-13 19:50:46,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2540 to 1910. [2019-10-13 19:50:46,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1910 states. [2019-10-13 19:50:46,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 2609 transitions. [2019-10-13 19:50:46,209 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 2609 transitions. Word has length 854 [2019-10-13 19:50:46,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:46,210 INFO L462 AbstractCegarLoop]: Abstraction has 1910 states and 2609 transitions. [2019-10-13 19:50:46,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:50:46,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 2609 transitions. [2019-10-13 19:50:46,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1036 [2019-10-13 19:50:46,223 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:46,223 INFO L380 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 34, 34, 32, 32, 32, 29, 29, 26, 26, 23, 23, 20, 20, 20, 20, 17, 14, 14, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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:50:46,429 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:50:46,429 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:46,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:46,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1607522492, now seen corresponding path program 1 times [2019-10-13 19:50:46,430 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:46,430 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828846795] [2019-10-13 19:50:46,430 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:46,431 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:46,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:46,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:46,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:47,098 INFO L134 CoverageAnalysis]: Checked inductivity of 12523 backedges. 5859 proven. 0 refuted. 0 times theorem prover too weak. 6664 trivial. 0 not checked. [2019-10-13 19:50:47,098 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828846795] [2019-10-13 19:50:47,099 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:47,099 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:47,099 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421790953] [2019-10-13 19:50:47,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:47,100 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:47,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:47,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:47,101 INFO L87 Difference]: Start difference. First operand 1910 states and 2609 transitions. Second operand 3 states. [2019-10-13 19:50:47,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:47,388 INFO L93 Difference]: Finished difference Result 3841 states and 5240 transitions. [2019-10-13 19:50:47,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:47,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1035 [2019-10-13 19:50:47,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:47,394 INFO L225 Difference]: With dead ends: 3841 [2019-10-13 19:50:47,394 INFO L226 Difference]: Without dead ends: 1950 [2019-10-13 19:50:47,398 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:50:47,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2019-10-13 19:50:47,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1910. [2019-10-13 19:50:47,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1910 states. [2019-10-13 19:50:47,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 2589 transitions. [2019-10-13 19:50:47,477 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 2589 transitions. Word has length 1035 [2019-10-13 19:50:47,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:47,481 INFO L462 AbstractCegarLoop]: Abstraction has 1910 states and 2589 transitions. [2019-10-13 19:50:47,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:47,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 2589 transitions. [2019-10-13 19:50:47,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1051 [2019-10-13 19:50:47,494 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:47,494 INFO L380 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 35, 35, 35, 35, 35, 35, 35, 32, 32, 32, 29, 29, 26, 26, 23, 23, 20, 20, 20, 20, 17, 14, 14, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:47,495 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:47,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:47,495 INFO L82 PathProgramCache]: Analyzing trace with hash 123556935, now seen corresponding path program 1 times [2019-10-13 19:50:47,495 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:47,496 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677307808] [2019-10-13 19:50:47,496 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:47,496 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:47,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:47,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:48,167 INFO L134 CoverageAnalysis]: Checked inductivity of 12731 backedges. 5768 proven. 0 refuted. 0 times theorem prover too weak. 6963 trivial. 0 not checked. [2019-10-13 19:50:48,168 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677307808] [2019-10-13 19:50:48,168 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:48,168 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:48,168 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477324897] [2019-10-13 19:50:48,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:48,169 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:48,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:48,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:48,170 INFO L87 Difference]: Start difference. First operand 1910 states and 2589 transitions. Second operand 3 states. [2019-10-13 19:50:48,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:48,436 INFO L93 Difference]: Finished difference Result 3818 states and 5174 transitions. [2019-10-13 19:50:48,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:48,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1050 [2019-10-13 19:50:48,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:48,441 INFO L225 Difference]: With dead ends: 3818 [2019-10-13 19:50:48,441 INFO L226 Difference]: Without dead ends: 1927 [2019-10-13 19:50:48,445 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:50:48,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1927 states. [2019-10-13 19:50:48,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1927 to 1910. [2019-10-13 19:50:48,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1910 states. [2019-10-13 19:50:48,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 2549 transitions. [2019-10-13 19:50:48,522 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 2549 transitions. Word has length 1050 [2019-10-13 19:50:48,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:48,523 INFO L462 AbstractCegarLoop]: Abstraction has 1910 states and 2549 transitions. [2019-10-13 19:50:48,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:48,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 2549 transitions. [2019-10-13 19:50:48,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1079 [2019-10-13 19:50:48,535 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:48,535 INFO L380 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 35, 35, 33, 33, 33, 30, 30, 27, 27, 24, 24, 21, 21, 21, 21, 18, 15, 15, 12, 12, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:48,536 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:48,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:48,536 INFO L82 PathProgramCache]: Analyzing trace with hash 860689758, now seen corresponding path program 1 times [2019-10-13 19:50:48,537 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:48,537 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708307845] [2019-10-13 19:50:48,537 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:48,537 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:48,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:48,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:48,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:49,072 INFO L134 CoverageAnalysis]: Checked inductivity of 13413 backedges. 6481 proven. 0 refuted. 0 times theorem prover too weak. 6932 trivial. 0 not checked. [2019-10-13 19:50:49,073 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708307845] [2019-10-13 19:50:49,073 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:49,073 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:49,073 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706545715] [2019-10-13 19:50:49,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:49,074 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:49,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:49,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:49,074 INFO L87 Difference]: Start difference. First operand 1910 states and 2549 transitions. Second operand 3 states. [2019-10-13 19:50:49,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:49,305 INFO L93 Difference]: Finished difference Result 3871 states and 5171 transitions. [2019-10-13 19:50:49,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:49,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1078 [2019-10-13 19:50:49,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:49,313 INFO L225 Difference]: With dead ends: 3871 [2019-10-13 19:50:49,313 INFO L226 Difference]: Without dead ends: 1962 [2019-10-13 19:50:49,317 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:50:49,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2019-10-13 19:50:49,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1952. [2019-10-13 19:50:49,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1952 states. [2019-10-13 19:50:49,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 2597 transitions. [2019-10-13 19:50:49,398 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 2597 transitions. Word has length 1078 [2019-10-13 19:50:49,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:49,399 INFO L462 AbstractCegarLoop]: Abstraction has 1952 states and 2597 transitions. [2019-10-13 19:50:49,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:49,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 2597 transitions. [2019-10-13 19:50:49,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1111 [2019-10-13 19:50:49,412 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:49,413 INFO L380 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 37, 36, 36, 36, 36, 36, 36, 33, 33, 33, 30, 30, 27, 27, 24, 24, 21, 21, 21, 21, 18, 15, 15, 12, 12, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:49,413 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:49,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:49,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1775510994, now seen corresponding path program 1 times [2019-10-13 19:50:49,414 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:49,414 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670954536] [2019-10-13 19:50:49,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:49,415 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:49,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:49,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:49,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:49,954 INFO L134 CoverageAnalysis]: Checked inductivity of 13929 backedges. 6521 proven. 0 refuted. 0 times theorem prover too weak. 7408 trivial. 0 not checked. [2019-10-13 19:50:49,955 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670954536] [2019-10-13 19:50:49,955 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:49,955 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:49,955 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444121476] [2019-10-13 19:50:49,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:49,957 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:49,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:49,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:49,957 INFO L87 Difference]: Start difference. First operand 1952 states and 2597 transitions. Second operand 3 states. [2019-10-13 19:50:50,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:50,137 INFO L93 Difference]: Finished difference Result 2520 states and 3342 transitions. [2019-10-13 19:50:50,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:50,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1110 [2019-10-13 19:50:50,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:50,139 INFO L225 Difference]: With dead ends: 2520 [2019-10-13 19:50:50,139 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 19:50:50,146 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:50:50,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 19:50:50,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 19:50:50,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 19:50:50,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 19:50:50,147 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1110 [2019-10-13 19:50:50,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:50,147 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 19:50:50,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:50,147 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 19:50:50,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 19:50:50,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 19:50:50,275 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 153 [2019-10-13 19:50:50,946 WARN L191 SmtUtils]: Spent 565.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 183 [2019-10-13 19:50:51,616 WARN L191 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 180 [2019-10-13 19:50:51,921 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 162 [2019-10-13 19:50:53,379 WARN L191 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 151 DAG size of output: 117 [2019-10-13 19:50:54,768 WARN L191 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 151 DAG size of output: 117 [2019-10-13 19:50:55,832 WARN L191 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 144 DAG size of output: 118 [2019-10-13 19:50:57,932 WARN L191 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 175 DAG size of output: 107