/usr/bin/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/loop-invgen/heapsort.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 21:22:28,663 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 21:22:28,666 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 21:22:28,684 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 21:22:28,685 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 21:22:28,686 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 21:22:28,687 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 21:22:28,689 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 21:22:28,691 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 21:22:28,691 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 21:22:28,692 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 21:22:28,693 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 21:22:28,694 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 21:22:28,695 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 21:22:28,696 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 21:22:28,697 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 21:22:28,697 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 21:22:28,698 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 21:22:28,700 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 21:22:28,702 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 21:22:28,703 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 21:22:28,704 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 21:22:28,705 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 21:22:28,706 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 21:22:28,708 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 21:22:28,708 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 21:22:28,709 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 21:22:28,709 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 21:22:28,710 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 21:22:28,711 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 21:22:28,711 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 21:22:28,712 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 21:22:28,712 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 21:22:28,713 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 21:22:28,714 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 21:22:28,714 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 21:22:28,715 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 21:22:28,715 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 21:22:28,715 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 21:22:28,716 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 21:22:28,717 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 21:22:28,718 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-11-06 21:22:28,735 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 21:22:28,735 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 21:22:28,736 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 21:22:28,738 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 21:22:28,738 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 21:22:28,739 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 21:22:28,739 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 21:22:28,739 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 21:22:28,739 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 21:22:28,739 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 21:22:28,740 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 21:22:28,740 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 21:22:28,741 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 21:22:28,741 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 21:22:28,741 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 21:22:28,741 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 21:22:28,742 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 21:22:28,742 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 21:22:28,742 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 21:22:28,742 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 21:22:28,743 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 21:22:28,743 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 21:22:28,743 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 21:22:28,744 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 21:22:28,744 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 21:22:28,744 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 21:22:28,744 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 21:22:28,744 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 21:22:28,745 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 21:22:29,002 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 21:22:29,016 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 21:22:29,019 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 21:22:29,021 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 21:22:29,021 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 21:22:29,022 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/heapsort.i [2019-11-06 21:22:29,089 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6254ee4f/983a7f3c26454183af702a04903f651f/FLAG07904bed8 [2019-11-06 21:22:29,540 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 21:22:29,541 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/heapsort.i [2019-11-06 21:22:29,547 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6254ee4f/983a7f3c26454183af702a04903f651f/FLAG07904bed8 [2019-11-06 21:22:29,955 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6254ee4f/983a7f3c26454183af702a04903f651f [2019-11-06 21:22:29,965 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 21:22:29,968 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 21:22:29,969 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 21:22:29,969 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 21:22:29,975 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 21:22:29,976 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:22:29" (1/1) ... [2019-11-06 21:22:29,979 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48496e02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:29, skipping insertion in model container [2019-11-06 21:22:29,979 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:22:29" (1/1) ... [2019-11-06 21:22:29,988 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 21:22:30,012 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 21:22:30,204 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:22:30,208 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 21:22:30,227 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:22:30,239 INFO L192 MainTranslator]: Completed translation [2019-11-06 21:22:30,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:30 WrapperNode [2019-11-06 21:22:30,240 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 21:22:30,241 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 21:22:30,241 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 21:22:30,241 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 21:22:30,328 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:30" (1/1) ... [2019-11-06 21:22:30,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:30" (1/1) ... [2019-11-06 21:22:30,334 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:30" (1/1) ... [2019-11-06 21:22:30,334 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:30" (1/1) ... [2019-11-06 21:22:30,339 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:30" (1/1) ... [2019-11-06 21:22:30,348 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:30" (1/1) ... [2019-11-06 21:22:30,349 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:30" (1/1) ... [2019-11-06 21:22:30,351 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 21:22:30,357 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 21:22:30,357 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 21:22:30,357 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 21:22:30,358 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:30" (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-11-06 21:22:30,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 21:22:30,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 21:22:30,414 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-06 21:22:30,414 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 21:22:30,414 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 21:22:30,414 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-06 21:22:30,414 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-06 21:22:30,415 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 21:22:30,415 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 21:22:30,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 21:22:30,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 21:22:30,708 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 21:22:30,708 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-06 21:22:30,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:22:30 BoogieIcfgContainer [2019-11-06 21:22:30,710 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 21:22:30,711 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 21:22:30,711 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 21:22:30,714 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 21:22:30,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:22:29" (1/3) ... [2019-11-06 21:22:30,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24340aec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:22:30, skipping insertion in model container [2019-11-06 21:22:30,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:30" (2/3) ... [2019-11-06 21:22:30,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24340aec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:22:30, skipping insertion in model container [2019-11-06 21:22:30,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:22:30" (3/3) ... [2019-11-06 21:22:30,717 INFO L109 eAbstractionObserver]: Analyzing ICFG heapsort.i [2019-11-06 21:22:30,736 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 21:22:30,745 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 21:22:30,758 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 21:22:30,788 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 21:22:30,788 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 21:22:30,790 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 21:22:30,790 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 21:22:30,790 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 21:22:30,790 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 21:22:30,790 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 21:22:30,790 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 21:22:30,815 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2019-11-06 21:22:30,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-06 21:22:30,823 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:30,824 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:30,826 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:30,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:30,831 INFO L82 PathProgramCache]: Analyzing trace with hash 648615897, now seen corresponding path program 1 times [2019-11-06 21:22:30,839 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:30,839 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881737639] [2019-11-06 21:22:30,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:30,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:31,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:31,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:22:31,057 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881737639] [2019-11-06 21:22:31,058 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:31,058 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 21:22:31,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126991380] [2019-11-06 21:22:31,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 21:22:31,064 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:31,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 21:22:31,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 21:22:31,077 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 5 states. [2019-11-06 21:22:31,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:31,237 INFO L93 Difference]: Finished difference Result 83 states and 141 transitions. [2019-11-06 21:22:31,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:22:31,239 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-06 21:22:31,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:31,251 INFO L225 Difference]: With dead ends: 83 [2019-11-06 21:22:31,251 INFO L226 Difference]: Without dead ends: 42 [2019-11-06 21:22:31,256 INFO L630 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-11-06 21:22:31,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-06 21:22:31,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-11-06 21:22:31,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-06 21:22:31,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2019-11-06 21:22:31,313 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 60 transitions. Word has length 14 [2019-11-06 21:22:31,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:31,314 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 60 transitions. [2019-11-06 21:22:31,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 21:22:31,314 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 60 transitions. [2019-11-06 21:22:31,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-06 21:22:31,315 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:31,316 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:31,316 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:31,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:31,317 INFO L82 PathProgramCache]: Analyzing trace with hash 653352666, now seen corresponding path program 1 times [2019-11-06 21:22:31,319 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:31,319 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317487847] [2019-11-06 21:22:31,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:31,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:31,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:31,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:22:31,421 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317487847] [2019-11-06 21:22:31,421 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:31,422 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 21:22:31,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168662111] [2019-11-06 21:22:31,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 21:22:31,425 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:31,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 21:22:31,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 21:22:31,426 INFO L87 Difference]: Start difference. First operand 42 states and 60 transitions. Second operand 5 states. [2019-11-06 21:22:31,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:31,575 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2019-11-06 21:22:31,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:22:31,576 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-06 21:22:31,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:31,579 INFO L225 Difference]: With dead ends: 49 [2019-11-06 21:22:31,579 INFO L226 Difference]: Without dead ends: 47 [2019-11-06 21:22:31,581 INFO L630 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-11-06 21:22:31,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-06 21:22:31,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-11-06 21:22:31,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-06 21:22:31,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2019-11-06 21:22:31,604 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 14 [2019-11-06 21:22:31,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:31,604 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2019-11-06 21:22:31,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 21:22:31,604 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2019-11-06 21:22:31,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-06 21:22:31,605 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:31,605 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:31,606 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:31,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:31,606 INFO L82 PathProgramCache]: Analyzing trace with hash 674802186, now seen corresponding path program 1 times [2019-11-06 21:22:31,606 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:31,606 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796027033] [2019-11-06 21:22:31,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:31,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:31,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:31,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:22:31,701 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796027033] [2019-11-06 21:22:31,702 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:31,705 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:31,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229105240] [2019-11-06 21:22:31,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:31,706 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:31,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:31,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:31,708 INFO L87 Difference]: Start difference. First operand 46 states and 63 transitions. Second operand 6 states. [2019-11-06 21:22:31,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:31,962 INFO L93 Difference]: Finished difference Result 79 states and 114 transitions. [2019-11-06 21:22:31,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 21:22:31,963 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-06 21:22:31,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:31,965 INFO L225 Difference]: With dead ends: 79 [2019-11-06 21:22:31,965 INFO L226 Difference]: Without dead ends: 77 [2019-11-06 21:22:31,966 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:22:31,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-06 21:22:31,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2019-11-06 21:22:31,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-06 21:22:32,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 105 transitions. [2019-11-06 21:22:32,007 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 105 transitions. Word has length 14 [2019-11-06 21:22:32,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:32,007 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 105 transitions. [2019-11-06 21:22:32,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:32,008 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 105 transitions. [2019-11-06 21:22:32,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-06 21:22:32,011 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:32,012 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:32,012 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:32,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:32,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1685485370, now seen corresponding path program 1 times [2019-11-06 21:22:32,013 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:32,013 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874392210] [2019-11-06 21:22:32,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:32,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:32,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:32,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:32,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:22:32,102 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874392210] [2019-11-06 21:22:32,102 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:32,102 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-06 21:22:32,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988596260] [2019-11-06 21:22:32,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 21:22:32,103 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:32,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 21:22:32,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-06 21:22:32,104 INFO L87 Difference]: Start difference. First operand 72 states and 105 transitions. Second operand 7 states. [2019-11-06 21:22:32,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:32,371 INFO L93 Difference]: Finished difference Result 105 states and 156 transitions. [2019-11-06 21:22:32,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 21:22:32,374 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-11-06 21:22:32,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:32,378 INFO L225 Difference]: With dead ends: 105 [2019-11-06 21:22:32,378 INFO L226 Difference]: Without dead ends: 103 [2019-11-06 21:22:32,379 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-06 21:22:32,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-06 21:22:32,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2019-11-06 21:22:32,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-06 21:22:32,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 151 transitions. [2019-11-06 21:22:32,400 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 151 transitions. Word has length 19 [2019-11-06 21:22:32,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:32,401 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 151 transitions. [2019-11-06 21:22:32,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 21:22:32,401 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 151 transitions. [2019-11-06 21:22:32,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-06 21:22:32,403 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:32,403 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:32,403 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:32,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:32,404 INFO L82 PathProgramCache]: Analyzing trace with hash 2066847833, now seen corresponding path program 1 times [2019-11-06 21:22:32,404 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:32,404 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249613914] [2019-11-06 21:22:32,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:32,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:32,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:32,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:22:32,465 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249613914] [2019-11-06 21:22:32,465 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:32,466 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 21:22:32,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003581978] [2019-11-06 21:22:32,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 21:22:32,466 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:32,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 21:22:32,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 21:22:32,467 INFO L87 Difference]: Start difference. First operand 100 states and 151 transitions. Second operand 5 states. [2019-11-06 21:22:32,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:32,568 INFO L93 Difference]: Finished difference Result 106 states and 156 transitions. [2019-11-06 21:22:32,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:22:32,569 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-06 21:22:32,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:32,572 INFO L225 Difference]: With dead ends: 106 [2019-11-06 21:22:32,572 INFO L226 Difference]: Without dead ends: 104 [2019-11-06 21:22:32,573 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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-11-06 21:22:32,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-06 21:22:32,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-06 21:22:32,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-06 21:22:32,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 154 transitions. [2019-11-06 21:22:32,593 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 154 transitions. Word has length 19 [2019-11-06 21:22:32,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:32,594 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 154 transitions. [2019-11-06 21:22:32,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 21:22:32,594 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 154 transitions. [2019-11-06 21:22:32,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-06 21:22:32,595 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:32,596 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:32,596 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:32,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:32,596 INFO L82 PathProgramCache]: Analyzing trace with hash 2051845673, now seen corresponding path program 1 times [2019-11-06 21:22:32,597 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:32,597 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032042425] [2019-11-06 21:22:32,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:32,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:32,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:32,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:32,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:22:32,674 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032042425] [2019-11-06 21:22:32,676 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:32,677 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:32,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877182700] [2019-11-06 21:22:32,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:32,679 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:32,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:32,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:32,680 INFO L87 Difference]: Start difference. First operand 104 states and 154 transitions. Second operand 6 states. [2019-11-06 21:22:32,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:32,900 INFO L93 Difference]: Finished difference Result 157 states and 240 transitions. [2019-11-06 21:22:32,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 21:22:32,901 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-11-06 21:22:32,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:32,903 INFO L225 Difference]: With dead ends: 157 [2019-11-06 21:22:32,903 INFO L226 Difference]: Without dead ends: 155 [2019-11-06 21:22:32,904 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:22:32,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-06 21:22:32,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 132. [2019-11-06 21:22:32,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-06 21:22:32,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 202 transitions. [2019-11-06 21:22:32,944 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 202 transitions. Word has length 19 [2019-11-06 21:22:32,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:32,944 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 202 transitions. [2019-11-06 21:22:32,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:32,945 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 202 transitions. [2019-11-06 21:22:32,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-06 21:22:32,952 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:32,953 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:32,953 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:32,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:32,953 INFO L82 PathProgramCache]: Analyzing trace with hash -2069937212, now seen corresponding path program 1 times [2019-11-06 21:22:32,954 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:32,954 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411982261] [2019-11-06 21:22:32,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:32,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:33,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:33,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:33,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:22:33,036 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411982261] [2019-11-06 21:22:33,036 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:33,036 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:33,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378094139] [2019-11-06 21:22:33,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:33,038 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:33,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:33,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:33,039 INFO L87 Difference]: Start difference. First operand 132 states and 202 transitions. Second operand 6 states. [2019-11-06 21:22:33,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:33,264 INFO L93 Difference]: Finished difference Result 189 states and 291 transitions. [2019-11-06 21:22:33,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 21:22:33,265 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-11-06 21:22:33,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:33,268 INFO L225 Difference]: With dead ends: 189 [2019-11-06 21:22:33,268 INFO L226 Difference]: Without dead ends: 187 [2019-11-06 21:22:33,269 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:22:33,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-11-06 21:22:33,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 164. [2019-11-06 21:22:33,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-11-06 21:22:33,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 253 transitions. [2019-11-06 21:22:33,297 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 253 transitions. Word has length 19 [2019-11-06 21:22:33,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:33,298 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 253 transitions. [2019-11-06 21:22:33,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:33,298 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 253 transitions. [2019-11-06 21:22:33,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-06 21:22:33,299 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:33,299 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:33,299 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:33,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:33,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1098679356, now seen corresponding path program 1 times [2019-11-06 21:22:33,300 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:33,300 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168809273] [2019-11-06 21:22:33,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:33,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:33,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:33,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:33,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:22:33,326 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168809273] [2019-11-06 21:22:33,326 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:33,326 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:22:33,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288910130] [2019-11-06 21:22:33,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:22:33,327 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:33,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:22:33,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:22:33,328 INFO L87 Difference]: Start difference. First operand 164 states and 253 transitions. Second operand 3 states. [2019-11-06 21:22:33,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:33,365 INFO L93 Difference]: Finished difference Result 309 states and 481 transitions. [2019-11-06 21:22:33,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:22:33,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-06 21:22:33,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:33,368 INFO L225 Difference]: With dead ends: 309 [2019-11-06 21:22:33,368 INFO L226 Difference]: Without dead ends: 232 [2019-11-06 21:22:33,370 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-11-06 21:22:33,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-11-06 21:22:33,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 194. [2019-11-06 21:22:33,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-11-06 21:22:33,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 306 transitions. [2019-11-06 21:22:33,398 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 306 transitions. Word has length 19 [2019-11-06 21:22:33,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:33,399 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 306 transitions. [2019-11-06 21:22:33,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:22:33,399 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 306 transitions. [2019-11-06 21:22:33,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-06 21:22:33,400 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:33,400 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:33,400 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:33,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:33,401 INFO L82 PathProgramCache]: Analyzing trace with hash -372123308, now seen corresponding path program 1 times [2019-11-06 21:22:33,401 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:33,401 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919346723] [2019-11-06 21:22:33,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:33,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:33,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:33,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:33,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:33,458 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 21:22:33,459 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919346723] [2019-11-06 21:22:33,459 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:33,459 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:33,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85342812] [2019-11-06 21:22:33,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:33,460 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:33,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:33,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:33,461 INFO L87 Difference]: Start difference. First operand 194 states and 306 transitions. Second operand 6 states. [2019-11-06 21:22:33,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:33,621 INFO L93 Difference]: Finished difference Result 276 states and 448 transitions. [2019-11-06 21:22:33,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 21:22:33,622 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-11-06 21:22:33,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:33,625 INFO L225 Difference]: With dead ends: 276 [2019-11-06 21:22:33,625 INFO L226 Difference]: Without dead ends: 274 [2019-11-06 21:22:33,626 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:22:33,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-11-06 21:22:33,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 244. [2019-11-06 21:22:33,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-11-06 21:22:33,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 393 transitions. [2019-11-06 21:22:33,658 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 393 transitions. Word has length 26 [2019-11-06 21:22:33,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:33,658 INFO L462 AbstractCegarLoop]: Abstraction has 244 states and 393 transitions. [2019-11-06 21:22:33,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:33,659 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 393 transitions. [2019-11-06 21:22:33,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-06 21:22:33,660 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:33,660 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:33,660 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:33,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:33,660 INFO L82 PathProgramCache]: Analyzing trace with hash 348902212, now seen corresponding path program 1 times [2019-11-06 21:22:33,661 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:33,661 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794373403] [2019-11-06 21:22:33,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:33,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:33,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:33,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:33,785 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 21:22:33,785 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794373403] [2019-11-06 21:22:33,787 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604349651] [2019-11-06 21:22:33,788 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-11-06 21:22:33,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:33,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-06 21:22:33,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:22:33,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:22:33,933 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 21:22:33,934 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 21:22:33,934 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 14 [2019-11-06 21:22:33,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115721626] [2019-11-06 21:22:33,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 21:22:33,937 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:33,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 21:22:33,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-11-06 21:22:33,938 INFO L87 Difference]: Start difference. First operand 244 states and 393 transitions. Second operand 7 states. [2019-11-06 21:22:34,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:34,139 INFO L93 Difference]: Finished difference Result 251 states and 399 transitions. [2019-11-06 21:22:34,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 21:22:34,140 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-11-06 21:22:34,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:34,147 INFO L225 Difference]: With dead ends: 251 [2019-11-06 21:22:34,147 INFO L226 Difference]: Without dead ends: 249 [2019-11-06 21:22:34,148 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-11-06 21:22:34,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-11-06 21:22:34,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 248. [2019-11-06 21:22:34,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-11-06 21:22:34,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 396 transitions. [2019-11-06 21:22:34,188 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 396 transitions. Word has length 28 [2019-11-06 21:22:34,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:34,189 INFO L462 AbstractCegarLoop]: Abstraction has 248 states and 396 transitions. [2019-11-06 21:22:34,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 21:22:34,189 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 396 transitions. [2019-11-06 21:22:34,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-06 21:22:34,191 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:34,191 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:34,395 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:22:34,395 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:34,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:34,396 INFO L82 PathProgramCache]: Analyzing trace with hash -2096231521, now seen corresponding path program 1 times [2019-11-06 21:22:34,396 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:34,397 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400981973] [2019-11-06 21:22:34,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:34,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:34,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:34,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:34,491 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-06 21:22:34,497 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400981973] [2019-11-06 21:22:34,498 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:34,498 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-06 21:22:34,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177651023] [2019-11-06 21:22:34,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 21:22:34,499 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:34,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 21:22:34,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-06 21:22:34,499 INFO L87 Difference]: Start difference. First operand 248 states and 396 transitions. Second operand 7 states. [2019-11-06 21:22:34,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:34,790 INFO L93 Difference]: Finished difference Result 417 states and 695 transitions. [2019-11-06 21:22:34,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 21:22:34,791 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-11-06 21:22:34,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:34,796 INFO L225 Difference]: With dead ends: 417 [2019-11-06 21:22:34,796 INFO L226 Difference]: Without dead ends: 415 [2019-11-06 21:22:34,797 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-06 21:22:34,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2019-11-06 21:22:34,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 371. [2019-11-06 21:22:34,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2019-11-06 21:22:34,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 617 transitions. [2019-11-06 21:22:34,860 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 617 transitions. Word has length 31 [2019-11-06 21:22:34,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:34,861 INFO L462 AbstractCegarLoop]: Abstraction has 371 states and 617 transitions. [2019-11-06 21:22:34,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 21:22:34,861 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 617 transitions. [2019-11-06 21:22:34,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-06 21:22:34,863 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:34,863 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:34,864 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:34,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:34,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1955682911, now seen corresponding path program 1 times [2019-11-06 21:22:34,864 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:34,865 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941704474] [2019-11-06 21:22:34,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:34,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:34,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:34,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:34,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:34,979 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-06 21:22:34,979 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941704474] [2019-11-06 21:22:34,979 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:34,980 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-06 21:22:34,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952559608] [2019-11-06 21:22:34,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 21:22:34,980 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:34,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 21:22:34,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-06 21:22:34,981 INFO L87 Difference]: Start difference. First operand 371 states and 617 transitions. Second operand 7 states. [2019-11-06 21:22:35,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:35,278 INFO L93 Difference]: Finished difference Result 392 states and 648 transitions. [2019-11-06 21:22:35,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 21:22:35,278 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-11-06 21:22:35,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:35,285 INFO L225 Difference]: With dead ends: 392 [2019-11-06 21:22:35,285 INFO L226 Difference]: Without dead ends: 390 [2019-11-06 21:22:35,286 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-06 21:22:35,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-11-06 21:22:35,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 378. [2019-11-06 21:22:35,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-11-06 21:22:35,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 626 transitions. [2019-11-06 21:22:35,328 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 626 transitions. Word has length 31 [2019-11-06 21:22:35,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:35,329 INFO L462 AbstractCegarLoop]: Abstraction has 378 states and 626 transitions. [2019-11-06 21:22:35,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 21:22:35,329 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 626 transitions. [2019-11-06 21:22:35,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-06 21:22:35,331 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:35,332 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 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] [2019-11-06 21:22:35,332 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:35,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:35,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1751188594, now seen corresponding path program 1 times [2019-11-06 21:22:35,333 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:35,333 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454699427] [2019-11-06 21:22:35,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:35,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:35,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:35,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:35,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:35,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:35,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:35,446 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-06 21:22:35,446 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454699427] [2019-11-06 21:22:35,446 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511443282] [2019-11-06 21:22:35,448 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-11-06 21:22:35,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:35,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-06 21:22:35,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:22:35,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:22:35,572 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-06 21:22:35,573 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 21:22:35,573 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2019-11-06 21:22:35,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531060476] [2019-11-06 21:22:35,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 21:22:35,575 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:35,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 21:22:35,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-11-06 21:22:35,576 INFO L87 Difference]: Start difference. First operand 378 states and 626 transitions. Second operand 7 states. [2019-11-06 21:22:35,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:35,769 INFO L93 Difference]: Finished difference Result 440 states and 727 transitions. [2019-11-06 21:22:35,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 21:22:35,769 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-11-06 21:22:35,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:35,774 INFO L225 Difference]: With dead ends: 440 [2019-11-06 21:22:35,774 INFO L226 Difference]: Without dead ends: 438 [2019-11-06 21:22:35,775 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-11-06 21:22:35,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-11-06 21:22:35,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 382. [2019-11-06 21:22:35,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-11-06 21:22:35,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 629 transitions. [2019-11-06 21:22:35,824 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 629 transitions. Word has length 40 [2019-11-06 21:22:35,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:35,824 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 629 transitions. [2019-11-06 21:22:35,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 21:22:35,825 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 629 transitions. [2019-11-06 21:22:35,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-06 21:22:35,826 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:35,826 INFO L410 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 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-11-06 21:22:36,033 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:22:36,034 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:36,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:36,034 INFO L82 PathProgramCache]: Analyzing trace with hash 454341926, now seen corresponding path program 1 times [2019-11-06 21:22:36,034 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:36,034 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183533749] [2019-11-06 21:22:36,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:36,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:36,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:36,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:36,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:36,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:36,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:36,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:36,118 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-06 21:22:36,118 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183533749] [2019-11-06 21:22:36,118 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:36,118 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-06 21:22:36,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084035138] [2019-11-06 21:22:36,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 21:22:36,119 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:36,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 21:22:36,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-06 21:22:36,120 INFO L87 Difference]: Start difference. First operand 382 states and 629 transitions. Second operand 7 states. [2019-11-06 21:22:36,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:36,380 INFO L93 Difference]: Finished difference Result 435 states and 701 transitions. [2019-11-06 21:22:36,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 21:22:36,380 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-11-06 21:22:36,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:36,384 INFO L225 Difference]: With dead ends: 435 [2019-11-06 21:22:36,385 INFO L226 Difference]: Without dead ends: 433 [2019-11-06 21:22:36,386 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-06 21:22:36,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2019-11-06 21:22:36,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 312. [2019-11-06 21:22:36,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-11-06 21:22:36,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 499 transitions. [2019-11-06 21:22:36,430 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 499 transitions. Word has length 41 [2019-11-06 21:22:36,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:36,430 INFO L462 AbstractCegarLoop]: Abstraction has 312 states and 499 transitions. [2019-11-06 21:22:36,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 21:22:36,430 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 499 transitions. [2019-11-06 21:22:36,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-06 21:22:36,432 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:36,432 INFO L410 BasicCegarLoop]: trace histogram [9, 8, 8, 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] [2019-11-06 21:22:36,433 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:36,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:36,433 INFO L82 PathProgramCache]: Analyzing trace with hash 867583944, now seen corresponding path program 1 times [2019-11-06 21:22:36,433 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:36,433 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291889734] [2019-11-06 21:22:36,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:36,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:36,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:36,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:36,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:36,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:36,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:36,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:36,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:36,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:36,539 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-11-06 21:22:36,539 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291889734] [2019-11-06 21:22:36,540 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483337931] [2019-11-06 21:22:36,540 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-11-06 21:22:36,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:36,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-06 21:22:36,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:22:36,712 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-11-06 21:22:36,712 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 21:22:36,712 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 12 [2019-11-06 21:22:36,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071353800] [2019-11-06 21:22:36,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:36,717 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:36,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:36,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-06 21:22:36,717 INFO L87 Difference]: Start difference. First operand 312 states and 499 transitions. Second operand 6 states. [2019-11-06 21:22:37,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:37,034 INFO L93 Difference]: Finished difference Result 679 states and 1090 transitions. [2019-11-06 21:22:37,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 21:22:37,035 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-11-06 21:22:37,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:37,039 INFO L225 Difference]: With dead ends: 679 [2019-11-06 21:22:37,039 INFO L226 Difference]: Without dead ends: 395 [2019-11-06 21:22:37,044 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2019-11-06 21:22:37,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-11-06 21:22:37,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 360. [2019-11-06 21:22:37,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-11-06 21:22:37,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 583 transitions. [2019-11-06 21:22:37,101 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 583 transitions. Word has length 61 [2019-11-06 21:22:37,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:37,101 INFO L462 AbstractCegarLoop]: Abstraction has 360 states and 583 transitions. [2019-11-06 21:22:37,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:37,101 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 583 transitions. [2019-11-06 21:22:37,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-06 21:22:37,104 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:37,104 INFO L410 BasicCegarLoop]: trace histogram [11, 10, 10, 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] [2019-11-06 21:22:37,336 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:22:37,336 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:37,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:37,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1184410446, now seen corresponding path program 1 times [2019-11-06 21:22:37,337 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:37,337 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437611333] [2019-11-06 21:22:37,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:37,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:37,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:37,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:37,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:37,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:37,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:37,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:37,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:37,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:37,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:37,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:37,506 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-11-06 21:22:37,507 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437611333] [2019-11-06 21:22:37,507 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868841905] [2019-11-06 21:22:37,507 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-11-06 21:22:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:37,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-06 21:22:37,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:22:37,758 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 88 proven. 2 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-11-06 21:22:37,759 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:22:37,759 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 19 [2019-11-06 21:22:37,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895495510] [2019-11-06 21:22:37,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-06 21:22:37,760 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:37,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-06 21:22:37,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2019-11-06 21:22:37,761 INFO L87 Difference]: Start difference. First operand 360 states and 583 transitions. Second operand 19 states. [2019-11-06 21:22:43,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:43,194 INFO L93 Difference]: Finished difference Result 982 states and 1577 transitions. [2019-11-06 21:22:43,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-11-06 21:22:43,195 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 75 [2019-11-06 21:22:43,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:43,198 INFO L225 Difference]: With dead ends: 982 [2019-11-06 21:22:43,198 INFO L226 Difference]: Without dead ends: 379 [2019-11-06 21:22:43,203 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1085 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=633, Invalid=3399, Unknown=0, NotChecked=0, Total=4032 [2019-11-06 21:22:43,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-11-06 21:22:43,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 210. [2019-11-06 21:22:43,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-11-06 21:22:43,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 308 transitions. [2019-11-06 21:22:43,236 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 308 transitions. Word has length 75 [2019-11-06 21:22:43,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:43,236 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 308 transitions. [2019-11-06 21:22:43,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-06 21:22:43,236 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 308 transitions. [2019-11-06 21:22:43,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-06 21:22:43,238 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:43,238 INFO L410 BasicCegarLoop]: trace histogram [17, 16, 16, 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-11-06 21:22:43,445 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:22:43,446 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:43,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:43,446 INFO L82 PathProgramCache]: Analyzing trace with hash -16221646, now seen corresponding path program 1 times [2019-11-06 21:22:43,446 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:43,447 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734941903] [2019-11-06 21:22:43,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:43,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:43,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:43,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:43,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:43,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:43,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:43,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:43,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:43,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:43,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:43,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:43,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:43,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:43,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:43,613 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 33 proven. 19 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-11-06 21:22:43,613 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734941903] [2019-11-06 21:22:43,613 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976836811] [2019-11-06 21:22:43,614 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-11-06 21:22:43,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:43,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-06 21:22:43,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:22:43,897 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 153 proven. 7 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2019-11-06 21:22:43,898 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:22:43,898 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2019-11-06 21:22:43,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960886105] [2019-11-06 21:22:43,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-06 21:22:43,899 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:43,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-06 21:22:43,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-11-06 21:22:43,900 INFO L87 Difference]: Start difference. First operand 210 states and 308 transitions. Second operand 19 states. [2019-11-06 21:22:49,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:49,160 INFO L93 Difference]: Finished difference Result 794 states and 1232 transitions. [2019-11-06 21:22:49,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-11-06 21:22:49,160 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 110 [2019-11-06 21:22:49,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:49,165 INFO L225 Difference]: With dead ends: 794 [2019-11-06 21:22:49,165 INFO L226 Difference]: Without dead ends: 617 [2019-11-06 21:22:49,170 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1644 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=901, Invalid=4355, Unknown=0, NotChecked=0, Total=5256 [2019-11-06 21:22:49,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-11-06 21:22:49,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 421. [2019-11-06 21:22:49,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-11-06 21:22:49,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 661 transitions. [2019-11-06 21:22:49,231 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 661 transitions. Word has length 110 [2019-11-06 21:22:49,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:49,233 INFO L462 AbstractCegarLoop]: Abstraction has 421 states and 661 transitions. [2019-11-06 21:22:49,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-06 21:22:49,233 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 661 transitions. [2019-11-06 21:22:49,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-06 21:22:49,240 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:49,240 INFO L410 BasicCegarLoop]: trace histogram [17, 16, 16, 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-11-06 21:22:49,452 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:22:49,452 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:49,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:49,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1522118384, now seen corresponding path program 1 times [2019-11-06 21:22:49,453 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:49,453 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916867292] [2019-11-06 21:22:49,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:49,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:49,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:49,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:49,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:49,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:49,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:49,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:49,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:49,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:49,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:49,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:49,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:49,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:49,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:49,584 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 45 proven. 7 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-11-06 21:22:49,585 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916867292] [2019-11-06 21:22:49,585 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288643519] [2019-11-06 21:22:49,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:22:49,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:49,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-06 21:22:49,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:22:49,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:22:49,727 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 45 proven. 7 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-11-06 21:22:49,727 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:22:49,727 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-11-06 21:22:49,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819379277] [2019-11-06 21:22:49,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 21:22:49,728 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:49,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 21:22:49,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-06 21:22:49,729 INFO L87 Difference]: Start difference. First operand 421 states and 661 transitions. Second operand 10 states. [2019-11-06 21:22:50,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:50,087 INFO L93 Difference]: Finished difference Result 475 states and 741 transitions. [2019-11-06 21:22:50,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-06 21:22:50,087 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 110 [2019-11-06 21:22:50,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:50,091 INFO L225 Difference]: With dead ends: 475 [2019-11-06 21:22:50,091 INFO L226 Difference]: Without dead ends: 473 [2019-11-06 21:22:50,092 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 143 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-11-06 21:22:50,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-11-06 21:22:50,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 425. [2019-11-06 21:22:50,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-11-06 21:22:50,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 664 transitions. [2019-11-06 21:22:50,154 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 664 transitions. Word has length 110 [2019-11-06 21:22:50,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:50,155 INFO L462 AbstractCegarLoop]: Abstraction has 425 states and 664 transitions. [2019-11-06 21:22:50,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 21:22:50,155 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 664 transitions. [2019-11-06 21:22:50,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-06 21:22:50,157 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:50,158 INFO L410 BasicCegarLoop]: trace histogram [18, 17, 17, 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] [2019-11-06 21:22:50,361 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:22:50,361 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:50,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:50,362 INFO L82 PathProgramCache]: Analyzing trace with hash 217536387, now seen corresponding path program 2 times [2019-11-06 21:22:50,363 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:50,363 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141882163] [2019-11-06 21:22:50,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:50,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:50,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:50,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:50,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:50,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:50,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:50,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:50,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:50,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:50,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:50,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:50,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:50,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:50,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:50,603 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 35 proven. 20 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-11-06 21:22:50,603 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141882163] [2019-11-06 21:22:50,607 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489300661] [2019-11-06 21:22:50,607 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:22:50,674 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 21:22:50,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:22:50,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-06 21:22:50,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:22:50,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:22:50,857 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 34 proven. 21 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-11-06 21:22:50,857 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:22:50,857 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 15 [2019-11-06 21:22:50,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108518365] [2019-11-06 21:22:50,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-06 21:22:50,858 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:50,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-06 21:22:50,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-11-06 21:22:50,859 INFO L87 Difference]: Start difference. First operand 425 states and 664 transitions. Second operand 15 states. [2019-11-06 21:22:51,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:51,856 INFO L93 Difference]: Finished difference Result 641 states and 1003 transitions. [2019-11-06 21:22:51,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-06 21:22:51,857 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 115 [2019-11-06 21:22:51,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:51,860 INFO L225 Difference]: With dead ends: 641 [2019-11-06 21:22:51,860 INFO L226 Difference]: Without dead ends: 529 [2019-11-06 21:22:51,861 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 145 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=430, Unknown=0, NotChecked=0, Total=552 [2019-11-06 21:22:51,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2019-11-06 21:22:51,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 431. [2019-11-06 21:22:51,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2019-11-06 21:22:51,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 663 transitions. [2019-11-06 21:22:51,914 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 663 transitions. Word has length 115 [2019-11-06 21:22:51,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:51,915 INFO L462 AbstractCegarLoop]: Abstraction has 431 states and 663 transitions. [2019-11-06 21:22:51,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-06 21:22:51,915 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 663 transitions. [2019-11-06 21:22:51,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-06 21:22:51,917 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:51,918 INFO L410 BasicCegarLoop]: trace histogram [22, 21, 21, 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] [2019-11-06 21:22:52,125 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:22:52,126 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:52,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:52,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1046126307, now seen corresponding path program 2 times [2019-11-06 21:22:52,127 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:52,127 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700084066] [2019-11-06 21:22:52,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:52,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:52,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:52,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:52,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:52,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:52,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:52,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:52,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:52,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:52,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:52,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:52,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:52,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:52,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:52,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:52,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:52,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:52,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:52,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:52,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:52,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:52,355 INFO L134 CoverageAnalysis]: Checked inductivity of 909 backedges. 42 proven. 27 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-11-06 21:22:52,356 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700084066] [2019-11-06 21:22:52,356 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126592782] [2019-11-06 21:22:52,356 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:22:52,431 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 21:22:52,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:22:52,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-06 21:22:52,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:22:52,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:22:52,694 INFO L134 CoverageAnalysis]: Checked inductivity of 909 backedges. 57 proven. 12 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-11-06 21:22:52,694 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:22:52,695 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2019-11-06 21:22:52,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790295104] [2019-11-06 21:22:52,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-06 21:22:52,696 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:52,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-06 21:22:52,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2019-11-06 21:22:52,696 INFO L87 Difference]: Start difference. First operand 431 states and 663 transitions. Second operand 21 states. [2019-11-06 21:22:55,540 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2019-11-06 21:22:56,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:56,817 INFO L93 Difference]: Finished difference Result 723 states and 1144 transitions. [2019-11-06 21:22:56,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-06 21:22:56,818 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 137 [2019-11-06 21:22:56,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:56,818 INFO L225 Difference]: With dead ends: 723 [2019-11-06 21:22:56,818 INFO L226 Difference]: Without dead ends: 0 [2019-11-06 21:22:56,824 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=511, Invalid=1559, Unknown=0, NotChecked=0, Total=2070 [2019-11-06 21:22:56,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-06 21:22:56,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-06 21:22:56,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-06 21:22:56,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-06 21:22:56,825 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 137 [2019-11-06 21:22:56,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:56,825 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-06 21:22:56,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-06 21:22:56,826 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-06 21:22:56,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-06 21:22:57,028 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:22:57,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-06 21:22:57,263 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 219 [2019-11-06 21:22:57,659 WARN L191 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 246 DAG size of output: 199 [2019-11-06 21:22:57,994 WARN L191 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 203 [2019-11-06 21:22:58,249 WARN L191 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 246 DAG size of output: 199 [2019-11-06 21:22:58,547 WARN L191 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 215 [2019-11-06 21:22:59,022 WARN L191 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 269 DAG size of output: 210 [2019-11-06 21:22:59,381 WARN L191 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 246 DAG size of output: 199 [2019-11-06 21:22:59,708 WARN L191 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 253 [2019-11-06 21:23:00,260 WARN L191 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 414 DAG size of output: 343 [2019-11-06 21:23:00,529 WARN L191 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 301 DAG size of output: 266 [2019-11-06 21:23:00,976 WARN L191 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 423 DAG size of output: 358