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-13a467a-m [2019-10-14 23:15:18,945 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:15:18,947 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:15:18,959 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:15:18,960 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:15:18,961 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:15:18,962 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:15:18,964 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:15:18,966 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:15:18,967 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:15:18,968 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:15:18,969 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:15:18,969 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:15:18,970 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:15:18,971 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:15:18,974 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:15:18,974 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:15:18,975 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:15:18,978 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:15:18,980 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:15:18,983 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:15:18,986 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:15:18,987 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:15:18,988 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:15:18,993 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:15:18,993 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:15:18,993 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:15:18,995 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:15:18,996 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:15:18,998 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:15:18,998 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:15:19,000 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:15:19,001 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:15:19,002 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:15:19,005 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:15:19,005 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:15:19,006 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:15:19,007 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:15:19,007 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:15:19,009 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:15:19,011 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:15:19,012 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 23:15:19,031 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:15:19,031 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:15:19,033 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:15:19,033 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:15:19,034 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:15:19,034 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:15:19,034 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:15:19,034 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:15:19,034 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:15:19,035 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:15:19,035 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:15:19,036 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:15:19,036 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:15:19,036 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:15:19,037 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:15:19,037 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:15:19,037 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:15:19,037 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:15:19,037 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:15:19,037 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:15:19,038 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:15:19,038 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:15:19,038 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:15:19,038 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:15:19,038 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:15:19,039 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:15:19,039 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:15:19,039 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:15:19,039 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:15:19,334 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:15:19,353 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:15:19,358 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:15:19,360 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:15:19,360 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:15:19,361 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/heapsort.i [2019-10-14 23:15:19,436 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db6eceabe/ec3cc065e1a2410c8882c366d87be537/FLAGf03813cf7 [2019-10-14 23:15:19,926 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:15:19,926 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/heapsort.i [2019-10-14 23:15:19,933 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db6eceabe/ec3cc065e1a2410c8882c366d87be537/FLAGf03813cf7 [2019-10-14 23:15:20,284 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db6eceabe/ec3cc065e1a2410c8882c366d87be537 [2019-10-14 23:15:20,294 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:15:20,296 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:15:20,297 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:15:20,297 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:15:20,302 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:15:20,303 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:15:20" (1/1) ... [2019-10-14 23:15:20,305 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53500b9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:20, skipping insertion in model container [2019-10-14 23:15:20,306 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:15:20" (1/1) ... [2019-10-14 23:15:20,314 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:15:20,337 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:15:20,518 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:15:20,525 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:15:20,553 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:15:20,569 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:15:20,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:20 WrapperNode [2019-10-14 23:15:20,569 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:15:20,570 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:15:20,570 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:15:20,570 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:15:20,665 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:20" (1/1) ... [2019-10-14 23:15:20,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:20" (1/1) ... [2019-10-14 23:15:20,681 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:20" (1/1) ... [2019-10-14 23:15:20,681 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:20" (1/1) ... [2019-10-14 23:15:20,687 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:20" (1/1) ... [2019-10-14 23:15:20,693 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:20" (1/1) ... [2019-10-14 23:15:20,694 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:20" (1/1) ... [2019-10-14 23:15:20,696 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:15:20,697 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:15:20,697 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:15:20,697 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:15:20,698 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:15:20,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:15:20,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:15:20,756 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-14 23:15:20,756 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:15:20,756 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:15:20,756 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-14 23:15:20,757 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-14 23:15:20,757 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:15:20,757 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:15:20,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:15:20,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:15:21,029 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:15:21,030 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-14 23:15:21,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:15:21 BoogieIcfgContainer [2019-10-14 23:15:21,035 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:15:21,037 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:15:21,038 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:15:21,041 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:15:21,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:15:20" (1/3) ... [2019-10-14 23:15:21,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d8689e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:15:21, skipping insertion in model container [2019-10-14 23:15:21,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:20" (2/3) ... [2019-10-14 23:15:21,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d8689e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:15:21, skipping insertion in model container [2019-10-14 23:15:21,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:15:21" (3/3) ... [2019-10-14 23:15:21,050 INFO L109 eAbstractionObserver]: Analyzing ICFG heapsort.i [2019-10-14 23:15:21,061 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:15:21,069 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:15:21,095 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:15:21,140 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:15:21,140 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:15:21,143 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:15:21,144 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:15:21,144 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:15:21,144 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:15:21,144 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:15:21,144 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:15:21,165 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2019-10-14 23:15:21,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-14 23:15:21,171 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:21,172 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:21,173 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:21,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:21,179 INFO L82 PathProgramCache]: Analyzing trace with hash 648615897, now seen corresponding path program 1 times [2019-10-14 23:15:21,186 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:21,186 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829958655] [2019-10-14 23:15:21,187 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:21,187 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:21,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:21,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:21,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:21,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:15:21,382 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829958655] [2019-10-14 23:15:21,382 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:21,383 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:15:21,383 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408237764] [2019-10-14 23:15:21,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:15:21,388 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:21,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:15:21,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:15:21,400 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 5 states. [2019-10-14 23:15:21,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:21,546 INFO L93 Difference]: Finished difference Result 83 states and 141 transitions. [2019-10-14 23:15:21,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:15:21,548 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-10-14 23:15:21,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:21,559 INFO L225 Difference]: With dead ends: 83 [2019-10-14 23:15:21,559 INFO L226 Difference]: Without dead ends: 42 [2019-10-14 23:15:21,563 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:15:21,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-14 23:15:21,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-10-14 23:15:21,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-14 23:15:21,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2019-10-14 23:15:21,615 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 60 transitions. Word has length 14 [2019-10-14 23:15:21,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:21,615 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 60 transitions. [2019-10-14 23:15:21,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:15:21,616 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 60 transitions. [2019-10-14 23:15:21,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-14 23:15:21,617 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:21,617 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:21,618 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:21,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:21,618 INFO L82 PathProgramCache]: Analyzing trace with hash 653352666, now seen corresponding path program 1 times [2019-10-14 23:15:21,619 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:21,619 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70807516] [2019-10-14 23:15:21,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:21,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:21,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:21,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:21,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:21,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:15:21,698 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70807516] [2019-10-14 23:15:21,699 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:21,699 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:15:21,699 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115100604] [2019-10-14 23:15:21,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:15:21,701 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:21,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:15:21,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:15:21,702 INFO L87 Difference]: Start difference. First operand 42 states and 60 transitions. Second operand 5 states. [2019-10-14 23:15:21,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:21,830 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2019-10-14 23:15:21,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:15:21,831 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-10-14 23:15:21,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:21,833 INFO L225 Difference]: With dead ends: 49 [2019-10-14 23:15:21,833 INFO L226 Difference]: Without dead ends: 47 [2019-10-14 23:15:21,834 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:15:21,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-14 23:15:21,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-10-14 23:15:21,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-14 23:15:21,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2019-10-14 23:15:21,848 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 14 [2019-10-14 23:15:21,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:21,848 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2019-10-14 23:15:21,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:15:21,849 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2019-10-14 23:15:21,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-14 23:15:21,849 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:21,850 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:21,850 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:21,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:21,850 INFO L82 PathProgramCache]: Analyzing trace with hash 674802186, now seen corresponding path program 1 times [2019-10-14 23:15:21,851 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:21,851 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702587780] [2019-10-14 23:15:21,851 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:21,851 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:21,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:21,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:21,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:21,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:15:21,954 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702587780] [2019-10-14 23:15:21,955 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:21,955 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:15:21,958 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750705319] [2019-10-14 23:15:21,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:15:21,959 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:21,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:15:21,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:15:21,959 INFO L87 Difference]: Start difference. First operand 46 states and 63 transitions. Second operand 6 states. [2019-10-14 23:15:22,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:22,230 INFO L93 Difference]: Finished difference Result 79 states and 114 transitions. [2019-10-14 23:15:22,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 23:15:22,232 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-10-14 23:15:22,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:22,234 INFO L225 Difference]: With dead ends: 79 [2019-10-14 23:15:22,234 INFO L226 Difference]: Without dead ends: 77 [2019-10-14 23:15:22,234 INFO L600 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-10-14 23:15:22,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-14 23:15:22,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2019-10-14 23:15:22,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-14 23:15:22,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 105 transitions. [2019-10-14 23:15:22,253 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 105 transitions. Word has length 14 [2019-10-14 23:15:22,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:22,254 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 105 transitions. [2019-10-14 23:15:22,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:15:22,254 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 105 transitions. [2019-10-14 23:15:22,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-14 23:15:22,255 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:22,255 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:22,256 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:22,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:22,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1685485370, now seen corresponding path program 1 times [2019-10-14 23:15:22,256 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:22,271 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225410328] [2019-10-14 23:15:22,272 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:22,272 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:22,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:22,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:22,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:22,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:22,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:15:22,412 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225410328] [2019-10-14 23:15:22,412 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:22,416 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-14 23:15:22,417 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856472514] [2019-10-14 23:15:22,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 23:15:22,418 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:22,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 23:15:22,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:15:22,419 INFO L87 Difference]: Start difference. First operand 72 states and 105 transitions. Second operand 7 states. [2019-10-14 23:15:22,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:22,684 INFO L93 Difference]: Finished difference Result 105 states and 156 transitions. [2019-10-14 23:15:22,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 23:15:22,690 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-10-14 23:15:22,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:22,693 INFO L225 Difference]: With dead ends: 105 [2019-10-14 23:15:22,693 INFO L226 Difference]: Without dead ends: 103 [2019-10-14 23:15:22,694 INFO L600 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-10-14 23:15:22,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-10-14 23:15:22,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2019-10-14 23:15:22,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-10-14 23:15:22,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 151 transitions. [2019-10-14 23:15:22,736 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 151 transitions. Word has length 19 [2019-10-14 23:15:22,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:22,736 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 151 transitions. [2019-10-14 23:15:22,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 23:15:22,737 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 151 transitions. [2019-10-14 23:15:22,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-14 23:15:22,740 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:22,741 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:22,741 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:22,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:22,742 INFO L82 PathProgramCache]: Analyzing trace with hash 2066847833, now seen corresponding path program 1 times [2019-10-14 23:15:22,742 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:22,742 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552927037] [2019-10-14 23:15:22,743 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:22,743 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:22,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:22,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:22,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:22,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:15:22,805 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552927037] [2019-10-14 23:15:22,805 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:22,805 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:15:22,806 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479558463] [2019-10-14 23:15:22,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:15:22,806 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:22,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:15:22,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:15:22,807 INFO L87 Difference]: Start difference. First operand 100 states and 151 transitions. Second operand 5 states. [2019-10-14 23:15:22,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:22,897 INFO L93 Difference]: Finished difference Result 106 states and 156 transitions. [2019-10-14 23:15:22,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:15:22,898 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-10-14 23:15:22,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:22,902 INFO L225 Difference]: With dead ends: 106 [2019-10-14 23:15:22,902 INFO L226 Difference]: Without dead ends: 104 [2019-10-14 23:15:22,903 INFO L600 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-10-14 23:15:22,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-10-14 23:15:22,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-10-14 23:15:22,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-10-14 23:15:22,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 154 transitions. [2019-10-14 23:15:22,932 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 154 transitions. Word has length 19 [2019-10-14 23:15:22,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:22,933 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 154 transitions. [2019-10-14 23:15:22,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:15:22,933 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 154 transitions. [2019-10-14 23:15:22,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-14 23:15:22,934 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:22,935 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:22,935 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:22,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:22,935 INFO L82 PathProgramCache]: Analyzing trace with hash 2051845673, now seen corresponding path program 1 times [2019-10-14 23:15:22,936 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:22,936 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36942189] [2019-10-14 23:15:22,936 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:22,936 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:22,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:22,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:22,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:22,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:22,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:15:22,990 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36942189] [2019-10-14 23:15:22,990 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:22,990 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:15:22,990 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011379299] [2019-10-14 23:15:22,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:15:22,991 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:22,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:15:22,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:15:22,992 INFO L87 Difference]: Start difference. First operand 104 states and 154 transitions. Second operand 6 states. [2019-10-14 23:15:23,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:23,192 INFO L93 Difference]: Finished difference Result 157 states and 240 transitions. [2019-10-14 23:15:23,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:15:23,193 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-10-14 23:15:23,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:23,195 INFO L225 Difference]: With dead ends: 157 [2019-10-14 23:15:23,195 INFO L226 Difference]: Without dead ends: 155 [2019-10-14 23:15:23,196 INFO L600 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-10-14 23:15:23,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-10-14 23:15:23,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 132. [2019-10-14 23:15:23,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-10-14 23:15:23,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 202 transitions. [2019-10-14 23:15:23,222 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 202 transitions. Word has length 19 [2019-10-14 23:15:23,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:23,222 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 202 transitions. [2019-10-14 23:15:23,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:15:23,222 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 202 transitions. [2019-10-14 23:15:23,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-14 23:15:23,224 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:23,224 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:23,224 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:23,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:23,225 INFO L82 PathProgramCache]: Analyzing trace with hash -2069937212, now seen corresponding path program 1 times [2019-10-14 23:15:23,225 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:23,225 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908184547] [2019-10-14 23:15:23,226 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:23,226 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:23,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:23,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:23,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:23,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:23,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:15:23,285 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908184547] [2019-10-14 23:15:23,285 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:23,286 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:15:23,286 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709108104] [2019-10-14 23:15:23,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:15:23,287 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:23,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:15:23,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:15:23,288 INFO L87 Difference]: Start difference. First operand 132 states and 202 transitions. Second operand 6 states. [2019-10-14 23:15:23,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:23,496 INFO L93 Difference]: Finished difference Result 189 states and 291 transitions. [2019-10-14 23:15:23,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:15:23,497 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-10-14 23:15:23,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:23,500 INFO L225 Difference]: With dead ends: 189 [2019-10-14 23:15:23,500 INFO L226 Difference]: Without dead ends: 187 [2019-10-14 23:15:23,501 INFO L600 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-10-14 23:15:23,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-10-14 23:15:23,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 164. [2019-10-14 23:15:23,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-10-14 23:15:23,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 253 transitions. [2019-10-14 23:15:23,528 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 253 transitions. Word has length 19 [2019-10-14 23:15:23,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:23,529 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 253 transitions. [2019-10-14 23:15:23,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:15:23,529 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 253 transitions. [2019-10-14 23:15:23,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-14 23:15:23,530 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:23,531 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:23,531 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:23,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:23,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1098679356, now seen corresponding path program 1 times [2019-10-14 23:15:23,532 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:23,532 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985839629] [2019-10-14 23:15:23,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:23,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:23,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:23,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:23,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:23,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:15:23,568 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985839629] [2019-10-14 23:15:23,569 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:23,569 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:15:23,569 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627550056] [2019-10-14 23:15:23,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:15:23,570 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:23,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:15:23,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:15:23,571 INFO L87 Difference]: Start difference. First operand 164 states and 253 transitions. Second operand 3 states. [2019-10-14 23:15:23,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:23,605 INFO L93 Difference]: Finished difference Result 309 states and 481 transitions. [2019-10-14 23:15:23,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:15:23,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-14 23:15:23,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:23,608 INFO L225 Difference]: With dead ends: 309 [2019-10-14 23:15:23,608 INFO L226 Difference]: Without dead ends: 232 [2019-10-14 23:15:23,610 INFO L600 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-10-14 23:15:23,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-10-14 23:15:23,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 194. [2019-10-14 23:15:23,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-10-14 23:15:23,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 306 transitions. [2019-10-14 23:15:23,638 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 306 transitions. Word has length 19 [2019-10-14 23:15:23,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:23,639 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 306 transitions. [2019-10-14 23:15:23,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:15:23,639 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 306 transitions. [2019-10-14 23:15:23,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-14 23:15:23,642 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:23,642 INFO L380 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-10-14 23:15:23,643 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:23,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:23,643 INFO L82 PathProgramCache]: Analyzing trace with hash -372123308, now seen corresponding path program 1 times [2019-10-14 23:15:23,643 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:23,643 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130347194] [2019-10-14 23:15:23,644 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:23,644 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:23,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:23,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:23,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:23,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:23,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:23,695 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 23:15:23,695 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130347194] [2019-10-14 23:15:23,696 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:23,696 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:15:23,696 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485620995] [2019-10-14 23:15:23,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:15:23,697 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:23,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:15:23,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:15:23,698 INFO L87 Difference]: Start difference. First operand 194 states and 306 transitions. Second operand 6 states. [2019-10-14 23:15:23,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:23,861 INFO L93 Difference]: Finished difference Result 276 states and 448 transitions. [2019-10-14 23:15:23,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 23:15:23,864 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-10-14 23:15:23,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:23,872 INFO L225 Difference]: With dead ends: 276 [2019-10-14 23:15:23,872 INFO L226 Difference]: Without dead ends: 274 [2019-10-14 23:15:23,873 INFO L600 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-10-14 23:15:23,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-10-14 23:15:23,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 244. [2019-10-14 23:15:23,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-10-14 23:15:23,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 393 transitions. [2019-10-14 23:15:23,927 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 393 transitions. Word has length 26 [2019-10-14 23:15:23,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:23,937 INFO L462 AbstractCegarLoop]: Abstraction has 244 states and 393 transitions. [2019-10-14 23:15:23,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:15:23,938 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 393 transitions. [2019-10-14 23:15:23,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-14 23:15:23,939 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:23,940 INFO L380 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-10-14 23:15:23,940 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:23,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:23,941 INFO L82 PathProgramCache]: Analyzing trace with hash 348902212, now seen corresponding path program 1 times [2019-10-14 23:15:23,941 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:23,941 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513507073] [2019-10-14 23:15:23,941 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:23,942 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:23,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:23,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:24,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:24,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:24,191 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 23:15:24,192 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513507073] [2019-10-14 23:15:24,192 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444200349] [2019-10-14 23:15:24,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:15:24,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:24,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-14 23:15:24,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:15:24,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:15:24,348 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 23:15:24,349 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:15:24,349 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 14 [2019-10-14 23:15:24,350 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782913721] [2019-10-14 23:15:24,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 23:15:24,351 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:24,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 23:15:24,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-10-14 23:15:24,352 INFO L87 Difference]: Start difference. First operand 244 states and 393 transitions. Second operand 7 states. [2019-10-14 23:15:24,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:24,549 INFO L93 Difference]: Finished difference Result 251 states and 399 transitions. [2019-10-14 23:15:24,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:15:24,550 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-10-14 23:15:24,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:24,557 INFO L225 Difference]: With dead ends: 251 [2019-10-14 23:15:24,557 INFO L226 Difference]: Without dead ends: 249 [2019-10-14 23:15:24,559 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-10-14 23:15:24,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-10-14 23:15:24,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 248. [2019-10-14 23:15:24,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-10-14 23:15:24,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 396 transitions. [2019-10-14 23:15:24,603 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 396 transitions. Word has length 28 [2019-10-14 23:15:24,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:24,603 INFO L462 AbstractCegarLoop]: Abstraction has 248 states and 396 transitions. [2019-10-14 23:15:24,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 23:15:24,604 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 396 transitions. [2019-10-14 23:15:24,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-14 23:15:24,606 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:24,607 INFO L380 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-10-14 23:15:24,810 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:15:24,814 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:24,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:24,814 INFO L82 PathProgramCache]: Analyzing trace with hash -2096231521, now seen corresponding path program 1 times [2019-10-14 23:15:24,814 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:24,814 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615271980] [2019-10-14 23:15:24,814 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:24,814 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:24,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:24,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:24,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:24,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:24,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:24,889 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-14 23:15:24,890 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615271980] [2019-10-14 23:15:24,890 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:24,890 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-14 23:15:24,891 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048409233] [2019-10-14 23:15:24,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 23:15:24,891 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:24,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 23:15:24,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:15:24,892 INFO L87 Difference]: Start difference. First operand 248 states and 396 transitions. Second operand 7 states. [2019-10-14 23:15:25,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:25,202 INFO L93 Difference]: Finished difference Result 417 states and 695 transitions. [2019-10-14 23:15:25,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 23:15:25,203 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-10-14 23:15:25,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:25,207 INFO L225 Difference]: With dead ends: 417 [2019-10-14 23:15:25,207 INFO L226 Difference]: Without dead ends: 415 [2019-10-14 23:15:25,208 INFO L600 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-10-14 23:15:25,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2019-10-14 23:15:25,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 371. [2019-10-14 23:15:25,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2019-10-14 23:15:25,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 617 transitions. [2019-10-14 23:15:25,263 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 617 transitions. Word has length 31 [2019-10-14 23:15:25,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:25,263 INFO L462 AbstractCegarLoop]: Abstraction has 371 states and 617 transitions. [2019-10-14 23:15:25,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 23:15:25,264 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 617 transitions. [2019-10-14 23:15:25,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-14 23:15:25,265 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:25,265 INFO L380 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-10-14 23:15:25,265 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:25,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:25,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1955682911, now seen corresponding path program 1 times [2019-10-14 23:15:25,266 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:25,266 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325154381] [2019-10-14 23:15:25,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:25,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:25,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:25,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:25,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:25,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:25,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:25,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:25,325 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-14 23:15:25,325 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325154381] [2019-10-14 23:15:25,326 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:25,326 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-14 23:15:25,326 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142537506] [2019-10-14 23:15:25,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 23:15:25,327 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:25,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 23:15:25,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:15:25,327 INFO L87 Difference]: Start difference. First operand 371 states and 617 transitions. Second operand 7 states. [2019-10-14 23:15:25,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:25,610 INFO L93 Difference]: Finished difference Result 392 states and 648 transitions. [2019-10-14 23:15:25,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 23:15:25,611 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-10-14 23:15:25,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:25,614 INFO L225 Difference]: With dead ends: 392 [2019-10-14 23:15:25,614 INFO L226 Difference]: Without dead ends: 390 [2019-10-14 23:15:25,615 INFO L600 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-10-14 23:15:25,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-10-14 23:15:25,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 378. [2019-10-14 23:15:25,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-10-14 23:15:25,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 626 transitions. [2019-10-14 23:15:25,661 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 626 transitions. Word has length 31 [2019-10-14 23:15:25,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:25,661 INFO L462 AbstractCegarLoop]: Abstraction has 378 states and 626 transitions. [2019-10-14 23:15:25,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 23:15:25,661 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 626 transitions. [2019-10-14 23:15:25,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-14 23:15:25,663 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:25,663 INFO L380 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-10-14 23:15:25,664 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:25,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:25,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1751188594, now seen corresponding path program 1 times [2019-10-14 23:15:25,665 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:25,666 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713698821] [2019-10-14 23:15:25,666 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:25,666 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:25,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:25,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:25,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:25,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:25,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:25,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:25,792 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-14 23:15:25,793 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713698821] [2019-10-14 23:15:25,793 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167224559] [2019-10-14 23:15:25,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:15:25,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:25,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-14 23:15:25,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:15:25,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:15:25,924 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-14 23:15:25,924 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:15:25,924 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2019-10-14 23:15:25,925 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642366796] [2019-10-14 23:15:25,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 23:15:25,927 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:25,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 23:15:25,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-10-14 23:15:25,928 INFO L87 Difference]: Start difference. First operand 378 states and 626 transitions. Second operand 7 states. [2019-10-14 23:15:26,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:26,125 INFO L93 Difference]: Finished difference Result 440 states and 727 transitions. [2019-10-14 23:15:26,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 23:15:26,126 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-10-14 23:15:26,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:26,131 INFO L225 Difference]: With dead ends: 440 [2019-10-14 23:15:26,131 INFO L226 Difference]: Without dead ends: 438 [2019-10-14 23:15:26,133 INFO L600 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-10-14 23:15:26,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-10-14 23:15:26,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 382. [2019-10-14 23:15:26,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-10-14 23:15:26,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 629 transitions. [2019-10-14 23:15:26,179 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 629 transitions. Word has length 40 [2019-10-14 23:15:26,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:26,179 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 629 transitions. [2019-10-14 23:15:26,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 23:15:26,180 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 629 transitions. [2019-10-14 23:15:26,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-14 23:15:26,181 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:26,181 INFO L380 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-10-14 23:15:26,389 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:15:26,389 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:26,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:26,390 INFO L82 PathProgramCache]: Analyzing trace with hash 454341926, now seen corresponding path program 1 times [2019-10-14 23:15:26,391 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:26,392 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321763744] [2019-10-14 23:15:26,392 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:26,392 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:26,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:26,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:26,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:26,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:26,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:26,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:26,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:26,486 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-14 23:15:26,487 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321763744] [2019-10-14 23:15:26,487 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:26,487 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-14 23:15:26,488 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372527501] [2019-10-14 23:15:26,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 23:15:26,488 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:26,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 23:15:26,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:15:26,489 INFO L87 Difference]: Start difference. First operand 382 states and 629 transitions. Second operand 7 states. [2019-10-14 23:15:26,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:26,754 INFO L93 Difference]: Finished difference Result 435 states and 701 transitions. [2019-10-14 23:15:26,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 23:15:26,755 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-10-14 23:15:26,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:26,759 INFO L225 Difference]: With dead ends: 435 [2019-10-14 23:15:26,759 INFO L226 Difference]: Without dead ends: 433 [2019-10-14 23:15:26,760 INFO L600 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-10-14 23:15:26,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2019-10-14 23:15:26,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 312. [2019-10-14 23:15:26,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-10-14 23:15:26,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 499 transitions. [2019-10-14 23:15:26,817 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 499 transitions. Word has length 41 [2019-10-14 23:15:26,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:26,817 INFO L462 AbstractCegarLoop]: Abstraction has 312 states and 499 transitions. [2019-10-14 23:15:26,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 23:15:26,817 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 499 transitions. [2019-10-14 23:15:26,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-14 23:15:26,821 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:26,821 INFO L380 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-10-14 23:15:26,822 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:26,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:26,822 INFO L82 PathProgramCache]: Analyzing trace with hash 867583944, now seen corresponding path program 1 times [2019-10-14 23:15:26,823 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:26,823 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815674152] [2019-10-14 23:15:26,823 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:26,824 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:26,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:26,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:26,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:26,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:26,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:26,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:26,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:26,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:26,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:26,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:26,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:26,973 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-14 23:15:26,974 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815674152] [2019-10-14 23:15:26,974 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245461272] [2019-10-14 23:15:26,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:15:27,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:27,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-14 23:15:27,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:15:27,211 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-10-14 23:15:27,211 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:15:27,212 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 12 [2019-10-14 23:15:27,212 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212515833] [2019-10-14 23:15:27,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:15:27,213 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:27,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:15:27,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-10-14 23:15:27,214 INFO L87 Difference]: Start difference. First operand 312 states and 499 transitions. Second operand 6 states. [2019-10-14 23:15:27,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:27,489 INFO L93 Difference]: Finished difference Result 679 states and 1090 transitions. [2019-10-14 23:15:27,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 23:15:27,490 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-10-14 23:15:27,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:27,493 INFO L225 Difference]: With dead ends: 679 [2019-10-14 23:15:27,493 INFO L226 Difference]: Without dead ends: 395 [2019-10-14 23:15:27,495 INFO L600 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-10-14 23:15:27,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-10-14 23:15:27,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 360. [2019-10-14 23:15:27,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-10-14 23:15:27,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 583 transitions. [2019-10-14 23:15:27,540 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 583 transitions. Word has length 61 [2019-10-14 23:15:27,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:27,540 INFO L462 AbstractCegarLoop]: Abstraction has 360 states and 583 transitions. [2019-10-14 23:15:27,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:15:27,540 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 583 transitions. [2019-10-14 23:15:27,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-14 23:15:27,543 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:27,543 INFO L380 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-10-14 23:15:27,752 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:15:27,752 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:27,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:27,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1184410446, now seen corresponding path program 1 times [2019-10-14 23:15:27,753 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:27,754 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901375856] [2019-10-14 23:15:27,754 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:27,755 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:27,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:27,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:27,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:27,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:27,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:27,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:27,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:27,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:27,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:27,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:27,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:27,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:27,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:27,966 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-10-14 23:15:27,967 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901375856] [2019-10-14 23:15:27,967 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570669237] [2019-10-14 23:15:27,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:15:28,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:28,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-14 23:15:28,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:15:28,269 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 88 proven. 2 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-10-14 23:15:28,269 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:15:28,270 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 19 [2019-10-14 23:15:28,270 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117827531] [2019-10-14 23:15:28,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-14 23:15:28,271 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:28,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-14 23:15:28,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2019-10-14 23:15:28,271 INFO L87 Difference]: Start difference. First operand 360 states and 583 transitions. Second operand 19 states. [2019-10-14 23:15:33,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:33,717 INFO L93 Difference]: Finished difference Result 982 states and 1577 transitions. [2019-10-14 23:15:33,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-10-14 23:15:33,718 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 75 [2019-10-14 23:15:33,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:33,721 INFO L225 Difference]: With dead ends: 982 [2019-10-14 23:15:33,721 INFO L226 Difference]: Without dead ends: 379 [2019-10-14 23:15:33,726 INFO L600 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-10-14 23:15:33,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-10-14 23:15:33,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 210. [2019-10-14 23:15:33,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-10-14 23:15:33,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 308 transitions. [2019-10-14 23:15:33,757 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 308 transitions. Word has length 75 [2019-10-14 23:15:33,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:33,757 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 308 transitions. [2019-10-14 23:15:33,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-14 23:15:33,757 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 308 transitions. [2019-10-14 23:15:33,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-14 23:15:33,759 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:33,759 INFO L380 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-10-14 23:15:33,963 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:15:33,963 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:33,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:33,964 INFO L82 PathProgramCache]: Analyzing trace with hash -16221646, now seen corresponding path program 1 times [2019-10-14 23:15:33,964 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:33,964 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546995631] [2019-10-14 23:15:33,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:33,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:33,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:33,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:34,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:34,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:34,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:34,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:34,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:34,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:34,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:34,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:34,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:34,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:34,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:34,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:34,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:34,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:34,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:34,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:34,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:34,159 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 33 proven. 19 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-10-14 23:15:34,160 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546995631] [2019-10-14 23:15:34,160 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509852645] [2019-10-14 23:15:34,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:15:34,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:34,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-14 23:15:34,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:15:34,513 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 153 proven. 7 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2019-10-14 23:15:34,514 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:15:34,514 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2019-10-14 23:15:34,514 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802210182] [2019-10-14 23:15:34,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-14 23:15:34,515 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:34,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-14 23:15:34,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-10-14 23:15:34,516 INFO L87 Difference]: Start difference. First operand 210 states and 308 transitions. Second operand 19 states. [2019-10-14 23:15:39,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:39,580 INFO L93 Difference]: Finished difference Result 794 states and 1232 transitions. [2019-10-14 23:15:39,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-10-14 23:15:39,581 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 110 [2019-10-14 23:15:39,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:39,586 INFO L225 Difference]: With dead ends: 794 [2019-10-14 23:15:39,587 INFO L226 Difference]: Without dead ends: 617 [2019-10-14 23:15:39,589 INFO L600 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-10-14 23:15:39,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-10-14 23:15:39,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 421. [2019-10-14 23:15:39,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-10-14 23:15:39,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 661 transitions. [2019-10-14 23:15:39,650 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 661 transitions. Word has length 110 [2019-10-14 23:15:39,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:39,651 INFO L462 AbstractCegarLoop]: Abstraction has 421 states and 661 transitions. [2019-10-14 23:15:39,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-14 23:15:39,651 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 661 transitions. [2019-10-14 23:15:39,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-14 23:15:39,659 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:39,659 INFO L380 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-10-14 23:15:39,863 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:15:39,864 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:39,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:39,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1522118384, now seen corresponding path program 1 times [2019-10-14 23:15:39,865 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:39,865 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104109705] [2019-10-14 23:15:39,865 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:39,865 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:39,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:39,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:39,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:39,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:39,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:39,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:39,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:39,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:39,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:39,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:39,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:39,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:39,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:39,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:39,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:39,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:39,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:39,981 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 45 proven. 7 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-10-14 23:15:39,981 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104109705] [2019-10-14 23:15:39,981 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30327509] [2019-10-14 23:15:39,981 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-10-14 23:15:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:40,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-14 23:15:40,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:15:40,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:15:40,119 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 45 proven. 7 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-10-14 23:15:40,119 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:15:40,120 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-10-14 23:15:40,120 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429000470] [2019-10-14 23:15:40,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:15:40,121 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:40,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:15:40,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:15:40,121 INFO L87 Difference]: Start difference. First operand 421 states and 661 transitions. Second operand 10 states. [2019-10-14 23:15:40,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:40,484 INFO L93 Difference]: Finished difference Result 475 states and 741 transitions. [2019-10-14 23:15:40,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-14 23:15:40,484 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 110 [2019-10-14 23:15:40,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:40,489 INFO L225 Difference]: With dead ends: 475 [2019-10-14 23:15:40,489 INFO L226 Difference]: Without dead ends: 473 [2019-10-14 23:15:40,489 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 143 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-10-14 23:15:40,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-10-14 23:15:40,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 425. [2019-10-14 23:15:40,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-10-14 23:15:40,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 664 transitions. [2019-10-14 23:15:40,554 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 664 transitions. Word has length 110 [2019-10-14 23:15:40,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:40,555 INFO L462 AbstractCegarLoop]: Abstraction has 425 states and 664 transitions. [2019-10-14 23:15:40,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:15:40,555 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 664 transitions. [2019-10-14 23:15:40,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-14 23:15:40,558 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:40,558 INFO L380 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-10-14 23:15:40,770 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:15:40,770 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:40,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:40,771 INFO L82 PathProgramCache]: Analyzing trace with hash 217536387, now seen corresponding path program 2 times [2019-10-14 23:15:40,771 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:40,772 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069270231] [2019-10-14 23:15:40,772 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:40,772 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:40,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:40,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:40,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:40,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:40,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:40,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:40,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:40,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:40,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:40,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:40,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:40,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:40,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:40,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:40,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:40,892 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 35 proven. 20 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-10-14 23:15:40,892 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069270231] [2019-10-14 23:15:40,896 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017745392] [2019-10-14 23:15:40,897 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-10-14 23:15:40,956 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 23:15:40,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:15:40,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-14 23:15:40,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:15:41,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:15:41,130 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 34 proven. 21 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-10-14 23:15:41,130 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:15:41,130 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 15 [2019-10-14 23:15:41,131 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360441913] [2019-10-14 23:15:41,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-14 23:15:41,131 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:41,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-14 23:15:41,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-10-14 23:15:41,132 INFO L87 Difference]: Start difference. First operand 425 states and 664 transitions. Second operand 15 states. [2019-10-14 23:15:42,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:42,068 INFO L93 Difference]: Finished difference Result 641 states and 1003 transitions. [2019-10-14 23:15:42,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-14 23:15:42,068 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 115 [2019-10-14 23:15:42,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:42,073 INFO L225 Difference]: With dead ends: 641 [2019-10-14 23:15:42,073 INFO L226 Difference]: Without dead ends: 529 [2019-10-14 23:15:42,074 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 145 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=430, Unknown=0, NotChecked=0, Total=552 [2019-10-14 23:15:42,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2019-10-14 23:15:42,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 431. [2019-10-14 23:15:42,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2019-10-14 23:15:42,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 663 transitions. [2019-10-14 23:15:42,129 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 663 transitions. Word has length 115 [2019-10-14 23:15:42,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:42,130 INFO L462 AbstractCegarLoop]: Abstraction has 431 states and 663 transitions. [2019-10-14 23:15:42,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-14 23:15:42,130 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 663 transitions. [2019-10-14 23:15:42,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-14 23:15:42,132 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:42,133 INFO L380 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-10-14 23:15:42,339 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:15:42,340 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:42,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:42,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1046126307, now seen corresponding path program 2 times [2019-10-14 23:15:42,341 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:42,341 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326426239] [2019-10-14 23:15:42,341 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:42,341 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:42,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:42,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:42,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:42,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:42,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:42,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:42,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:42,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:42,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:42,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:42,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:42,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:42,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:42,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:42,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:42,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:42,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:42,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:42,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:42,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:42,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:42,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:42,583 INFO L134 CoverageAnalysis]: Checked inductivity of 909 backedges. 42 proven. 27 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-10-14 23:15:42,583 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326426239] [2019-10-14 23:15:42,583 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824734803] [2019-10-14 23:15:42,584 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-10-14 23:15:42,651 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 23:15:42,652 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:15:42,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-14 23:15:42,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:15:42,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:15:42,929 INFO L134 CoverageAnalysis]: Checked inductivity of 909 backedges. 57 proven. 12 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-10-14 23:15:42,929 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:15:42,929 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2019-10-14 23:15:42,930 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915787116] [2019-10-14 23:15:42,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-14 23:15:42,930 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:42,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-14 23:15:42,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2019-10-14 23:15:42,931 INFO L87 Difference]: Start difference. First operand 431 states and 663 transitions. Second operand 21 states. [2019-10-14 23:15:45,629 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2019-10-14 23:15:46,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:46,812 INFO L93 Difference]: Finished difference Result 723 states and 1144 transitions. [2019-10-14 23:15:46,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-14 23:15:46,813 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 137 [2019-10-14 23:15:46,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:46,813 INFO L225 Difference]: With dead ends: 723 [2019-10-14 23:15:46,813 INFO L226 Difference]: Without dead ends: 0 [2019-10-14 23:15:46,818 INFO L600 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-10-14 23:15:46,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-14 23:15:46,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-14 23:15:46,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-14 23:15:46,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-14 23:15:46,820 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 137 [2019-10-14 23:15:46,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:46,820 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-14 23:15:46,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-14 23:15:46,820 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-14 23:15:46,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-14 23:15:47,024 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:15:47,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-14 23:15:47,242 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 219 [2019-10-14 23:15:47,660 WARN L191 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 246 DAG size of output: 199 [2019-10-14 23:15:48,027 WARN L191 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 203 [2019-10-14 23:15:48,297 WARN L191 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 246 DAG size of output: 199 [2019-10-14 23:15:48,693 WARN L191 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 215 [2019-10-14 23:15:49,249 WARN L191 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 269 DAG size of output: 210 [2019-10-14 23:15:49,359 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 150 [2019-10-14 23:15:49,685 WARN L191 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 246 DAG size of output: 199 [2019-10-14 23:15:50,093 WARN L191 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 253 [2019-10-14 23:15:50,730 WARN L191 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 414 DAG size of output: 343 [2019-10-14 23:15:51,035 WARN L191 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 301 DAG size of output: 266 [2019-10-14 23:15:51,487 WARN L191 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 423 DAG size of output: 358 [2019-10-14 23:15:56,390 WARN L191 SmtUtils]: Spent 4.75 s on a formula simplification. DAG size of input: 216 DAG size of output: 98