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/array-examples/sorting_selectionsort_ground-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-01 22:29:18,730 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-01 22:29:18,732 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-01 22:29:18,753 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-01 22:29:18,754 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-01 22:29:18,755 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-01 22:29:18,757 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-01 22:29:18,758 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-01 22:29:18,762 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-01 22:29:18,766 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-01 22:29:18,767 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-01 22:29:18,768 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-01 22:29:18,769 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-01 22:29:18,771 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-01 22:29:18,774 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-01 22:29:18,775 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-01 22:29:18,779 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-01 22:29:18,780 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-01 22:29:18,785 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-01 22:29:18,789 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-01 22:29:18,791 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-01 22:29:18,792 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-01 22:29:18,795 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-01 22:29:18,796 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-01 22:29:18,802 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-01 22:29:18,803 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-01 22:29:18,803 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-01 22:29:18,804 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-01 22:29:18,805 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-01 22:29:18,806 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-01 22:29:18,806 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-01 22:29:18,808 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-01 22:29:18,809 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-01 22:29:18,809 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-01 22:29:18,811 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-01 22:29:18,811 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-01 22:29:18,812 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-01 22:29:18,814 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-01 22:29:18,814 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-01 22:29:18,816 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-01 22:29:18,817 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-01 22:29:18,819 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-01 22:29:18,841 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-01 22:29:18,841 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-01 22:29:18,843 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-01 22:29:18,844 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-01 22:29:18,844 INFO L138 SettingsManager]: * Use SBE=true [2019-10-01 22:29:18,844 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-01 22:29:18,844 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-01 22:29:18,844 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-01 22:29:18,845 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-01 22:29:18,845 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-01 22:29:18,846 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-01 22:29:18,846 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-01 22:29:18,846 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-01 22:29:18,847 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-01 22:29:18,847 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-01 22:29:18,847 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-01 22:29:18,847 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-01 22:29:18,848 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-01 22:29:18,848 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-01 22:29:18,848 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-01 22:29:18,849 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-01 22:29:18,849 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 22:29:18,849 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-01 22:29:18,849 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-01 22:29:18,850 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-01 22:29:18,850 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-01 22:29:18,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-01 22:29:18,850 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-01 22:29:18,851 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-01 22:29:18,900 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-01 22:29:18,918 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-01 22:29:18,923 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-01 22:29:18,925 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-01 22:29:18,926 INFO L275 PluginConnector]: CDTParser initialized [2019-10-01 22:29:18,926 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sorting_selectionsort_ground-2.i [2019-10-01 22:29:18,992 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83df02ef4/cc5f02a02f65441682c784d4b885fdb0/FLAGee8abcb2b [2019-10-01 22:29:19,442 INFO L306 CDTParser]: Found 1 translation units. [2019-10-01 22:29:19,443 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sorting_selectionsort_ground-2.i [2019-10-01 22:29:19,450 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83df02ef4/cc5f02a02f65441682c784d4b885fdb0/FLAGee8abcb2b [2019-10-01 22:29:19,776 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83df02ef4/cc5f02a02f65441682c784d4b885fdb0 [2019-10-01 22:29:19,789 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-01 22:29:19,791 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-01 22:29:19,793 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-01 22:29:19,793 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-01 22:29:19,797 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-01 22:29:19,798 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:29:19" (1/1) ... [2019-10-01 22:29:19,802 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63ef0088 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:29:19, skipping insertion in model container [2019-10-01 22:29:19,802 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:29:19" (1/1) ... [2019-10-01 22:29:19,811 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-01 22:29:19,831 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-01 22:29:20,040 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:29:20,044 INFO L188 MainTranslator]: Completed pre-run [2019-10-01 22:29:20,069 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:29:20,183 INFO L192 MainTranslator]: Completed translation [2019-10-01 22:29:20,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:29:20 WrapperNode [2019-10-01 22:29:20,185 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-01 22:29:20,186 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-01 22:29:20,186 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-01 22:29:20,186 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-01 22:29:20,201 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:29:20" (1/1) ... [2019-10-01 22:29:20,201 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:29:20" (1/1) ... [2019-10-01 22:29:20,225 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:29:20" (1/1) ... [2019-10-01 22:29:20,225 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:29:20" (1/1) ... [2019-10-01 22:29:20,234 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:29:20" (1/1) ... [2019-10-01 22:29:20,245 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:29:20" (1/1) ... [2019-10-01 22:29:20,247 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:29:20" (1/1) ... [2019-10-01 22:29:20,249 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-01 22:29:20,250 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-01 22:29:20,250 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-01 22:29:20,250 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-01 22:29:20,258 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:29: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-01 22:29:20,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-01 22:29:20,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-01 22:29:20,311 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-01 22:29:20,311 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-01 22:29:20,312 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-01 22:29:20,312 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-01 22:29:20,312 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-01 22:29:20,312 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-01 22:29:20,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-01 22:29:20,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-01 22:29:20,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-01 22:29:20,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-01 22:29:20,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-01 22:29:20,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-01 22:29:20,652 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-01 22:29:20,653 INFO L283 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-01 22:29:20,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:29:20 BoogieIcfgContainer [2019-10-01 22:29:20,654 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-01 22:29:20,655 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-01 22:29:20,655 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-01 22:29:20,659 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-01 22:29:20,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.10 10:29:19" (1/3) ... [2019-10-01 22:29:20,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6734fde8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:29:20, skipping insertion in model container [2019-10-01 22:29:20,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:29:20" (2/3) ... [2019-10-01 22:29:20,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6734fde8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:29:20, skipping insertion in model container [2019-10-01 22:29:20,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:29:20" (3/3) ... [2019-10-01 22:29:20,662 INFO L109 eAbstractionObserver]: Analyzing ICFG sorting_selectionsort_ground-2.i [2019-10-01 22:29:20,673 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-01 22:29:20,681 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-01 22:29:20,717 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-01 22:29:20,743 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-01 22:29:20,744 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-01 22:29:20,744 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-01 22:29:20,744 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-01 22:29:20,744 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-01 22:29:20,744 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-01 22:29:20,744 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-01 22:29:20,744 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-01 22:29:20,745 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-01 22:29:20,761 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2019-10-01 22:29:20,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-01 22:29:20,767 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:20,768 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:20,770 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:20,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:20,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1156372912, now seen corresponding path program 1 times [2019-10-01 22:29:20,776 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:20,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:20,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:20,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:29:20,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:20,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:20,908 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-01 22:29:20,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:29:20,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-01 22:29:20,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-01 22:29:20,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-01 22:29:20,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 22:29:20,938 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2019-10-01 22:29:20,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:20,970 INFO L93 Difference]: Finished difference Result 82 states and 123 transitions. [2019-10-01 22:29:20,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-01 22:29:20,971 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-10-01 22:29:20,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:20,983 INFO L225 Difference]: With dead ends: 82 [2019-10-01 22:29:20,983 INFO L226 Difference]: Without dead ends: 40 [2019-10-01 22:29:20,987 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 22:29:21,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-01 22:29:21,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-10-01 22:29:21,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-01 22:29:21,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2019-10-01 22:29:21,038 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 16 [2019-10-01 22:29:21,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:21,039 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2019-10-01 22:29:21,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-01 22:29:21,039 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2019-10-01 22:29:21,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-01 22:29:21,040 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:21,041 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:21,041 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:21,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:21,041 INFO L82 PathProgramCache]: Analyzing trace with hash -2078459264, now seen corresponding path program 1 times [2019-10-01 22:29:21,042 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:21,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:21,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:21,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:29:21,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:21,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:21,108 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-01 22:29:21,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:29:21,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 22:29:21,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 22:29:21,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 22:29:21,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:29:21,111 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand 3 states. [2019-10-01 22:29:21,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:21,154 INFO L93 Difference]: Finished difference Result 74 states and 96 transitions. [2019-10-01 22:29:21,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:29:21,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-01 22:29:21,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:21,156 INFO L225 Difference]: With dead ends: 74 [2019-10-01 22:29:21,157 INFO L226 Difference]: Without dead ends: 42 [2019-10-01 22:29:21,158 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01 22:29:21,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-01 22:29:21,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-10-01 22:29:21,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-01 22:29:21,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2019-10-01 22:29:21,169 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 16 [2019-10-01 22:29:21,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:21,169 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2019-10-01 22:29:21,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 22:29:21,170 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2019-10-01 22:29:21,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-01 22:29:21,171 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:21,171 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:21,171 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:21,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:21,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1609541534, now seen corresponding path program 1 times [2019-10-01 22:29:21,172 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:21,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:21,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:21,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:29:21,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:21,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:21,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 22:29:21,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:29:21,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 22:29:21,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 22:29:21,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 22:29:21,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:29:21,258 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand 3 states. [2019-10-01 22:29:21,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:21,363 INFO L93 Difference]: Finished difference Result 72 states and 93 transitions. [2019-10-01 22:29:21,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:29:21,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-01 22:29:21,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:21,366 INFO L225 Difference]: With dead ends: 72 [2019-10-01 22:29:21,366 INFO L226 Difference]: Without dead ends: 59 [2019-10-01 22:29:21,368 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01 22:29:21,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-01 22:29:21,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2019-10-01 22:29:21,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-01 22:29:21,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2019-10-01 22:29:21,392 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 18 [2019-10-01 22:29:21,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:21,393 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2019-10-01 22:29:21,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 22:29:21,393 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2019-10-01 22:29:21,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-01 22:29:21,394 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:21,396 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:21,396 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:21,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:21,397 INFO L82 PathProgramCache]: Analyzing trace with hash -898844059, now seen corresponding path program 1 times [2019-10-01 22:29:21,397 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:21,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:21,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:21,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:29:21,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:21,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:21,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 22:29:21,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:29:21,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 22:29:21,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 22:29:21,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 22:29:21,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:29:21,471 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand 3 states. [2019-10-01 22:29:21,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:21,557 INFO L93 Difference]: Finished difference Result 90 states and 119 transitions. [2019-10-01 22:29:21,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:29:21,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-01 22:29:21,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:21,559 INFO L225 Difference]: With dead ends: 90 [2019-10-01 22:29:21,560 INFO L226 Difference]: Without dead ends: 59 [2019-10-01 22:29:21,563 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01 22:29:21,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-01 22:29:21,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 46. [2019-10-01 22:29:21,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-01 22:29:21,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 59 transitions. [2019-10-01 22:29:21,582 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 59 transitions. Word has length 20 [2019-10-01 22:29:21,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:21,583 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 59 transitions. [2019-10-01 22:29:21,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 22:29:21,583 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 59 transitions. [2019-10-01 22:29:21,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-01 22:29:21,584 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:21,585 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:21,585 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:21,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:21,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1708190685, now seen corresponding path program 1 times [2019-10-01 22:29:21,586 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:21,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:21,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:21,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:29:21,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:21,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:21,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:29:21,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:21,653 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:29:21,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:21,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:21,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 22:29:21,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:21,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:29:21,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:21,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-01 22:29:21,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-01 22:29:21,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-01 22:29:21,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 22:29:21,779 INFO L87 Difference]: Start difference. First operand 46 states and 59 transitions. Second operand 5 states. [2019-10-01 22:29:21,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:21,807 INFO L93 Difference]: Finished difference Result 86 states and 112 transitions. [2019-10-01 22:29:21,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-01 22:29:21,807 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-10-01 22:29:21,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:21,809 INFO L225 Difference]: With dead ends: 86 [2019-10-01 22:29:21,809 INFO L226 Difference]: Without dead ends: 49 [2019-10-01 22:29:21,810 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 22:29:21,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-01 22:29:21,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2019-10-01 22:29:21,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-01 22:29:21,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. [2019-10-01 22:29:21,817 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 61 transitions. Word has length 20 [2019-10-01 22:29:21,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:21,817 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 61 transitions. [2019-10-01 22:29:21,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-01 22:29:21,818 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2019-10-01 22:29:21,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-01 22:29:21,819 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:21,819 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:21,819 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:21,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:21,820 INFO L82 PathProgramCache]: Analyzing trace with hash 700215557, now seen corresponding path program 2 times [2019-10-01 22:29:21,820 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:21,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:21,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:21,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:29:21,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:21,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:21,877 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:29:21,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:21,878 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:29:21,902 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:21,930 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-10-01 22:29:21,931 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:21,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 22:29:21,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:21,977 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-01 22:29:21,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-01 22:29:21,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-10-01 22:29:21,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-01 22:29:21,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-01 22:29:21,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-01 22:29:21,983 INFO L87 Difference]: Start difference. First operand 48 states and 61 transitions. Second operand 7 states. [2019-10-01 22:29:22,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:22,144 INFO L93 Difference]: Finished difference Result 113 states and 151 transitions. [2019-10-01 22:29:22,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 22:29:22,146 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-10-01 22:29:22,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:22,147 INFO L225 Difference]: With dead ends: 113 [2019-10-01 22:29:22,148 INFO L226 Difference]: Without dead ends: 76 [2019-10-01 22:29:22,148 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:29:22,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-01 22:29:22,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 51. [2019-10-01 22:29:22,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-01 22:29:22,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2019-10-01 22:29:22,167 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 22 [2019-10-01 22:29:22,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:22,167 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2019-10-01 22:29:22,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-01 22:29:22,168 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2019-10-01 22:29:22,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-01 22:29:22,169 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:22,169 INFO L411 BasicCegarLoop]: trace histogram [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-01 22:29:22,170 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:22,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:22,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1768902798, now seen corresponding path program 1 times [2019-10-01 22:29:22,170 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:22,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:22,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:22,177 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:22,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:22,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:22,289 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 22:29:22,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:22,289 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:22,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:29:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:22,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 22:29:22,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:22,376 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 22:29:22,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:22,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-10-01 22:29:22,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-01 22:29:22,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-01 22:29:22,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-01 22:29:22,385 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand 7 states. [2019-10-01 22:29:22,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:22,412 INFO L93 Difference]: Finished difference Result 92 states and 118 transitions. [2019-10-01 22:29:22,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-01 22:29:22,413 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-10-01 22:29:22,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:22,413 INFO L225 Difference]: With dead ends: 92 [2019-10-01 22:29:22,414 INFO L226 Difference]: Without dead ends: 54 [2019-10-01 22:29:22,414 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-01 22:29:22,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-01 22:29:22,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-10-01 22:29:22,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-01 22:29:22,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2019-10-01 22:29:22,421 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 27 [2019-10-01 22:29:22,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:22,422 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2019-10-01 22:29:22,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-01 22:29:22,422 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2019-10-01 22:29:22,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-01 22:29:22,423 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:22,423 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:22,423 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:22,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:22,424 INFO L82 PathProgramCache]: Analyzing trace with hash 2135781456, now seen corresponding path program 2 times [2019-10-01 22:29:22,424 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:22,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:22,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:22,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:29:22,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:22,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:22,525 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 22:29:22,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:22,525 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:29:22,555 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:22,581 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-10-01 22:29:22,582 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:22,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 22:29:22,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:22,615 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-01 22:29:22,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-01 22:29:22,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2019-10-01 22:29:22,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-01 22:29:22,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-01 22:29:22,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-10-01 22:29:22,621 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand 9 states. [2019-10-01 22:29:22,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:22,774 INFO L93 Difference]: Finished difference Result 110 states and 144 transitions. [2019-10-01 22:29:22,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-01 22:29:22,774 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2019-10-01 22:29:22,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:22,775 INFO L225 Difference]: With dead ends: 110 [2019-10-01 22:29:22,776 INFO L226 Difference]: Without dead ends: 72 [2019-10-01 22:29:22,776 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-10-01 22:29:22,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-01 22:29:22,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2019-10-01 22:29:22,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-01 22:29:22,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 83 transitions. [2019-10-01 22:29:22,784 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 83 transitions. Word has length 29 [2019-10-01 22:29:22,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:22,784 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 83 transitions. [2019-10-01 22:29:22,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-01 22:29:22,785 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 83 transitions. [2019-10-01 22:29:22,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-01 22:29:22,786 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:22,786 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:22,786 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:22,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:22,787 INFO L82 PathProgramCache]: Analyzing trace with hash -144512862, now seen corresponding path program 1 times [2019-10-01 22:29:22,787 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:22,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:22,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:22,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:22,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:22,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:22,872 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 22:29:22,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:22,873 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:29:22,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:22,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:22,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 22:29:22,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:22,946 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Stream closed [2019-10-01 22:29:22,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:22,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-10-01 22:29:22,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-01 22:29:22,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-01 22:29:22,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-01 22:29:22,962 INFO L87 Difference]: Start difference. First operand 65 states and 83 transitions. Second operand 9 states. [2019-10-01 22:29:23,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:23,015 INFO L93 Difference]: Finished difference Result 116 states and 152 transitions. [2019-10-01 22:29:23,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-01 22:29:23,016 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2019-10-01 22:29:23,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:23,019 INFO L225 Difference]: With dead ends: 116 [2019-10-01 22:29:23,019 INFO L226 Difference]: Without dead ends: 68 [2019-10-01 22:29:23,022 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-01 22:29:23,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-01 22:29:23,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-10-01 22:29:23,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-01 22:29:23,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. [2019-10-01 22:29:23,037 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 85 transitions. Word has length 32 [2019-10-01 22:29:23,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:23,037 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 85 transitions. [2019-10-01 22:29:23,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-01 22:29:23,037 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2019-10-01 22:29:23,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-01 22:29:23,038 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:23,039 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:23,039 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:23,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:23,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1097990788, now seen corresponding path program 2 times [2019-10-01 22:29:23,040 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:23,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:23,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:23,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:29:23,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:23,174 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 22:29:23,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:23,175 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:23,214 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:29:23,232 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-10-01 22:29:23,232 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:23,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-01 22:29:23,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:23,301 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:29:23,301 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 59 [2019-10-01 22:29:23,302 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:29:23,310 INFO L567 ElimStorePlain]: treesize reduction 25, result has 30.6 percent of original size [2019-10-01 22:29:23,311 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 22:29:23,311 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:1 [2019-10-01 22:29:23,329 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2019-10-01 22:29:23,330 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:29:23,332 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:29:23,333 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 22:29:23,333 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:23, output treesize:3 [2019-10-01 22:29:23,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:29:23,367 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-01 22:29:23,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-01 22:29:23,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2019-10-01 22:29:23,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-01 22:29:23,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-01 22:29:23,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-10-01 22:29:23,372 INFO L87 Difference]: Start difference. First operand 67 states and 85 transitions. Second operand 13 states. [2019-10-01 22:29:23,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:23,531 INFO L93 Difference]: Finished difference Result 127 states and 165 transitions. [2019-10-01 22:29:23,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-01 22:29:23,532 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2019-10-01 22:29:23,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:23,533 INFO L225 Difference]: With dead ends: 127 [2019-10-01 22:29:23,533 INFO L226 Difference]: Without dead ends: 79 [2019-10-01 22:29:23,534 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-10-01 22:29:23,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-10-01 22:29:23,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2019-10-01 22:29:23,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-01 22:29:23,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 94 transitions. [2019-10-01 22:29:23,550 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 94 transitions. Word has length 34 [2019-10-01 22:29:23,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:23,552 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 94 transitions. [2019-10-01 22:29:23,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-01 22:29:23,553 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 94 transitions. [2019-10-01 22:29:23,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-01 22:29:23,554 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:23,554 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 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-01 22:29:23,554 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:23,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:23,555 INFO L82 PathProgramCache]: Analyzing trace with hash 2072952274, now seen corresponding path program 1 times [2019-10-01 22:29:23,555 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:23,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:23,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:23,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:23,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:23,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:23,646 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-01 22:29:23,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:29:23,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-01 22:29:23,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-01 22:29:23,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-01 22:29:23,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-01 22:29:23,650 INFO L87 Difference]: Start difference. First operand 75 states and 94 transitions. Second operand 4 states. [2019-10-01 22:29:23,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:23,732 INFO L93 Difference]: Finished difference Result 139 states and 180 transitions. [2019-10-01 22:29:23,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-01 22:29:23,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-10-01 22:29:23,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:23,736 INFO L225 Difference]: With dead ends: 139 [2019-10-01 22:29:23,736 INFO L226 Difference]: Without dead ends: 98 [2019-10-01 22:29:23,737 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-01 22:29:23,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-10-01 22:29:23,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 77. [2019-10-01 22:29:23,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-01 22:29:23,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 96 transitions. [2019-10-01 22:29:23,745 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 96 transitions. Word has length 41 [2019-10-01 22:29:23,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:23,746 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 96 transitions. [2019-10-01 22:29:23,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-01 22:29:23,746 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 96 transitions. [2019-10-01 22:29:23,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-01 22:29:23,747 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:23,747 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 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-01 22:29:23,747 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:23,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:23,748 INFO L82 PathProgramCache]: Analyzing trace with hash -413702663, now seen corresponding path program 1 times [2019-10-01 22:29:23,748 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:23,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:23,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:23,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:29:23,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:23,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:23,825 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-10-01 22:29:23,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:23,826 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:29:23,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:23,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:23,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 22:29:23,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:23,977 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Stream closed [2019-10-01 22:29:23,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:23,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 14 [2019-10-01 22:29:23,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-01 22:29:23,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-01 22:29:23,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-10-01 22:29:23,992 INFO L87 Difference]: Start difference. First operand 77 states and 96 transitions. Second operand 14 states. [2019-10-01 22:29:24,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:24,348 INFO L93 Difference]: Finished difference Result 231 states and 314 transitions. [2019-10-01 22:29:24,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-01 22:29:24,349 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2019-10-01 22:29:24,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:24,350 INFO L225 Difference]: With dead ends: 231 [2019-10-01 22:29:24,351 INFO L226 Difference]: Without dead ends: 171 [2019-10-01 22:29:24,352 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2019-10-01 22:29:24,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-10-01 22:29:24,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 115. [2019-10-01 22:29:24,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-10-01 22:29:24,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 152 transitions. [2019-10-01 22:29:24,365 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 152 transitions. Word has length 44 [2019-10-01 22:29:24,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:24,366 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 152 transitions. [2019-10-01 22:29:24,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-01 22:29:24,366 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 152 transitions. [2019-10-01 22:29:24,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-01 22:29:24,367 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:24,367 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 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] [2019-10-01 22:29:24,368 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:24,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:24,368 INFO L82 PathProgramCache]: Analyzing trace with hash 96986128, now seen corresponding path program 2 times [2019-10-01 22:29:24,368 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:24,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:24,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:24,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:29:24,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:24,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:24,446 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-01 22:29:24,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:24,446 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:24,474 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:29:24,502 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:29:24,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:24,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 22:29:24,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:24,611 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-01 22:29:24,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:24,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 16 [2019-10-01 22:29:24,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-01 22:29:24,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-01 22:29:24,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-10-01 22:29:24,617 INFO L87 Difference]: Start difference. First operand 115 states and 152 transitions. Second operand 16 states. [2019-10-01 22:29:25,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:25,016 INFO L93 Difference]: Finished difference Result 359 states and 502 transitions. [2019-10-01 22:29:25,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-01 22:29:25,017 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2019-10-01 22:29:25,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:25,019 INFO L225 Difference]: With dead ends: 359 [2019-10-01 22:29:25,020 INFO L226 Difference]: Without dead ends: 263 [2019-10-01 22:29:25,021 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2019-10-01 22:29:25,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-10-01 22:29:25,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 129. [2019-10-01 22:29:25,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-10-01 22:29:25,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 172 transitions. [2019-10-01 22:29:25,035 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 172 transitions. Word has length 49 [2019-10-01 22:29:25,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:25,035 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 172 transitions. [2019-10-01 22:29:25,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-01 22:29:25,035 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 172 transitions. [2019-10-01 22:29:25,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-01 22:29:25,036 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:25,036 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:25,037 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:25,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:25,037 INFO L82 PathProgramCache]: Analyzing trace with hash 783862173, now seen corresponding path program 3 times [2019-10-01 22:29:25,037 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:25,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:25,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:25,039 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:25,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:25,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:25,114 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-10-01 22:29:25,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:25,114 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:29:25,142 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:25,173 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-01 22:29:25,173 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:25,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 22:29:25,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:25,214 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-10-01 22:29:25,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:25,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-10-01 22:29:25,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-01 22:29:25,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-01 22:29:25,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-10-01 22:29:25,218 INFO L87 Difference]: Start difference. First operand 129 states and 172 transitions. Second operand 12 states. [2019-10-01 22:29:25,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:25,308 INFO L93 Difference]: Finished difference Result 229 states and 316 transitions. [2019-10-01 22:29:25,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 22:29:25,309 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-10-01 22:29:25,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:25,311 INFO L225 Difference]: With dead ends: 229 [2019-10-01 22:29:25,312 INFO L226 Difference]: Without dead ends: 145 [2019-10-01 22:29:25,322 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-10-01 22:29:25,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-10-01 22:29:25,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 135. [2019-10-01 22:29:25,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-10-01 22:29:25,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 180 transitions. [2019-10-01 22:29:25,334 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 180 transitions. Word has length 54 [2019-10-01 22:29:25,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:25,334 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 180 transitions. [2019-10-01 22:29:25,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-01 22:29:25,335 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 180 transitions. [2019-10-01 22:29:25,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-01 22:29:25,335 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:25,336 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:25,336 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:25,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:25,336 INFO L82 PathProgramCache]: Analyzing trace with hash -862943218, now seen corresponding path program 4 times [2019-10-01 22:29:25,336 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:25,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:25,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:25,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:25,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:25,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:25,441 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-10-01 22:29:25,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:25,442 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:29:25,466 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:25,504 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:29:25,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:25,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-01 22:29:25,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:25,638 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-01 22:29:25,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:25,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12] total 18 [2019-10-01 22:29:25,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-01 22:29:25,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-01 22:29:25,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2019-10-01 22:29:25,644 INFO L87 Difference]: Start difference. First operand 135 states and 180 transitions. Second operand 18 states. [2019-10-01 22:29:25,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:25,919 INFO L93 Difference]: Finished difference Result 264 states and 363 transitions. [2019-10-01 22:29:25,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-01 22:29:25,920 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 57 [2019-10-01 22:29:25,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:25,922 INFO L225 Difference]: With dead ends: 264 [2019-10-01 22:29:25,922 INFO L226 Difference]: Without dead ends: 154 [2019-10-01 22:29:25,923 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=223, Invalid=533, Unknown=0, NotChecked=0, Total=756 [2019-10-01 22:29:25,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-10-01 22:29:25,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 143. [2019-10-01 22:29:25,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-10-01 22:29:25,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 190 transitions. [2019-10-01 22:29:25,933 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 190 transitions. Word has length 57 [2019-10-01 22:29:25,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:25,933 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 190 transitions. [2019-10-01 22:29:25,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-01 22:29:25,933 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 190 transitions. [2019-10-01 22:29:25,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-01 22:29:25,934 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:25,934 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:25,934 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:25,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:25,935 INFO L82 PathProgramCache]: Analyzing trace with hash 357743327, now seen corresponding path program 5 times [2019-10-01 22:29:25,935 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:25,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:25,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:25,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:25,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:25,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:26,019 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 2 proven. 35 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-10-01 22:29:26,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:26,020 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:26,053 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:29:26,140 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-10-01 22:29:26,140 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:26,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 22:29:26,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:26,276 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-01 22:29:26,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:26,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 21 [2019-10-01 22:29:26,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-01 22:29:26,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-01 22:29:26,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2019-10-01 22:29:26,285 INFO L87 Difference]: Start difference. First operand 143 states and 190 transitions. Second operand 21 states. [2019-10-01 22:29:27,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:27,070 INFO L93 Difference]: Finished difference Result 618 states and 882 transitions. [2019-10-01 22:29:27,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-01 22:29:27,070 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 62 [2019-10-01 22:29:27,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:27,074 INFO L225 Difference]: With dead ends: 618 [2019-10-01 22:29:27,074 INFO L226 Difference]: Without dead ends: 498 [2019-10-01 22:29:27,075 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=245, Invalid=811, Unknown=0, NotChecked=0, Total=1056 [2019-10-01 22:29:27,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-10-01 22:29:27,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 169. [2019-10-01 22:29:27,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-10-01 22:29:27,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 230 transitions. [2019-10-01 22:29:27,097 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 230 transitions. Word has length 62 [2019-10-01 22:29:27,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:27,097 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 230 transitions. [2019-10-01 22:29:27,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-01 22:29:27,097 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 230 transitions. [2019-10-01 22:29:27,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-01 22:29:27,098 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:27,098 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:27,098 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:27,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:27,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1526324758, now seen corresponding path program 6 times [2019-10-01 22:29:27,099 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:27,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:27,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:27,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:27,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:27,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:27,193 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 2 proven. 51 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-10-01 22:29:27,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:27,193 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:27,232 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:29:27,516 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2019-10-01 22:29:27,516 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:27,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 22:29:27,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:27,658 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-10-01 22:29:27,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:27,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2019-10-01 22:29:27,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 22:29:27,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 22:29:27,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2019-10-01 22:29:27,668 INFO L87 Difference]: Start difference. First operand 169 states and 230 transitions. Second operand 19 states. [2019-10-01 22:29:28,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:28,712 INFO L93 Difference]: Finished difference Result 618 states and 889 transitions. [2019-10-01 22:29:28,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-01 22:29:28,712 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2019-10-01 22:29:28,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:28,716 INFO L225 Difference]: With dead ends: 618 [2019-10-01 22:29:28,716 INFO L226 Difference]: Without dead ends: 516 [2019-10-01 22:29:28,717 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=351, Invalid=1209, Unknown=0, NotChecked=0, Total=1560 [2019-10-01 22:29:28,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2019-10-01 22:29:28,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 181. [2019-10-01 22:29:28,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-10-01 22:29:28,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 248 transitions. [2019-10-01 22:29:28,734 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 248 transitions. Word has length 67 [2019-10-01 22:29:28,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:28,735 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 248 transitions. [2019-10-01 22:29:28,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 22:29:28,735 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 248 transitions. [2019-10-01 22:29:28,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-01 22:29:28,736 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:28,736 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:28,736 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:28,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:28,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1085853535, now seen corresponding path program 7 times [2019-10-01 22:29:28,737 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:28,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:28,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:28,738 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:28,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:28,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:28,844 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 2 proven. 70 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-10-01 22:29:28,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:28,845 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:28,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:29:28,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:28,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 22:29:28,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:29,086 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (14)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:29:29,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:29,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 24 [2019-10-01 22:29:29,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 22:29:29,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 22:29:29,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2019-10-01 22:29:29,091 INFO L87 Difference]: Start difference. First operand 181 states and 248 transitions. Second operand 24 states. [2019-10-01 22:29:30,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:30,147 INFO L93 Difference]: Finished difference Result 730 states and 1048 transitions. [2019-10-01 22:29:30,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-01 22:29:30,150 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 70 [2019-10-01 22:29:30,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:30,155 INFO L225 Difference]: With dead ends: 730 [2019-10-01 22:29:30,155 INFO L226 Difference]: Without dead ends: 574 [2019-10-01 22:29:30,156 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=360, Invalid=1200, Unknown=0, NotChecked=0, Total=1560 [2019-10-01 22:29:30,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-10-01 22:29:30,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 195. [2019-10-01 22:29:30,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-10-01 22:29:30,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 268 transitions. [2019-10-01 22:29:30,178 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 268 transitions. Word has length 70 [2019-10-01 22:29:30,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:30,178 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 268 transitions. [2019-10-01 22:29:30,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 22:29:30,179 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 268 transitions. [2019-10-01 22:29:30,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-01 22:29:30,180 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:30,180 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:30,180 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:30,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:30,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1953529576, now seen corresponding path program 8 times [2019-10-01 22:29:30,181 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:30,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:30,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:30,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:29:30,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:30,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:30,322 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 2 proven. 92 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-10-01 22:29:30,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:30,323 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:30,367 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:29:30,414 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:29:30,414 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:30,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-01 22:29:30,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:30,663 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-10-01 22:29:30,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:30,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 26 [2019-10-01 22:29:30,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-01 22:29:30,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-01 22:29:30,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=486, Unknown=0, NotChecked=0, Total=650 [2019-10-01 22:29:30,670 INFO L87 Difference]: Start difference. First operand 195 states and 268 transitions. Second operand 26 states. [2019-10-01 22:29:31,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:31,905 INFO L93 Difference]: Finished difference Result 805 states and 1158 transitions. [2019-10-01 22:29:31,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-01 22:29:31,906 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 75 [2019-10-01 22:29:31,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:31,910 INFO L225 Difference]: With dead ends: 805 [2019-10-01 22:29:31,910 INFO L226 Difference]: Without dead ends: 637 [2019-10-01 22:29:31,912 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=434, Invalid=1458, Unknown=0, NotChecked=0, Total=1892 [2019-10-01 22:29:31,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-10-01 22:29:31,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 209. [2019-10-01 22:29:31,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-10-01 22:29:31,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 288 transitions. [2019-10-01 22:29:31,934 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 288 transitions. Word has length 75 [2019-10-01 22:29:31,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:31,934 INFO L475 AbstractCegarLoop]: Abstraction has 209 states and 288 transitions. [2019-10-01 22:29:31,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-01 22:29:31,934 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 288 transitions. [2019-10-01 22:29:31,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-01 22:29:31,935 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:31,935 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:31,936 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:31,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:31,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1790711483, now seen corresponding path program 9 times [2019-10-01 22:29:31,936 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:31,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:31,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:31,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:31,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:31,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:32,079 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 2 proven. 117 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-10-01 22:29:32,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:32,079 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:32,109 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:29:32,211 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-10-01 22:29:32,212 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:32,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 22:29:32,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:32,392 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 25 proven. 117 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-10-01 22:29:32,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:32,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2019-10-01 22:29:32,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-01 22:29:32,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-01 22:29:32,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2019-10-01 22:29:32,397 INFO L87 Difference]: Start difference. First operand 209 states and 288 transitions. Second operand 27 states. [2019-10-01 22:29:34,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:34,487 INFO L93 Difference]: Finished difference Result 823 states and 1193 transitions. [2019-10-01 22:29:34,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-10-01 22:29:34,487 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 80 [2019-10-01 22:29:34,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:34,492 INFO L225 Difference]: With dead ends: 823 [2019-10-01 22:29:34,492 INFO L226 Difference]: Without dead ends: 703 [2019-10-01 22:29:34,494 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1191 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1038, Invalid=3932, Unknown=0, NotChecked=0, Total=4970 [2019-10-01 22:29:34,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2019-10-01 22:29:34,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 221. [2019-10-01 22:29:34,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-10-01 22:29:34,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 306 transitions. [2019-10-01 22:29:34,520 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 306 transitions. Word has length 80 [2019-10-01 22:29:34,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:34,521 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 306 transitions. [2019-10-01 22:29:34,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-01 22:29:34,521 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 306 transitions. [2019-10-01 22:29:34,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-01 22:29:34,522 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:34,522 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:34,523 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:34,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:34,523 INFO L82 PathProgramCache]: Analyzing trace with hash -460757146, now seen corresponding path program 10 times [2019-10-01 22:29:34,523 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:34,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:34,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:34,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:34,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:34,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:34,684 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 2 proven. 145 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-10-01 22:29:34,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:34,685 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:34,729 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:29:34,774 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:29:34,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:34,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 22:29:34,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:35,023 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-10-01 22:29:35,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:35,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 29 [2019-10-01 22:29:35,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-01 22:29:35,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-01 22:29:35,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=610, Unknown=0, NotChecked=0, Total=812 [2019-10-01 22:29:35,036 INFO L87 Difference]: Start difference. First operand 221 states and 306 transitions. Second operand 29 states. [2019-10-01 22:29:36,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:36,537 INFO L93 Difference]: Finished difference Result 953 states and 1376 transitions. [2019-10-01 22:29:36,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-10-01 22:29:36,538 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 83 [2019-10-01 22:29:36,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:36,542 INFO L225 Difference]: With dead ends: 953 [2019-10-01 22:29:36,542 INFO L226 Difference]: Without dead ends: 761 [2019-10-01 22:29:36,544 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=587, Invalid=1963, Unknown=0, NotChecked=0, Total=2550 [2019-10-01 22:29:36,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2019-10-01 22:29:36,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 235. [2019-10-01 22:29:36,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-10-01 22:29:36,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 326 transitions. [2019-10-01 22:29:36,568 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 326 transitions. Word has length 83 [2019-10-01 22:29:36,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:36,569 INFO L475 AbstractCegarLoop]: Abstraction has 235 states and 326 transitions. [2019-10-01 22:29:36,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-01 22:29:36,569 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 326 transitions. [2019-10-01 22:29:36,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-01 22:29:36,570 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:36,570 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 11, 11, 11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:36,570 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:36,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:36,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1309656583, now seen corresponding path program 11 times [2019-10-01 22:29:36,571 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:36,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:36,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:36,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:36,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:36,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:36,775 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 2 proven. 176 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2019-10-01 22:29:36,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:36,775 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:36,812 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:29:37,095 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2019-10-01 22:29:37,095 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:37,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 22:29:37,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:37,239 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-10-01 22:29:37,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:37,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 30 [2019-10-01 22:29:37,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-01 22:29:37,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-01 22:29:37,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=630, Unknown=0, NotChecked=0, Total=870 [2019-10-01 22:29:37,245 INFO L87 Difference]: Start difference. First operand 235 states and 326 transitions. Second operand 30 states. [2019-10-01 22:29:37,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:37,745 INFO L93 Difference]: Finished difference Result 454 states and 645 transitions. [2019-10-01 22:29:37,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-01 22:29:37,747 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 88 [2019-10-01 22:29:37,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:37,748 INFO L225 Difference]: With dead ends: 454 [2019-10-01 22:29:37,748 INFO L226 Difference]: Without dead ends: 254 [2019-10-01 22:29:37,749 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=510, Invalid=1470, Unknown=0, NotChecked=0, Total=1980 [2019-10-01 22:29:37,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-10-01 22:29:37,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 243. [2019-10-01 22:29:37,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-10-01 22:29:37,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 336 transitions. [2019-10-01 22:29:37,766 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 336 transitions. Word has length 88 [2019-10-01 22:29:37,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:37,766 INFO L475 AbstractCegarLoop]: Abstraction has 243 states and 336 transitions. [2019-10-01 22:29:37,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-01 22:29:37,766 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 336 transitions. [2019-10-01 22:29:37,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-01 22:29:37,767 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:37,768 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:37,768 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:37,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:37,768 INFO L82 PathProgramCache]: Analyzing trace with hash -419492798, now seen corresponding path program 12 times [2019-10-01 22:29:37,768 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:37,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:37,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:37,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:37,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:38,017 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 2 proven. 210 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2019-10-01 22:29:38,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:38,018 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:38,071 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:29:38,366 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2019-10-01 22:29:38,366 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:38,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 22:29:38,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:38,522 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2019-10-01 22:29:38,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:38,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2019-10-01 22:29:38,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-01 22:29:38,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-01 22:29:38,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=539, Unknown=0, NotChecked=0, Total=870 [2019-10-01 22:29:38,528 INFO L87 Difference]: Start difference. First operand 243 states and 336 transitions. Second operand 30 states. [2019-10-01 22:29:38,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:38,660 INFO L93 Difference]: Finished difference Result 391 states and 560 transitions. [2019-10-01 22:29:38,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-01 22:29:38,660 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 93 [2019-10-01 22:29:38,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:38,662 INFO L225 Difference]: With dead ends: 391 [2019-10-01 22:29:38,662 INFO L226 Difference]: Without dead ends: 259 [2019-10-01 22:29:38,663 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=331, Invalid=539, Unknown=0, NotChecked=0, Total=870 [2019-10-01 22:29:38,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-10-01 22:29:38,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 249. [2019-10-01 22:29:38,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-10-01 22:29:38,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 344 transitions. [2019-10-01 22:29:38,679 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 344 transitions. Word has length 93 [2019-10-01 22:29:38,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:38,679 INFO L475 AbstractCegarLoop]: Abstraction has 249 states and 344 transitions. [2019-10-01 22:29:38,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-01 22:29:38,680 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 344 transitions. [2019-10-01 22:29:38,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-01 22:29:38,680 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:38,681 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 13, 13, 13, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:38,681 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:38,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:38,681 INFO L82 PathProgramCache]: Analyzing trace with hash 81135433, now seen corresponding path program 13 times [2019-10-01 22:29:38,681 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:38,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:38,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:38,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:38,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:38,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:38,888 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 2 proven. 247 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2019-10-01 22:29:38,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:38,889 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:38,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:29:38,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:39,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 22:29:39,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:39,322 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2019-10-01 22:29:39,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:39,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2019-10-01 22:29:39,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-01 22:29:39,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-01 22:29:39,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=845, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 22:29:39,330 INFO L87 Difference]: Start difference. First operand 249 states and 344 transitions. Second operand 34 states. [2019-10-01 22:29:41,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:41,337 INFO L93 Difference]: Finished difference Result 1212 states and 1756 transitions. [2019-10-01 22:29:41,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-10-01 22:29:41,337 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 96 [2019-10-01 22:29:41,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:41,342 INFO L225 Difference]: With dead ends: 1212 [2019-10-01 22:29:41,342 INFO L226 Difference]: Without dead ends: 996 [2019-10-01 22:29:41,344 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=872, Invalid=2910, Unknown=0, NotChecked=0, Total=3782 [2019-10-01 22:29:41,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2019-10-01 22:29:41,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 275. [2019-10-01 22:29:41,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-10-01 22:29:41,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 384 transitions. [2019-10-01 22:29:41,392 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 384 transitions. Word has length 96 [2019-10-01 22:29:41,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:41,392 INFO L475 AbstractCegarLoop]: Abstraction has 275 states and 384 transitions. [2019-10-01 22:29:41,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-01 22:29:41,392 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 384 transitions. [2019-10-01 22:29:41,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-01 22:29:41,393 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:41,393 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 14, 14, 14, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:41,394 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:41,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:41,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1750372928, now seen corresponding path program 14 times [2019-10-01 22:29:41,394 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:41,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:41,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:41,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:29:41,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:41,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:41,626 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 2 proven. 287 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2019-10-01 22:29:41,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:41,627 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:41,675 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:29:41,734 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:29:41,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:41,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 22:29:41,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:42,104 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2019-10-01 22:29:42,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:42,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2019-10-01 22:29:42,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-01 22:29:42,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-01 22:29:42,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=949, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 22:29:42,114 INFO L87 Difference]: Start difference. First operand 275 states and 384 transitions. Second operand 36 states. [2019-10-01 22:29:44,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:44,380 INFO L93 Difference]: Finished difference Result 1251 states and 1814 transitions. [2019-10-01 22:29:44,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-10-01 22:29:44,380 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 101 [2019-10-01 22:29:44,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:44,388 INFO L225 Difference]: With dead ends: 1251 [2019-10-01 22:29:44,388 INFO L226 Difference]: Without dead ends: 1011 [2019-10-01 22:29:44,390 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 752 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=986, Invalid=3304, Unknown=0, NotChecked=0, Total=4290 [2019-10-01 22:29:44,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2019-10-01 22:29:44,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 289. [2019-10-01 22:29:44,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-10-01 22:29:44,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 404 transitions. [2019-10-01 22:29:44,421 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 404 transitions. Word has length 101 [2019-10-01 22:29:44,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:44,421 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 404 transitions. [2019-10-01 22:29:44,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-01 22:29:44,422 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 404 transitions. [2019-10-01 22:29:44,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-01 22:29:44,424 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:44,424 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 15, 15, 15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:44,424 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:44,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:44,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1713067245, now seen corresponding path program 15 times [2019-10-01 22:29:44,425 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:44,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:44,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:44,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:44,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:44,737 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 2 proven. 330 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2019-10-01 22:29:44,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:44,737 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:44,787 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:29:45,093 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-10-01 22:29:45,094 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:45,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-01 22:29:45,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:45,347 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 33 proven. 330 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-10-01 22:29:45,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:45,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 38 [2019-10-01 22:29:45,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-01 22:29:45,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-01 22:29:45,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=923, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 22:29:45,353 INFO L87 Difference]: Start difference. First operand 289 states and 404 transitions. Second operand 38 states. [2019-10-01 22:29:45,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:45,832 INFO L93 Difference]: Finished difference Result 461 states and 668 transitions. [2019-10-01 22:29:45,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-01 22:29:45,833 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 106 [2019-10-01 22:29:45,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:45,834 INFO L225 Difference]: With dead ends: 461 [2019-10-01 22:29:45,834 INFO L226 Difference]: Without dead ends: 305 [2019-10-01 22:29:45,836 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=983, Invalid=2097, Unknown=0, NotChecked=0, Total=3080 [2019-10-01 22:29:45,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-10-01 22:29:45,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 295. [2019-10-01 22:29:45,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-10-01 22:29:45,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 412 transitions. [2019-10-01 22:29:45,857 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 412 transitions. Word has length 106 [2019-10-01 22:29:45,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:45,858 INFO L475 AbstractCegarLoop]: Abstraction has 295 states and 412 transitions. [2019-10-01 22:29:45,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-01 22:29:45,858 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 412 transitions. [2019-10-01 22:29:45,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-01 22:29:45,859 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:45,859 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:45,860 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:45,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:45,860 INFO L82 PathProgramCache]: Analyzing trace with hash 21134014, now seen corresponding path program 16 times [2019-10-01 22:29:45,860 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:45,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:45,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:45,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:45,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:45,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:46,177 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 2 proven. 376 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2019-10-01 22:29:46,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:46,177 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:46,226 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:29:46,281 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:29:46,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:46,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 22:29:46,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:46,489 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-10-01 22:29:46,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:46,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2019-10-01 22:29:46,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-01 22:29:46,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-01 22:29:46,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1027, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 22:29:46,494 INFO L87 Difference]: Start difference. First operand 295 states and 412 transitions. Second operand 38 states. [2019-10-01 22:29:47,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:47,278 INFO L93 Difference]: Finished difference Result 568 states and 811 transitions. [2019-10-01 22:29:47,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-01 22:29:47,278 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 109 [2019-10-01 22:29:47,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:47,280 INFO L225 Difference]: With dead ends: 568 [2019-10-01 22:29:47,280 INFO L226 Difference]: Without dead ends: 314 [2019-10-01 22:29:47,282 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=757, Invalid=2323, Unknown=0, NotChecked=0, Total=3080 [2019-10-01 22:29:47,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-10-01 22:29:47,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 303. [2019-10-01 22:29:47,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-10-01 22:29:47,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 422 transitions. [2019-10-01 22:29:47,308 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 422 transitions. Word has length 109 [2019-10-01 22:29:47,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:47,308 INFO L475 AbstractCegarLoop]: Abstraction has 303 states and 422 transitions. [2019-10-01 22:29:47,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-01 22:29:47,308 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 422 transitions. [2019-10-01 22:29:47,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-01 22:29:47,310 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:47,310 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:47,310 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:47,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:47,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1434501841, now seen corresponding path program 17 times [2019-10-01 22:29:47,311 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:47,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:47,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:47,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:47,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:47,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:47,583 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 2 proven. 425 refuted. 0 times theorem prover too weak. 326 trivial. 0 not checked. [2019-10-01 22:29:47,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:47,583 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:47,624 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:29:48,131 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2019-10-01 22:29:48,132 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:48,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-01 22:29:48,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:48,467 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2019-10-01 22:29:48,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:48,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 41 [2019-10-01 22:29:48,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-01 22:29:48,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-01 22:29:48,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=404, Invalid=1236, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 22:29:48,473 INFO L87 Difference]: Start difference. First operand 303 states and 422 transitions. Second operand 41 states. [2019-10-01 22:29:50,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:50,953 INFO L93 Difference]: Finished difference Result 1510 states and 2194 transitions. [2019-10-01 22:29:50,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-10-01 22:29:50,954 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 114 [2019-10-01 22:29:50,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:50,959 INFO L225 Difference]: With dead ends: 1510 [2019-10-01 22:29:50,959 INFO L226 Difference]: Without dead ends: 1246 [2019-10-01 22:29:50,962 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1073 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1349, Invalid=4503, Unknown=0, NotChecked=0, Total=5852 [2019-10-01 22:29:50,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2019-10-01 22:29:50,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 329. [2019-10-01 22:29:50,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-10-01 22:29:50,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 462 transitions. [2019-10-01 22:29:50,997 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 462 transitions. Word has length 114 [2019-10-01 22:29:50,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:50,997 INFO L475 AbstractCegarLoop]: Abstraction has 329 states and 462 transitions. [2019-10-01 22:29:50,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-01 22:29:50,998 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 462 transitions. [2019-10-01 22:29:50,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-01 22:29:50,999 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:50,999 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:50,999 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:51,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:51,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1128076646, now seen corresponding path program 18 times [2019-10-01 22:29:51,000 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:51,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:51,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:51,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:51,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:51,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:51,303 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 2 proven. 477 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2019-10-01 22:29:51,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:51,303 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:51,350 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:29:52,904 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2019-10-01 22:29:52,904 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:29:52,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 22:29:52,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:53,299 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-10-01 22:29:53,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:53,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 43 [2019-10-01 22:29:53,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-01 22:29:53,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-01 22:29:53,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=426, Invalid=1380, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 22:29:53,306 INFO L87 Difference]: Start difference. First operand 329 states and 462 transitions. Second operand 43 states. [2019-10-01 22:29:57,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:29:57,079 INFO L93 Difference]: Finished difference Result 1438 states and 2105 transitions. [2019-10-01 22:29:57,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-10-01 22:29:57,079 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 119 [2019-10-01 22:29:57,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:29:57,083 INFO L225 Difference]: With dead ends: 1438 [2019-10-01 22:29:57,084 INFO L226 Difference]: Without dead ends: 1264 [2019-10-01 22:29:57,087 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2183 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2079, Invalid=7821, Unknown=0, NotChecked=0, Total=9900 [2019-10-01 22:29:57,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1264 states. [2019-10-01 22:29:57,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1264 to 341. [2019-10-01 22:29:57,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-10-01 22:29:57,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 480 transitions. [2019-10-01 22:29:57,126 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 480 transitions. Word has length 119 [2019-10-01 22:29:57,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:29:57,126 INFO L475 AbstractCegarLoop]: Abstraction has 341 states and 480 transitions. [2019-10-01 22:29:57,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-01 22:29:57,127 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 480 transitions. [2019-10-01 22:29:57,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-01 22:29:57,128 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:29:57,128 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:29:57,128 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:29:57,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:29:57,129 INFO L82 PathProgramCache]: Analyzing trace with hash 423979505, now seen corresponding path program 19 times [2019-10-01 22:29:57,129 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:29:57,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:29:57,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:57,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:29:57,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:29:57,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:57,452 INFO L134 CoverageAnalysis]: Checked inductivity of 897 backedges. 2 proven. 532 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2019-10-01 22:29:57,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:29:57,453 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:29:57,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:29:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:29:57,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 22:29:57,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:29:57,924 INFO L134 CoverageAnalysis]: Checked inductivity of 897 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2019-10-01 22:29:57,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:29:57,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 44 [2019-10-01 22:29:57,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-10-01 22:29:57,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-10-01 22:29:57,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=466, Invalid=1426, Unknown=0, NotChecked=0, Total=1892 [2019-10-01 22:29:57,929 INFO L87 Difference]: Start difference. First operand 341 states and 480 transitions. Second operand 44 states. [2019-10-01 22:30:01,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:30:01,302 INFO L93 Difference]: Finished difference Result 1622 states and 2360 transitions. [2019-10-01 22:30:01,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-10-01 22:30:01,303 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 122 [2019-10-01 22:30:01,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:30:01,307 INFO L225 Difference]: With dead ends: 1622 [2019-10-01 22:30:01,307 INFO L226 Difference]: Without dead ends: 1322 [2019-10-01 22:30:01,309 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1312 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1616, Invalid=5356, Unknown=0, NotChecked=0, Total=6972 [2019-10-01 22:30:01,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2019-10-01 22:30:01,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 355. [2019-10-01 22:30:01,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-10-01 22:30:01,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 500 transitions. [2019-10-01 22:30:01,353 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 500 transitions. Word has length 122 [2019-10-01 22:30:01,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:30:01,353 INFO L475 AbstractCegarLoop]: Abstraction has 355 states and 500 transitions. [2019-10-01 22:30:01,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-10-01 22:30:01,353 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 500 transitions. [2019-10-01 22:30:01,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-01 22:30:01,354 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:30:01,355 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:30:01,355 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:30:01,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:30:01,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1200672616, now seen corresponding path program 20 times [2019-10-01 22:30:01,355 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:30:01,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:30:01,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:01,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:30:01,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:30:01,900 INFO L134 CoverageAnalysis]: Checked inductivity of 994 backedges. 2 proven. 590 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2019-10-01 22:30:01,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:30:01,901 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:30:02,000 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:30:02,087 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:30:02,088 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:30:02,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-01 22:30:02,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:30:02,422 INFO L134 CoverageAnalysis]: Checked inductivity of 994 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2019-10-01 22:30:02,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:30:02,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 45 [2019-10-01 22:30:02,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-10-01 22:30:02,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-10-01 22:30:02,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2019-10-01 22:30:02,429 INFO L87 Difference]: Start difference. First operand 355 states and 500 transitions. Second operand 45 states. [2019-10-01 22:30:03,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:30:03,286 INFO L93 Difference]: Finished difference Result 682 states and 981 transitions. [2019-10-01 22:30:03,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-10-01 22:30:03,286 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 127 [2019-10-01 22:30:03,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:30:03,288 INFO L225 Difference]: With dead ends: 682 [2019-10-01 22:30:03,288 INFO L226 Difference]: Without dead ends: 374 [2019-10-01 22:30:03,290 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1071 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1032, Invalid=3258, Unknown=0, NotChecked=0, Total=4290 [2019-10-01 22:30:03,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-10-01 22:30:03,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 363. [2019-10-01 22:30:03,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-10-01 22:30:03,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 510 transitions. [2019-10-01 22:30:03,317 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 510 transitions. Word has length 127 [2019-10-01 22:30:03,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:30:03,318 INFO L475 AbstractCegarLoop]: Abstraction has 363 states and 510 transitions. [2019-10-01 22:30:03,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-10-01 22:30:03,318 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 510 transitions. [2019-10-01 22:30:03,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-01 22:30:03,319 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:30:03,319 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:30:03,320 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:30:03,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:30:03,320 INFO L82 PathProgramCache]: Analyzing trace with hash -334459755, now seen corresponding path program 21 times [2019-10-01 22:30:03,320 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:30:03,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:30:03,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:03,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:30:03,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:03,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:30:03,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1096 backedges. 2 proven. 651 refuted. 0 times theorem prover too weak. 443 trivial. 0 not checked. [2019-10-01 22:30:03,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:30:03,676 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:30:03,736 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:30:04,822 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-10-01 22:30:04,823 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:30:04,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-01 22:30:04,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:30:05,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1096 backedges. 41 proven. 651 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (28)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:30:05,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:30:05,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 51 [2019-10-01 22:30:05,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-10-01 22:30:05,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-10-01 22:30:05,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=563, Invalid=1987, Unknown=0, NotChecked=0, Total=2550 [2019-10-01 22:30:05,347 INFO L87 Difference]: Start difference. First operand 363 states and 510 transitions. Second operand 51 states. [2019-10-01 22:30:12,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:30:12,340 INFO L93 Difference]: Finished difference Result 1661 states and 2435 transitions. [2019-10-01 22:30:12,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-10-01 22:30:12,342 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 132 [2019-10-01 22:30:12,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:30:12,350 INFO L225 Difference]: With dead ends: 1661 [2019-10-01 22:30:12,350 INFO L226 Difference]: Without dead ends: 1475 [2019-10-01 22:30:12,353 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5385 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4224, Invalid=16082, Unknown=0, NotChecked=0, Total=20306 [2019-10-01 22:30:12,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2019-10-01 22:30:12,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 381. [2019-10-01 22:30:12,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-10-01 22:30:12,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 538 transitions. [2019-10-01 22:30:12,397 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 538 transitions. Word has length 132 [2019-10-01 22:30:12,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:30:12,397 INFO L475 AbstractCegarLoop]: Abstraction has 381 states and 538 transitions. [2019-10-01 22:30:12,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-10-01 22:30:12,397 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 538 transitions. [2019-10-01 22:30:12,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-01 22:30:12,399 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:30:12,399 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:30:12,399 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:30:12,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:30:12,400 INFO L82 PathProgramCache]: Analyzing trace with hash -730185194, now seen corresponding path program 22 times [2019-10-01 22:30:12,400 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:30:12,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:30:12,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:12,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:30:12,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:12,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:30:12,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 2 proven. 715 refuted. 0 times theorem prover too weak. 443 trivial. 0 not checked. [2019-10-01 22:30:12,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:30:12,771 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:30:12,836 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:30:12,908 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:30:12,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:30:12,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-01 22:30:12,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:30:13,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 719 trivial. 0 not checked. [2019-10-01 22:30:13,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:30:13,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 24] total 49 [2019-10-01 22:30:13,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-10-01 22:30:13,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-10-01 22:30:13,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=580, Invalid=1772, Unknown=0, NotChecked=0, Total=2352 [2019-10-01 22:30:13,340 INFO L87 Difference]: Start difference. First operand 381 states and 538 transitions. Second operand 49 states. [2019-10-01 22:30:17,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:30:17,458 INFO L93 Difference]: Finished difference Result 1845 states and 2688 transitions. [2019-10-01 22:30:17,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-10-01 22:30:17,458 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 135 [2019-10-01 22:30:17,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:30:17,464 INFO L225 Difference]: With dead ends: 1845 [2019-10-01 22:30:17,464 INFO L226 Difference]: Without dead ends: 1509 [2019-10-01 22:30:17,466 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1727 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2075, Invalid=6855, Unknown=0, NotChecked=0, Total=8930 [2019-10-01 22:30:17,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states. [2019-10-01 22:30:17,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 395. [2019-10-01 22:30:17,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2019-10-01 22:30:17,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 558 transitions. [2019-10-01 22:30:17,515 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 558 transitions. Word has length 135 [2019-10-01 22:30:17,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:30:17,515 INFO L475 AbstractCegarLoop]: Abstraction has 395 states and 558 transitions. [2019-10-01 22:30:17,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-10-01 22:30:17,515 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 558 transitions. [2019-10-01 22:30:17,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-01 22:30:17,517 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:30:17,517 INFO L411 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:30:17,517 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:30:17,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:30:17,518 INFO L82 PathProgramCache]: Analyzing trace with hash 531275863, now seen corresponding path program 23 times [2019-10-01 22:30:17,518 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:30:17,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:30:17,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:17,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:30:17,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:17,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:30:17,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1270 backedges. 2 proven. 782 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2019-10-01 22:30:17,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:30:17,987 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:30:18,088 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:30:18,929 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-10-01 22:30:18,930 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:30:18,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-01 22:30:18,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:30:19,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1270 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2019-10-01 22:30:19,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:30:19,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 25] total 51 [2019-10-01 22:30:19,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-10-01 22:30:19,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-10-01 22:30:19,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=629, Invalid=1921, Unknown=0, NotChecked=0, Total=2550 [2019-10-01 22:30:19,415 INFO L87 Difference]: Start difference. First operand 395 states and 558 transitions. Second operand 51 states. [2019-10-01 22:30:23,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:30:23,975 INFO L93 Difference]: Finished difference Result 1920 states and 2798 transitions. [2019-10-01 22:30:23,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-10-01 22:30:23,975 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 140 [2019-10-01 22:30:23,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:30:23,982 INFO L225 Difference]: With dead ends: 1920 [2019-10-01 22:30:23,982 INFO L226 Difference]: Without dead ends: 1572 [2019-10-01 22:30:23,984 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1886 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2249, Invalid=7453, Unknown=0, NotChecked=0, Total=9702 [2019-10-01 22:30:23,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2019-10-01 22:30:24,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 409. [2019-10-01 22:30:24,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2019-10-01 22:30:24,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 578 transitions. [2019-10-01 22:30:24,038 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 578 transitions. Word has length 140 [2019-10-01 22:30:24,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:30:24,039 INFO L475 AbstractCegarLoop]: Abstraction has 409 states and 578 transitions. [2019-10-01 22:30:24,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-10-01 22:30:24,039 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 578 transitions. [2019-10-01 22:30:24,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-01 22:30:24,041 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:30:24,041 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:30:24,041 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:30:24,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:30:24,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1283472626, now seen corresponding path program 24 times [2019-10-01 22:30:24,041 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:30:24,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:30:24,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:24,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:30:24,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:24,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:30:24,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1385 backedges. 2 proven. 852 refuted. 0 times theorem prover too weak. 531 trivial. 0 not checked. [2019-10-01 22:30:24,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:30:24,526 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:30:24,618 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:30:29,046 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-10-01 22:30:29,047 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:30:29,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-01 22:30:29,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:30:29,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1385 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 856 trivial. 0 not checked. [2019-10-01 22:30:29,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:30:29,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 26] total 53 [2019-10-01 22:30:29,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-01 22:30:29,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-01 22:30:29,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=680, Invalid=2076, Unknown=0, NotChecked=0, Total=2756 [2019-10-01 22:30:29,569 INFO L87 Difference]: Start difference. First operand 409 states and 578 transitions. Second operand 53 states. [2019-10-01 22:30:34,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:30:34,499 INFO L93 Difference]: Finished difference Result 1995 states and 2908 transitions. [2019-10-01 22:30:34,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-10-01 22:30:34,499 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 145 [2019-10-01 22:30:34,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:30:34,507 INFO L225 Difference]: With dead ends: 1995 [2019-10-01 22:30:34,507 INFO L226 Difference]: Without dead ends: 1635 [2019-10-01 22:30:34,509 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2052 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2430, Invalid=8076, Unknown=0, NotChecked=0, Total=10506 [2019-10-01 22:30:34,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1635 states. [2019-10-01 22:30:34,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1635 to 423. [2019-10-01 22:30:34,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-10-01 22:30:34,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 598 transitions. [2019-10-01 22:30:34,564 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 598 transitions. Word has length 145 [2019-10-01 22:30:34,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:30:34,565 INFO L475 AbstractCegarLoop]: Abstraction has 423 states and 598 transitions. [2019-10-01 22:30:34,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-10-01 22:30:34,565 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 598 transitions. [2019-10-01 22:30:34,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-01 22:30:34,566 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:30:34,566 INFO L411 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:30:34,567 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:30:34,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:30:34,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1506536069, now seen corresponding path program 25 times [2019-10-01 22:30:34,567 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:30:34,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:30:34,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:34,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:30:34,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:30:35,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1505 backedges. 2 proven. 925 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2019-10-01 22:30:35,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:30:35,254 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:30:35,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:30:35,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:30:35,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-01 22:30:35,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:30:35,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1505 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 929 trivial. 0 not checked. [2019-10-01 22:30:35,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:30:35,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27] total 54 [2019-10-01 22:30:35,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-10-01 22:30:35,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-10-01 22:30:35,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=756, Invalid=2106, Unknown=0, NotChecked=0, Total=2862 [2019-10-01 22:30:35,980 INFO L87 Difference]: Start difference. First operand 423 states and 598 transitions. Second operand 54 states. [2019-10-01 22:30:37,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:30:37,125 INFO L93 Difference]: Finished difference Result 810 states and 1169 transitions. [2019-10-01 22:30:37,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-10-01 22:30:37,126 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 150 [2019-10-01 22:30:37,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:30:37,127 INFO L225 Difference]: With dead ends: 810 [2019-10-01 22:30:37,128 INFO L226 Difference]: Without dead ends: 442 [2019-10-01 22:30:37,129 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1575 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1456, Invalid=4706, Unknown=0, NotChecked=0, Total=6162 [2019-10-01 22:30:37,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2019-10-01 22:30:37,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 431. [2019-10-01 22:30:37,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2019-10-01 22:30:37,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 608 transitions. [2019-10-01 22:30:37,172 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 608 transitions. Word has length 150 [2019-10-01 22:30:37,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:30:37,172 INFO L475 AbstractCegarLoop]: Abstraction has 431 states and 608 transitions. [2019-10-01 22:30:37,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-10-01 22:30:37,172 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 608 transitions. [2019-10-01 22:30:37,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-01 22:30:37,173 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:30:37,174 INFO L411 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:30:37,174 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:30:37,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:30:37,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1411266610, now seen corresponding path program 26 times [2019-10-01 22:30:37,175 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:30:37,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:30:37,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:37,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:30:37,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:37,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:30:37,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1630 backedges. 2 proven. 1001 refuted. 0 times theorem prover too weak. 627 trivial. 0 not checked. [2019-10-01 22:30:37,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:30:37,830 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:30:37,916 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:30:37,994 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:30:37,994 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:30:37,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-01 22:30:37,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:30:38,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1630 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 1005 trivial. 0 not checked. [2019-10-01 22:30:38,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:30:38,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28] total 56 [2019-10-01 22:30:38,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-10-01 22:30:38,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-10-01 22:30:38,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=812, Invalid=2268, Unknown=0, NotChecked=0, Total=3080 [2019-10-01 22:30:38,309 INFO L87 Difference]: Start difference. First operand 431 states and 608 transitions. Second operand 56 states. [2019-10-01 22:30:39,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:30:39,548 INFO L93 Difference]: Finished difference Result 824 states and 1187 transitions. [2019-10-01 22:30:39,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-10-01 22:30:39,548 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 155 [2019-10-01 22:30:39,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:30:39,550 INFO L225 Difference]: With dead ends: 824 [2019-10-01 22:30:39,550 INFO L226 Difference]: Without dead ends: 450 [2019-10-01 22:30:39,551 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1703 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1566, Invalid=5076, Unknown=0, NotChecked=0, Total=6642 [2019-10-01 22:30:39,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-10-01 22:30:39,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 439. [2019-10-01 22:30:39,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-10-01 22:30:39,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 618 transitions. [2019-10-01 22:30:39,586 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 618 transitions. Word has length 155 [2019-10-01 22:30:39,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:30:39,586 INFO L475 AbstractCegarLoop]: Abstraction has 439 states and 618 transitions. [2019-10-01 22:30:39,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-10-01 22:30:39,586 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 618 transitions. [2019-10-01 22:30:39,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-01 22:30:39,587 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:30:39,588 INFO L411 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:30:39,588 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:30:39,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:30:39,588 INFO L82 PathProgramCache]: Analyzing trace with hash 970791583, now seen corresponding path program 27 times [2019-10-01 22:30:39,588 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:30:39,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:30:39,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:39,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:30:39,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:39,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:30:40,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1760 backedges. 2 proven. 1080 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2019-10-01 22:30:40,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:30:40,062 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:30:40,145 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:30:43,912 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-10-01 22:30:43,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:30:43,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-01 22:30:43,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:30:44,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1760 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 1084 trivial. 0 not checked. [2019-10-01 22:30:44,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:30:44,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 29] total 59 [2019-10-01 22:30:44,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-10-01 22:30:44,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-10-01 22:30:44,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=845, Invalid=2577, Unknown=0, NotChecked=0, Total=3422 [2019-10-01 22:30:44,609 INFO L87 Difference]: Start difference. First operand 439 states and 618 transitions. Second operand 59 states. [2019-10-01 22:30:50,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:30:50,692 INFO L93 Difference]: Finished difference Result 2256 states and 3290 transitions. [2019-10-01 22:30:50,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-10-01 22:30:50,692 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 160 [2019-10-01 22:30:50,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:30:50,698 INFO L225 Difference]: With dead ends: 2256 [2019-10-01 22:30:50,699 INFO L226 Difference]: Without dead ends: 1872 [2019-10-01 22:30:50,700 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2592 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3015, Invalid=10095, Unknown=0, NotChecked=0, Total=13110 [2019-10-01 22:30:50,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1872 states. [2019-10-01 22:30:50,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1872 to 465. [2019-10-01 22:30:50,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-10-01 22:30:50,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 658 transitions. [2019-10-01 22:30:50,805 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 658 transitions. Word has length 160 [2019-10-01 22:30:50,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:30:50,805 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 658 transitions. [2019-10-01 22:30:50,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-10-01 22:30:50,806 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 658 transitions. [2019-10-01 22:30:50,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-01 22:30:50,807 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:30:50,807 INFO L411 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:30:50,807 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:30:50,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:30:50,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1686676138, now seen corresponding path program 28 times [2019-10-01 22:30:50,808 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:30:50,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:30:50,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:50,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:30:50,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:30:51,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1895 backedges. 2 proven. 1162 refuted. 0 times theorem prover too weak. 731 trivial. 0 not checked. [2019-10-01 22:30:51,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:30:51,352 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:30:51,445 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:30:51,539 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:30:51,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:30:51,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-01 22:30:51,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:30:52,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1895 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 1166 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (35)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:30:52,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:30:52,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 30] total 61 [2019-10-01 22:30:52,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-10-01 22:30:52,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-10-01 22:30:52,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=904, Invalid=2756, Unknown=0, NotChecked=0, Total=3660 [2019-10-01 22:30:52,249 INFO L87 Difference]: Start difference. First operand 465 states and 658 transitions. Second operand 61 states. [2019-10-01 22:30:58,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:30:58,165 INFO L93 Difference]: Finished difference Result 2295 states and 3348 transitions. [2019-10-01 22:30:58,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-10-01 22:30:58,166 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 165 [2019-10-01 22:30:58,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:30:58,172 INFO L225 Difference]: With dead ends: 2295 [2019-10-01 22:30:58,172 INFO L226 Difference]: Without dead ends: 1887 [2019-10-01 22:30:58,175 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2786 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3224, Invalid=10818, Unknown=0, NotChecked=0, Total=14042 [2019-10-01 22:30:58,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1887 states. [2019-10-01 22:30:58,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1887 to 479. [2019-10-01 22:30:58,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2019-10-01 22:30:58,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 678 transitions. [2019-10-01 22:30:58,243 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 678 transitions. Word has length 165 [2019-10-01 22:30:58,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:30:58,244 INFO L475 AbstractCegarLoop]: Abstraction has 479 states and 678 transitions. [2019-10-01 22:30:58,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-10-01 22:30:58,244 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 678 transitions. [2019-10-01 22:30:58,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-01 22:30:58,245 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:30:58,245 INFO L411 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:30:58,246 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:30:58,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:30:58,246 INFO L82 PathProgramCache]: Analyzing trace with hash -2021920829, now seen corresponding path program 29 times [2019-10-01 22:30:58,246 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:30:58,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:30:58,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:58,248 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:30:58,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:30:58,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:30:58,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 2 proven. 1247 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2019-10-01 22:30:58,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:30:58,936 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:30:59,034 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:31:11,102 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2019-10-01 22:31:11,103 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:31:11,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-01 22:31:11,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:31:11,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 1251 trivial. 0 not checked. [2019-10-01 22:31:11,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:31:11,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 31] total 62 [2019-10-01 22:31:11,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-10-01 22:31:11,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-10-01 22:31:11,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=992, Invalid=2790, Unknown=0, NotChecked=0, Total=3782 [2019-10-01 22:31:11,547 INFO L87 Difference]: Start difference. First operand 479 states and 678 transitions. Second operand 62 states. [2019-10-01 22:31:12,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:31:12,796 INFO L93 Difference]: Finished difference Result 914 states and 1321 transitions. [2019-10-01 22:31:12,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-10-01 22:31:12,796 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 170 [2019-10-01 22:31:12,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:31:12,798 INFO L225 Difference]: With dead ends: 914 [2019-10-01 22:31:12,798 INFO L226 Difference]: Without dead ends: 498 [2019-10-01 22:31:12,800 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 142 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2117 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1920, Invalid=6270, Unknown=0, NotChecked=0, Total=8190 [2019-10-01 22:31:12,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-10-01 22:31:12,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 487. [2019-10-01 22:31:12,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-10-01 22:31:12,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 688 transitions. [2019-10-01 22:31:12,837 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 688 transitions. Word has length 170 [2019-10-01 22:31:12,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:31:12,837 INFO L475 AbstractCegarLoop]: Abstraction has 487 states and 688 transitions. [2019-10-01 22:31:12,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-10-01 22:31:12,838 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 688 transitions. [2019-10-01 22:31:12,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-01 22:31:12,839 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:31:12,839 INFO L411 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 29, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:31:12,839 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:31:12,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:31:12,840 INFO L82 PathProgramCache]: Analyzing trace with hash 31362438, now seen corresponding path program 30 times [2019-10-01 22:31:12,840 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:31:12,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:31:12,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:12,842 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:31:12,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:12,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:31:13,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2180 backedges. 2 proven. 1335 refuted. 0 times theorem prover too weak. 843 trivial. 0 not checked. [2019-10-01 22:31:13,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:31:13,686 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:31:13,788 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:31:18,161 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-10-01 22:31:18,161 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:31:18,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-01 22:31:18,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:31:18,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2180 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 1339 trivial. 0 not checked. [2019-10-01 22:31:19,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:31:19,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 32] total 65 [2019-10-01 22:31:19,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-10-01 22:31:19,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-10-01 22:31:19,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1028, Invalid=3132, Unknown=0, NotChecked=0, Total=4160 [2019-10-01 22:31:19,006 INFO L87 Difference]: Start difference. First operand 487 states and 688 transitions. Second operand 65 states. [2019-10-01 22:31:25,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:31:25,190 INFO L93 Difference]: Finished difference Result 2463 states and 3594 transitions. [2019-10-01 22:31:25,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2019-10-01 22:31:25,191 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 175 [2019-10-01 22:31:25,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:31:25,198 INFO L225 Difference]: With dead ends: 2463 [2019-10-01 22:31:25,198 INFO L226 Difference]: Without dead ends: 2037 [2019-10-01 22:31:25,201 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3195 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3663, Invalid=12339, Unknown=0, NotChecked=0, Total=16002 [2019-10-01 22:31:25,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2037 states. [2019-10-01 22:31:25,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2037 to 507. [2019-10-01 22:31:25,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2019-10-01 22:31:25,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 718 transitions. [2019-10-01 22:31:25,272 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 718 transitions. Word has length 175 [2019-10-01 22:31:25,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:31:25,272 INFO L475 AbstractCegarLoop]: Abstraction has 507 states and 718 transitions. [2019-10-01 22:31:25,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-10-01 22:31:25,273 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 718 transitions. [2019-10-01 22:31:25,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-01 22:31:25,274 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:31:25,274 INFO L411 BasicCegarLoop]: trace histogram [31, 31, 31, 30, 30, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:31:25,274 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:31:25,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:31:25,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1952896231, now seen corresponding path program 31 times [2019-10-01 22:31:25,275 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:31:25,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:31:25,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:25,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:31:25,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:25,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:31:26,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2330 backedges. 2 proven. 1426 refuted. 0 times theorem prover too weak. 902 trivial. 0 not checked. [2019-10-01 22:31:26,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:31:26,200 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:31:26,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:31:26,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:31:26,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-01 22:31:26,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:31:26,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2330 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 1430 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (38)] Exception during sending of exit command (exit): Stream Closed [2019-10-01 22:31:26,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:31:26,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 33] total 66 [2019-10-01 22:31:26,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-10-01 22:31:26,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-10-01 22:31:26,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1122, Invalid=3168, Unknown=0, NotChecked=0, Total=4290 [2019-10-01 22:31:26,863 INFO L87 Difference]: Start difference. First operand 507 states and 718 transitions. Second operand 66 states. [2019-10-01 22:31:28,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:31:28,249 INFO L93 Difference]: Finished difference Result 966 states and 1397 transitions. [2019-10-01 22:31:28,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-10-01 22:31:28,249 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 180 [2019-10-01 22:31:28,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:31:28,251 INFO L225 Difference]: With dead ends: 966 [2019-10-01 22:31:28,251 INFO L226 Difference]: Without dead ends: 526 [2019-10-01 22:31:28,253 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 150 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2418 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2176, Invalid=7136, Unknown=0, NotChecked=0, Total=9312 [2019-10-01 22:31:28,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2019-10-01 22:31:28,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 515. [2019-10-01 22:31:28,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2019-10-01 22:31:28,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 728 transitions. [2019-10-01 22:31:28,305 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 728 transitions. Word has length 180 [2019-10-01 22:31:28,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:31:28,305 INFO L475 AbstractCegarLoop]: Abstraction has 515 states and 728 transitions. [2019-10-01 22:31:28,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-10-01 22:31:28,305 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 728 transitions. [2019-10-01 22:31:28,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-10-01 22:31:28,307 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:31:28,307 INFO L411 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:31:28,307 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:31:28,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:31:28,308 INFO L82 PathProgramCache]: Analyzing trace with hash -2066921374, now seen corresponding path program 32 times [2019-10-01 22:31:28,308 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:31:28,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:31:28,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:28,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:31:28,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:28,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:31:28,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 2 proven. 1520 refuted. 0 times theorem prover too weak. 963 trivial. 0 not checked. [2019-10-01 22:31:28,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:31:28,983 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:31:29,089 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:31:29,185 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:31:29,185 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:31:29,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-01 22:31:29,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:31:30,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1524 trivial. 0 not checked. [2019-10-01 22:31:30,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:31:30,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 34] total 69 [2019-10-01 22:31:30,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-01 22:31:30,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-01 22:31:30,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1160, Invalid=3532, Unknown=0, NotChecked=0, Total=4692 [2019-10-01 22:31:30,061 INFO L87 Difference]: Start difference. First operand 515 states and 728 transitions. Second operand 69 states. [2019-10-01 22:31:37,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:31:37,014 INFO L93 Difference]: Finished difference Result 2613 states and 3814 transitions. [2019-10-01 22:31:37,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-10-01 22:31:37,014 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 185 [2019-10-01 22:31:37,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:31:37,019 INFO L225 Difference]: With dead ends: 2613 [2019-10-01 22:31:37,019 INFO L226 Difference]: Without dead ends: 2163 [2019-10-01 22:31:37,021 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3632 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4130, Invalid=13960, Unknown=0, NotChecked=0, Total=18090 [2019-10-01 22:31:37,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2163 states. [2019-10-01 22:31:37,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2163 to 535. [2019-10-01 22:31:37,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2019-10-01 22:31:37,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 758 transitions. [2019-10-01 22:31:37,082 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 758 transitions. Word has length 185 [2019-10-01 22:31:37,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:31:37,082 INFO L475 AbstractCegarLoop]: Abstraction has 535 states and 758 transitions. [2019-10-01 22:31:37,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-01 22:31:37,082 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 758 transitions. [2019-10-01 22:31:37,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-01 22:31:37,084 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:31:37,084 INFO L411 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 32, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:31:37,084 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:31:37,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:31:37,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1032582645, now seen corresponding path program 33 times [2019-10-01 22:31:37,085 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:31:37,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:31:37,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:37,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:31:37,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:37,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:31:37,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2645 backedges. 2 proven. 1617 refuted. 0 times theorem prover too weak. 1026 trivial. 0 not checked. [2019-10-01 22:31:37,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:31:37,934 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:31:38,044 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:31:47,233 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-10-01 22:31:47,234 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:31:47,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-01 22:31:47,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:31:47,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2645 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1621 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (40)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:31:47,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:31:47,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 35] total 70 [2019-10-01 22:31:47,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-10-01 22:31:47,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-10-01 22:31:47,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1260, Invalid=3570, Unknown=0, NotChecked=0, Total=4830 [2019-10-01 22:31:47,766 INFO L87 Difference]: Start difference. First operand 535 states and 758 transitions. Second operand 70 states. [2019-10-01 22:31:49,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:31:49,385 INFO L93 Difference]: Finished difference Result 1018 states and 1473 transitions. [2019-10-01 22:31:49,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-10-01 22:31:49,385 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 190 [2019-10-01 22:31:49,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:31:49,387 INFO L225 Difference]: With dead ends: 1018 [2019-10-01 22:31:49,387 INFO L226 Difference]: Without dead ends: 554 [2019-10-01 22:31:49,389 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 158 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2739 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2448, Invalid=8058, Unknown=0, NotChecked=0, Total=10506 [2019-10-01 22:31:49,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-10-01 22:31:49,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 543. [2019-10-01 22:31:49,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-10-01 22:31:49,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 768 transitions. [2019-10-01 22:31:49,431 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 768 transitions. Word has length 190 [2019-10-01 22:31:49,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:31:49,431 INFO L475 AbstractCegarLoop]: Abstraction has 543 states and 768 transitions. [2019-10-01 22:31:49,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-10-01 22:31:49,431 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 768 transitions. [2019-10-01 22:31:49,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-01 22:31:49,433 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:31:49,433 INFO L411 BasicCegarLoop]: trace histogram [34, 34, 34, 33, 33, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:31:49,433 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:31:49,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:31:49,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1078029506, now seen corresponding path program 34 times [2019-10-01 22:31:49,433 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:31:49,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:31:49,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:49,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:31:49,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:49,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:31:50,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2810 backedges. 2 proven. 1717 refuted. 0 times theorem prover too weak. 1091 trivial. 0 not checked. [2019-10-01 22:31:50,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:31:50,271 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:31:50,387 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:31:50,489 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:31:50,489 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:31:50,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 35 conjunts are in the unsatisfiable core [2019-10-01 22:31:50,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:31:51,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2810 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 1721 trivial. 0 not checked. [2019-10-01 22:31:51,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:31:51,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 36] total 73 [2019-10-01 22:31:51,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-10-01 22:31:51,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-10-01 22:31:51,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1300, Invalid=3956, Unknown=0, NotChecked=0, Total=5256 [2019-10-01 22:31:51,471 INFO L87 Difference]: Start difference. First operand 543 states and 768 transitions. Second operand 73 states. [2019-10-01 22:31:59,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:31:59,615 INFO L93 Difference]: Finished difference Result 2763 states and 4034 transitions. [2019-10-01 22:31:59,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2019-10-01 22:31:59,615 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 195 [2019-10-01 22:31:59,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:31:59,620 INFO L225 Difference]: With dead ends: 2763 [2019-10-01 22:31:59,621 INFO L226 Difference]: Without dead ends: 2289 [2019-10-01 22:31:59,623 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4097 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=4625, Invalid=15681, Unknown=0, NotChecked=0, Total=20306 [2019-10-01 22:31:59,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2289 states. [2019-10-01 22:31:59,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2289 to 563. [2019-10-01 22:31:59,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-10-01 22:31:59,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 798 transitions. [2019-10-01 22:31:59,719 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 798 transitions. Word has length 195 [2019-10-01 22:31:59,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:31:59,719 INFO L475 AbstractCegarLoop]: Abstraction has 563 states and 798 transitions. [2019-10-01 22:31:59,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-10-01 22:31:59,720 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 798 transitions. [2019-10-01 22:31:59,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-01 22:31:59,721 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:31:59,721 INFO L411 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:31:59,721 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:31:59,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:31:59,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1275474129, now seen corresponding path program 35 times [2019-10-01 22:31:59,722 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:31:59,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:31:59,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:59,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:31:59,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:31:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:32:00,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2980 backedges. 2 proven. 1820 refuted. 0 times theorem prover too weak. 1158 trivial. 0 not checked. [2019-10-01 22:32:00,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:32:00,523 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:32:00,650 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:32:13,655 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2019-10-01 22:32:13,655 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:32:13,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 36 conjunts are in the unsatisfiable core [2019-10-01 22:32:13,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:32:14,759 INFO L134 CoverageAnalysis]: Checked inductivity of 2980 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 1824 trivial. 0 not checked. [2019-10-01 22:32:14,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:32:14,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 37] total 75 [2019-10-01 22:32:14,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-10-01 22:32:14,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-10-01 22:32:14,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1373, Invalid=4177, Unknown=0, NotChecked=0, Total=5550 [2019-10-01 22:32:14,774 INFO L87 Difference]: Start difference. First operand 563 states and 798 transitions. Second operand 75 states. [2019-10-01 22:32:23,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:32:23,597 INFO L93 Difference]: Finished difference Result 2820 states and 4118 transitions. [2019-10-01 22:32:23,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2019-10-01 22:32:23,603 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 200 [2019-10-01 22:32:23,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:32:23,609 INFO L225 Difference]: With dead ends: 2820 [2019-10-01 22:32:23,609 INFO L226 Difference]: Without dead ends: 2328 [2019-10-01 22:32:23,612 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4340 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4883, Invalid=16579, Unknown=0, NotChecked=0, Total=21462 [2019-10-01 22:32:23,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2328 states. [2019-10-01 22:32:23,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2328 to 577. [2019-10-01 22:32:23,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-10-01 22:32:23,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 818 transitions. [2019-10-01 22:32:23,710 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 818 transitions. Word has length 200 [2019-10-01 22:32:23,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:32:23,710 INFO L475 AbstractCegarLoop]: Abstraction has 577 states and 818 transitions. [2019-10-01 22:32:23,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-10-01 22:32:23,711 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 818 transitions. [2019-10-01 22:32:23,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-10-01 22:32:23,712 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:32:23,713 INFO L411 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:32:23,713 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:32:23,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:32:23,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1298387430, now seen corresponding path program 36 times [2019-10-01 22:32:23,714 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:32:23,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:32:23,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:32:23,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:32:23,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:32:23,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:32:24,587 INFO L134 CoverageAnalysis]: Checked inductivity of 3155 backedges. 2 proven. 1926 refuted. 0 times theorem prover too weak. 1227 trivial. 0 not checked. [2019-10-01 22:32:24,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:32:24,588 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:32:24,747 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:33:04,641 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2019-10-01 22:33:04,642 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:33:04,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 44 conjunts are in the unsatisfiable core [2019-10-01 22:33:04,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:33:05,927 INFO L134 CoverageAnalysis]: Checked inductivity of 3155 backedges. 69 proven. 1926 refuted. 0 times theorem prover too weak. 1160 trivial. 0 not checked. [2019-10-01 22:33:05,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:33:05,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 42] total 81 [2019-10-01 22:33:05,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-10-01 22:33:05,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-10-01 22:33:05,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1493, Invalid=4987, Unknown=0, NotChecked=0, Total=6480 [2019-10-01 22:33:05,941 INFO L87 Difference]: Start difference. First operand 577 states and 818 transitions. Second operand 81 states. [2019-10-01 22:33:20,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:33:20,658 INFO L93 Difference]: Finished difference Result 2676 states and 3937 transitions. [2019-10-01 22:33:20,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2019-10-01 22:33:20,658 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 205 [2019-10-01 22:33:20,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:33:20,665 INFO L225 Difference]: With dead ends: 2676 [2019-10-01 22:33:20,665 INFO L226 Difference]: Without dead ends: 2394 [2019-10-01 22:33:20,669 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14880 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=11244, Invalid=42812, Unknown=0, NotChecked=0, Total=54056 [2019-10-01 22:33:20,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2394 states. [2019-10-01 22:33:20,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2394 to 589. [2019-10-01 22:33:20,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-10-01 22:33:20,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 836 transitions. [2019-10-01 22:33:20,783 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 836 transitions. Word has length 205 [2019-10-01 22:33:20,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:33:20,784 INFO L475 AbstractCegarLoop]: Abstraction has 589 states and 836 transitions. [2019-10-01 22:33:20,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-10-01 22:33:20,784 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 836 transitions. [2019-10-01 22:33:20,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-10-01 22:33:20,787 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:33:20,787 INFO L411 BasicCegarLoop]: trace histogram [37, 37, 37, 35, 35, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:33:20,787 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:33:20,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:33:20,788 INFO L82 PathProgramCache]: Analyzing trace with hash -948210063, now seen corresponding path program 37 times [2019-10-01 22:33:20,788 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:33:20,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:33:20,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:33:20,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:33:20,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:33:20,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:33:21,923 INFO L134 CoverageAnalysis]: Checked inductivity of 3264 backedges. 2 proven. 2035 refuted. 0 times theorem prover too weak. 1227 trivial. 0 not checked. [2019-10-01 22:33:21,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:33:21,923 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:33:22,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:33:22,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:33:22,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 668 conjuncts, 37 conjunts are in the unsatisfiable core [2019-10-01 22:33:22,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:33:22,781 INFO L134 CoverageAnalysis]: Checked inductivity of 3264 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 2039 trivial. 0 not checked. [2019-10-01 22:33:22,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:33:22,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 38] total 77 [2019-10-01 22:33:22,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-10-01 22:33:22,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-10-01 22:33:22,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1522, Invalid=4330, Unknown=0, NotChecked=0, Total=5852 [2019-10-01 22:33:22,786 INFO L87 Difference]: Start difference. First operand 589 states and 836 transitions. Second operand 77 states. [2019-10-01 22:33:24,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:33:24,681 INFO L93 Difference]: Finished difference Result 1120 states and 1623 transitions. [2019-10-01 22:33:24,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-10-01 22:33:24,681 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 208 [2019-10-01 22:33:24,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:33:24,683 INFO L225 Difference]: With dead ends: 1120 [2019-10-01 22:33:24,683 INFO L226 Difference]: Without dead ends: 608 [2019-10-01 22:33:24,685 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 173 SyntacticMatches, 1 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3330 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2926, Invalid=9730, Unknown=0, NotChecked=0, Total=12656 [2019-10-01 22:33:24,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-10-01 22:33:24,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 597. [2019-10-01 22:33:24,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-10-01 22:33:24,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 846 transitions. [2019-10-01 22:33:24,742 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 846 transitions. Word has length 208 [2019-10-01 22:33:24,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:33:24,743 INFO L475 AbstractCegarLoop]: Abstraction has 597 states and 846 transitions. [2019-10-01 22:33:24,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-10-01 22:33:24,743 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 846 transitions. [2019-10-01 22:33:24,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-01 22:33:24,744 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:33:24,744 INFO L411 BasicCegarLoop]: trace histogram [38, 38, 38, 36, 36, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:33:24,744 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:33:24,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:33:24,745 INFO L82 PathProgramCache]: Analyzing trace with hash 2108647832, now seen corresponding path program 38 times [2019-10-01 22:33:24,745 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:33:24,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:33:24,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:33:24,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:33:24,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:33:24,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:33:25,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3447 backedges. 2 proven. 2147 refuted. 0 times theorem prover too weak. 1298 trivial. 0 not checked. [2019-10-01 22:33:25,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:33:25,585 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:33:25,712 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:33:25,820 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:33:25,821 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:33:25,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 38 conjunts are in the unsatisfiable core [2019-10-01 22:33:25,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:33:26,983 INFO L134 CoverageAnalysis]: Checked inductivity of 3447 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 2151 trivial. 0 not checked. [2019-10-01 22:33:26,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:33:26,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 39] total 80 [2019-10-01 22:33:26,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-10-01 22:33:26,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-10-01 22:33:26,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1565, Invalid=4755, Unknown=0, NotChecked=0, Total=6320 [2019-10-01 22:33:26,989 INFO L87 Difference]: Start difference. First operand 597 states and 846 transitions. Second operand 80 states. [2019-10-01 22:33:37,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:33:37,389 INFO L93 Difference]: Finished difference Result 3061 states and 4472 transitions. [2019-10-01 22:33:37,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2019-10-01 22:33:37,389 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 213 [2019-10-01 22:33:37,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:33:37,395 INFO L225 Difference]: With dead ends: 3061 [2019-10-01 22:33:37,395 INFO L226 Difference]: Without dead ends: 2539 [2019-10-01 22:33:37,398 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5072 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=5660, Invalid=19146, Unknown=0, NotChecked=0, Total=24806 [2019-10-01 22:33:37,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2539 states. [2019-10-01 22:33:37,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2539 to 617. [2019-10-01 22:33:37,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2019-10-01 22:33:37,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 876 transitions. [2019-10-01 22:33:37,525 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 876 transitions. Word has length 213 [2019-10-01 22:33:37,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:33:37,525 INFO L475 AbstractCegarLoop]: Abstraction has 617 states and 876 transitions. [2019-10-01 22:33:37,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-10-01 22:33:37,525 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 876 transitions. [2019-10-01 22:33:37,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-10-01 22:33:37,527 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:33:37,527 INFO L411 BasicCegarLoop]: trace histogram [39, 39, 39, 37, 37, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:33:37,527 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:33:37,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:33:37,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1877766635, now seen corresponding path program 39 times [2019-10-01 22:33:37,528 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:33:37,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:33:37,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:33:37,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:33:37,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:33:37,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:33:38,509 INFO L134 CoverageAnalysis]: Checked inductivity of 3635 backedges. 2 proven. 2262 refuted. 0 times theorem prover too weak. 1371 trivial. 0 not checked. [2019-10-01 22:33:38,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:33:38,510 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:33:38,653 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:33:57,663 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-10-01 22:33:57,664 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:33:57,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 44 conjunts are in the unsatisfiable core [2019-10-01 22:33:57,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:33:58,893 INFO L134 CoverageAnalysis]: Checked inductivity of 3635 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 2266 trivial. 0 not checked. [2019-10-01 22:33:58,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:33:58,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 40] total 82 [2019-10-01 22:33:58,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-10-01 22:33:58,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-10-01 22:33:58,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1645, Invalid=4997, Unknown=0, NotChecked=0, Total=6642 [2019-10-01 22:33:58,906 INFO L87 Difference]: Start difference. First operand 617 states and 876 transitions. Second operand 82 states. [2019-10-01 22:34:10,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:34:10,214 INFO L93 Difference]: Finished difference Result 3118 states and 4556 transitions. [2019-10-01 22:34:10,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2019-10-01 22:34:10,214 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 218 [2019-10-01 22:34:10,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:34:10,219 INFO L225 Difference]: With dead ends: 3118 [2019-10-01 22:34:10,219 INFO L226 Difference]: Without dead ends: 2578 [2019-10-01 22:34:10,222 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5342 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=5945, Invalid=20137, Unknown=0, NotChecked=0, Total=26082 [2019-10-01 22:34:10,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2578 states. [2019-10-01 22:34:10,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2578 to 631. [2019-10-01 22:34:10,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-10-01 22:34:10,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 896 transitions. [2019-10-01 22:34:10,341 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 896 transitions. Word has length 218 [2019-10-01 22:34:10,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:34:10,342 INFO L475 AbstractCegarLoop]: Abstraction has 631 states and 896 transitions. [2019-10-01 22:34:10,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-10-01 22:34:10,342 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 896 transitions. [2019-10-01 22:34:10,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-10-01 22:34:10,343 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:34:10,344 INFO L411 BasicCegarLoop]: trace histogram [40, 40, 40, 38, 38, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:34:10,344 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:34:10,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:34:10,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1957167604, now seen corresponding path program 40 times [2019-10-01 22:34:10,345 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:34:10,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:34:10,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:34:10,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:34:10,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:34:10,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:34:11,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 2 proven. 2380 refuted. 0 times theorem prover too weak. 1446 trivial. 0 not checked. [2019-10-01 22:34:11,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:34:11,415 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:34:11,578 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:34:11,695 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:34:11,696 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:34:11,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-01 22:34:11,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:34:13,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 2384 trivial. 0 not checked. [2019-10-01 22:34:13,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:34:13,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 41] total 84 [2019-10-01 22:34:13,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-10-01 22:34:13,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-10-01 22:34:13,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1727, Invalid=5245, Unknown=0, NotChecked=0, Total=6972 [2019-10-01 22:34:13,032 INFO L87 Difference]: Start difference. First operand 631 states and 896 transitions. Second operand 84 states. [2019-10-01 22:34:25,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:34:25,269 INFO L93 Difference]: Finished difference Result 3193 states and 4666 transitions. [2019-10-01 22:34:25,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2019-10-01 22:34:25,270 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 223 [2019-10-01 22:34:25,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:34:25,276 INFO L225 Difference]: With dead ends: 3193 [2019-10-01 22:34:25,277 INFO L226 Difference]: Without dead ends: 2641 [2019-10-01 22:34:25,280 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5619 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=6237, Invalid=21153, Unknown=0, NotChecked=0, Total=27390 [2019-10-01 22:34:25,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2641 states. [2019-10-01 22:34:25,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2641 to 645. [2019-10-01 22:34:25,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2019-10-01 22:34:25,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 916 transitions. [2019-10-01 22:34:25,416 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 916 transitions. Word has length 223 [2019-10-01 22:34:25,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:34:25,416 INFO L475 AbstractCegarLoop]: Abstraction has 645 states and 916 transitions. [2019-10-01 22:34:25,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-10-01 22:34:25,416 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 916 transitions. [2019-10-01 22:34:25,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-10-01 22:34:25,418 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:34:25,418 INFO L411 BasicCegarLoop]: trace histogram [41, 41, 41, 39, 39, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:34:25,418 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:34:25,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:34:25,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1432758855, now seen corresponding path program 41 times [2019-10-01 22:34:25,419 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:34:25,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:34:25,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:34:25,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:34:25,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:34:25,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:34:26,901 INFO L134 CoverageAnalysis]: Checked inductivity of 4026 backedges. 2 proven. 2501 refuted. 0 times theorem prover too weak. 1523 trivial. 0 not checked. [2019-10-01 22:34:26,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:34:26,901 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:34:27,080 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:34:44,210 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2019-10-01 22:34:44,210 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:34:44,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 732 conjuncts, 41 conjunts are in the unsatisfiable core [2019-10-01 22:34:44,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:34:45,630 INFO L134 CoverageAnalysis]: Checked inductivity of 4026 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 2505 trivial. 0 not checked. [2019-10-01 22:34:45,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:34:45,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 42] total 86 [2019-10-01 22:34:45,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-10-01 22:34:45,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-10-01 22:34:45,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1811, Invalid=5499, Unknown=0, NotChecked=0, Total=7310 [2019-10-01 22:34:45,652 INFO L87 Difference]: Start difference. First operand 645 states and 916 transitions. Second operand 86 states. [2019-10-01 22:34:57,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:34:57,916 INFO L93 Difference]: Finished difference Result 3268 states and 4776 transitions. [2019-10-01 22:34:57,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2019-10-01 22:34:57,917 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 228 [2019-10-01 22:34:57,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:34:57,920 INFO L225 Difference]: With dead ends: 3268 [2019-10-01 22:34:57,920 INFO L226 Difference]: Without dead ends: 2704 [2019-10-01 22:34:57,922 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5903 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=6536, Invalid=22194, Unknown=0, NotChecked=0, Total=28730 [2019-10-01 22:34:57,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2704 states. [2019-10-01 22:34:58,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2704 to 659. [2019-10-01 22:34:58,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-10-01 22:34:58,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 936 transitions. [2019-10-01 22:34:58,060 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 936 transitions. Word has length 228 [2019-10-01 22:34:58,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:34:58,061 INFO L475 AbstractCegarLoop]: Abstraction has 659 states and 936 transitions. [2019-10-01 22:34:58,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-10-01 22:34:58,061 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 936 transitions. [2019-10-01 22:34:58,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-10-01 22:34:58,063 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:34:58,063 INFO L411 BasicCegarLoop]: trace histogram [42, 42, 42, 40, 40, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:34:58,063 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:34:58,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:34:58,063 INFO L82 PathProgramCache]: Analyzing trace with hash -2069673392, now seen corresponding path program 42 times [2019-10-01 22:34:58,063 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:34:58,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:34:58,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:34:58,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:34:58,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:34:58,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:34:59,364 INFO L134 CoverageAnalysis]: Checked inductivity of 4229 backedges. 2 proven. 2625 refuted. 0 times theorem prover too weak. 1602 trivial. 0 not checked. [2019-10-01 22:34:59,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:34:59,364 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:34:59,531 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:35:53,266 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2019-10-01 22:35:53,266 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:35:53,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 42 conjunts are in the unsatisfiable core [2019-10-01 22:35:53,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:35:54,125 INFO L134 CoverageAnalysis]: Checked inductivity of 4229 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 2629 trivial. 0 not checked. [2019-10-01 22:35:54,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:35:54,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 43] total 87 [2019-10-01 22:35:54,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-10-01 22:35:54,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-10-01 22:35:54,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1937, Invalid=5545, Unknown=0, NotChecked=0, Total=7482 [2019-10-01 22:35:54,147 INFO L87 Difference]: Start difference. First operand 659 states and 936 transitions. Second operand 87 states. [2019-10-01 22:35:56,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:35:56,633 INFO L93 Difference]: Finished difference Result 1250 states and 1813 transitions. [2019-10-01 22:35:56,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-10-01 22:35:56,634 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 233 [2019-10-01 22:35:56,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:35:56,635 INFO L225 Difference]: With dead ends: 1250 [2019-10-01 22:35:56,635 INFO L226 Difference]: Without dead ends: 678 [2019-10-01 22:35:56,652 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4305 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3741, Invalid=12515, Unknown=0, NotChecked=0, Total=16256 [2019-10-01 22:35:56,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2019-10-01 22:35:56,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 667. [2019-10-01 22:35:56,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2019-10-01 22:35:56,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 946 transitions. [2019-10-01 22:35:56,754 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 946 transitions. Word has length 233 [2019-10-01 22:35:56,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:35:56,755 INFO L475 AbstractCegarLoop]: Abstraction has 667 states and 946 transitions. [2019-10-01 22:35:56,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-10-01 22:35:56,755 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 946 transitions. [2019-10-01 22:35:56,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-01 22:35:56,756 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:35:56,756 INFO L411 BasicCegarLoop]: trace histogram [43, 43, 43, 41, 41, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:35:56,757 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:35:56,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:35:56,757 INFO L82 PathProgramCache]: Analyzing trace with hash 2035060061, now seen corresponding path program 43 times [2019-10-01 22:35:56,757 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:35:56,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:35:56,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:35:56,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:35:56,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:35:56,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:35:57,742 INFO L134 CoverageAnalysis]: Checked inductivity of 4437 backedges. 2 proven. 2752 refuted. 0 times theorem prover too weak. 1683 trivial. 0 not checked. [2019-10-01 22:35:57,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:35:57,742 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:35:57,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:35:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:35:58,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 764 conjuncts, 43 conjunts are in the unsatisfiable core [2019-10-01 22:35:58,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:35:59,461 INFO L134 CoverageAnalysis]: Checked inductivity of 4437 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 2756 trivial. 0 not checked. [2019-10-01 22:35:59,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:35:59,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 44] total 90 [2019-10-01 22:35:59,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-10-01 22:35:59,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-10-01 22:35:59,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1985, Invalid=6025, Unknown=0, NotChecked=0, Total=8010 [2019-10-01 22:35:59,468 INFO L87 Difference]: Start difference. First operand 667 states and 946 transitions. Second operand 90 states. [2019-10-01 22:36:13,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:36:13,182 INFO L93 Difference]: Finished difference Result 3436 states and 5022 transitions. [2019-10-01 22:36:13,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2019-10-01 22:36:13,182 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 238 [2019-10-01 22:36:13,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:36:13,185 INFO L225 Difference]: With dead ends: 3436 [2019-10-01 22:36:13,185 INFO L226 Difference]: Without dead ends: 2854 [2019-10-01 22:36:13,187 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6492 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=7155, Invalid=24351, Unknown=0, NotChecked=0, Total=31506 [2019-10-01 22:36:13,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2854 states. [2019-10-01 22:36:13,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2854 to 687. [2019-10-01 22:36:13,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2019-10-01 22:36:13,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 976 transitions. [2019-10-01 22:36:13,336 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 976 transitions. Word has length 238 [2019-10-01 22:36:13,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:36:13,337 INFO L475 AbstractCegarLoop]: Abstraction has 687 states and 976 transitions. [2019-10-01 22:36:13,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-10-01 22:36:13,337 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 976 transitions. [2019-10-01 22:36:13,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-10-01 22:36:13,339 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:36:13,339 INFO L411 BasicCegarLoop]: trace histogram [44, 44, 44, 42, 42, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:36:13,339 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:36:13,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:36:13,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1230830932, now seen corresponding path program 44 times [2019-10-01 22:36:13,340 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:36:13,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:36:13,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:36:13,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:36:13,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:36:13,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:36:14,615 INFO L134 CoverageAnalysis]: Checked inductivity of 4650 backedges. 2 proven. 2882 refuted. 0 times theorem prover too weak. 1766 trivial. 0 not checked. [2019-10-01 22:36:14,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:36:14,615 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:36:14,805 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:36:14,930 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:36:14,930 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:36:14,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 780 conjuncts, 44 conjunts are in the unsatisfiable core [2019-10-01 22:36:14,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:36:15,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4650 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 2886 trivial. 0 not checked. [2019-10-01 22:36:15,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:36:15,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 45] total 91 [2019-10-01 22:36:15,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-10-01 22:36:15,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-10-01 22:36:15,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2117, Invalid=6073, Unknown=0, NotChecked=0, Total=8190 [2019-10-01 22:36:15,687 INFO L87 Difference]: Start difference. First operand 687 states and 976 transitions. Second operand 91 states. [2019-10-01 22:36:18,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:36:18,170 INFO L93 Difference]: Finished difference Result 1302 states and 1889 transitions. [2019-10-01 22:36:18,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-10-01 22:36:18,171 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 243 [2019-10-01 22:36:18,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:36:18,171 INFO L225 Difference]: With dead ends: 1302 [2019-10-01 22:36:18,171 INFO L226 Difference]: Without dead ends: 706 [2019-10-01 22:36:18,173 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 201 SyntacticMatches, 1 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4730 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4095, Invalid=13727, Unknown=0, NotChecked=0, Total=17822 [2019-10-01 22:36:18,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2019-10-01 22:36:18,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 695. [2019-10-01 22:36:18,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 695 states. [2019-10-01 22:36:18,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 986 transitions. [2019-10-01 22:36:18,265 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 986 transitions. Word has length 243 [2019-10-01 22:36:18,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:36:18,265 INFO L475 AbstractCegarLoop]: Abstraction has 695 states and 986 transitions. [2019-10-01 22:36:18,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-10-01 22:36:18,265 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 986 transitions. [2019-10-01 22:36:18,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-10-01 22:36:18,267 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:36:18,267 INFO L411 BasicCegarLoop]: trace histogram [45, 45, 45, 43, 43, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:36:18,267 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:36:18,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:36:18,268 INFO L82 PathProgramCache]: Analyzing trace with hash -789973759, now seen corresponding path program 45 times [2019-10-01 22:36:18,268 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:36:18,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:36:18,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:36:18,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:36:18,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:36:18,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:36:19,719 INFO L134 CoverageAnalysis]: Checked inductivity of 4868 backedges. 2 proven. 3015 refuted. 0 times theorem prover too weak. 1851 trivial. 0 not checked. [2019-10-01 22:36:19,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:36:19,719 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:36:19,913 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:36:54,986 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-10-01 22:36:54,986 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:36:55,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 50 conjunts are in the unsatisfiable core [2019-10-01 22:36:55,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:36:55,867 INFO L134 CoverageAnalysis]: Checked inductivity of 4868 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 3019 trivial. 0 not checked. [2019-10-01 22:36:55,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:36:55,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 46] total 93 [2019-10-01 22:36:55,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-10-01 22:36:55,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-10-01 22:36:55,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2210, Invalid=6346, Unknown=0, NotChecked=0, Total=8556 [2019-10-01 22:36:55,882 INFO L87 Difference]: Start difference. First operand 695 states and 986 transitions. Second operand 93 states. [2019-10-01 22:36:58,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:36:58,444 INFO L93 Difference]: Finished difference Result 1316 states and 1907 transitions. [2019-10-01 22:36:58,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-10-01 22:36:58,444 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 248 [2019-10-01 22:36:58,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:36:58,445 INFO L225 Difference]: With dead ends: 1316 [2019-10-01 22:36:58,445 INFO L226 Difference]: Without dead ends: 714 [2019-10-01 22:36:58,447 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 205 SyntacticMatches, 1 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4950 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4278, Invalid=14354, Unknown=0, NotChecked=0, Total=18632 [2019-10-01 22:36:58,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-10-01 22:36:58,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 703. [2019-10-01 22:36:58,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2019-10-01 22:36:58,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 996 transitions. [2019-10-01 22:36:58,521 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 996 transitions. Word has length 248 [2019-10-01 22:36:58,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:36:58,521 INFO L475 AbstractCegarLoop]: Abstraction has 703 states and 996 transitions. [2019-10-01 22:36:58,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-10-01 22:36:58,521 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 996 transitions. [2019-10-01 22:36:58,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-10-01 22:36:58,523 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:36:58,523 INFO L411 BasicCegarLoop]: trace histogram [46, 46, 46, 44, 44, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:36:58,523 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:36:58,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:36:58,523 INFO L82 PathProgramCache]: Analyzing trace with hash 254339848, now seen corresponding path program 46 times [2019-10-01 22:36:58,523 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:36:58,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:36:58,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:36:58,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:36:58,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:36:58,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:37:00,045 INFO L134 CoverageAnalysis]: Checked inductivity of 5091 backedges. 2 proven. 3151 refuted. 0 times theorem prover too weak. 1938 trivial. 0 not checked. [2019-10-01 22:37:00,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:37:00,045 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:37:00,248 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:37:00,382 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:37:00,382 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:37:00,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 812 conjuncts, 46 conjunts are in the unsatisfiable core [2019-10-01 22:37:00,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:37:01,221 INFO L134 CoverageAnalysis]: Checked inductivity of 5091 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 3155 trivial. 0 not checked. [2019-10-01 22:37:01,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:37:01,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 47] total 95 [2019-10-01 22:37:01,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-10-01 22:37:01,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-10-01 22:37:01,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2305, Invalid=6625, Unknown=0, NotChecked=0, Total=8930 [2019-10-01 22:37:01,227 INFO L87 Difference]: Start difference. First operand 703 states and 996 transitions. Second operand 95 states. [2019-10-01 22:37:03,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:37:03,889 INFO L93 Difference]: Finished difference Result 1330 states and 1925 transitions. [2019-10-01 22:37:03,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-10-01 22:37:03,889 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 253 [2019-10-01 22:37:03,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:37:03,890 INFO L225 Difference]: With dead ends: 1330 [2019-10-01 22:37:03,890 INFO L226 Difference]: Without dead ends: 722 [2019-10-01 22:37:03,892 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 209 SyntacticMatches, 1 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5175 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4465, Invalid=14995, Unknown=0, NotChecked=0, Total=19460 [2019-10-01 22:37:03,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2019-10-01 22:37:03,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 711. [2019-10-01 22:37:03,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 711 states. [2019-10-01 22:37:03,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 1006 transitions. [2019-10-01 22:37:03,961 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 1006 transitions. Word has length 253 [2019-10-01 22:37:03,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:37:03,962 INFO L475 AbstractCegarLoop]: Abstraction has 711 states and 1006 transitions. [2019-10-01 22:37:03,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-10-01 22:37:03,962 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 1006 transitions. [2019-10-01 22:37:03,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-10-01 22:37:03,963 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:37:03,964 INFO L411 BasicCegarLoop]: trace histogram [47, 47, 47, 45, 45, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:37:03,964 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:37:03,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:37:03,964 INFO L82 PathProgramCache]: Analyzing trace with hash 481316005, now seen corresponding path program 47 times [2019-10-01 22:37:03,964 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:37:03,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:37:03,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:37:03,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:37:03,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:37:04,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:37:05,342 INFO L134 CoverageAnalysis]: Checked inductivity of 5319 backedges. 2 proven. 3290 refuted. 0 times theorem prover too weak. 2027 trivial. 0 not checked. [2019-10-01 22:37:05,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:37:05,343 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:37:05,547 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:37:35,050 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2019-10-01 22:37:35,050 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:37:35,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 828 conjuncts, 47 conjunts are in the unsatisfiable core [2019-10-01 22:37:35,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:37:35,971 INFO L134 CoverageAnalysis]: Checked inductivity of 5319 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 3294 trivial. 0 not checked. [2019-10-01 22:37:35,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:37:35,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 48] total 97 [2019-10-01 22:37:35,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-10-01 22:37:35,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-10-01 22:37:35,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2402, Invalid=6910, Unknown=0, NotChecked=0, Total=9312 [2019-10-01 22:37:35,991 INFO L87 Difference]: Start difference. First operand 711 states and 1006 transitions. Second operand 97 states. [2019-10-01 22:37:38,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:37:38,822 INFO L93 Difference]: Finished difference Result 1344 states and 1943 transitions. [2019-10-01 22:37:38,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-10-01 22:37:38,822 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 258 [2019-10-01 22:37:38,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:37:38,823 INFO L225 Difference]: With dead ends: 1344 [2019-10-01 22:37:38,823 INFO L226 Difference]: Without dead ends: 730 [2019-10-01 22:37:38,825 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 213 SyntacticMatches, 1 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5405 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4656, Invalid=15650, Unknown=0, NotChecked=0, Total=20306 [2019-10-01 22:37:38,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-10-01 22:37:38,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 719. [2019-10-01 22:37:38,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2019-10-01 22:37:38,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1016 transitions. [2019-10-01 22:37:38,910 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1016 transitions. Word has length 258 [2019-10-01 22:37:38,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:37:38,910 INFO L475 AbstractCegarLoop]: Abstraction has 719 states and 1016 transitions. [2019-10-01 22:37:38,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-10-01 22:37:38,910 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1016 transitions. [2019-10-01 22:37:38,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-10-01 22:37:38,912 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:37:38,912 INFO L411 BasicCegarLoop]: trace histogram [48, 48, 48, 46, 46, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:37:38,913 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:37:38,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:37:38,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1781973860, now seen corresponding path program 48 times [2019-10-01 22:37:38,913 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:37:38,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:37:38,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:37:38,915 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:37:38,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:37:38,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:37:40,114 INFO L134 CoverageAnalysis]: Checked inductivity of 5552 backedges. 2 proven. 3432 refuted. 0 times theorem prover too weak. 2118 trivial. 0 not checked. [2019-10-01 22:37:40,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:37:40,114 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:37:40,329 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:39:59,741 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2019-10-01 22:39:59,741 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:39:59,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 844 conjuncts, 56 conjunts are in the unsatisfiable core [2019-10-01 22:39:59,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:40:02,382 INFO L134 CoverageAnalysis]: Checked inductivity of 5552 backedges. 91 proven. 3432 refuted. 0 times theorem prover too weak. 2029 trivial. 0 not checked. [2019-10-01 22:40:02,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:40:02,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 54] total 105 [2019-10-01 22:40:02,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-10-01 22:40:02,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-10-01 22:40:02,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2561, Invalid=8359, Unknown=0, NotChecked=0, Total=10920 [2019-10-01 22:40:02,407 INFO L87 Difference]: Start difference. First operand 719 states and 1016 transitions. Second operand 105 states. [2019-10-01 22:40:30,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:40:30,767 INFO L93 Difference]: Finished difference Result 3574 states and 5263 transitions. [2019-10-01 22:40:30,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2019-10-01 22:40:30,771 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 263 [2019-10-01 22:40:30,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:40:30,777 INFO L225 Difference]: With dead ends: 3574 [2019-10-01 22:40:30,777 INFO L226 Difference]: Without dead ends: 3244 [2019-10-01 22:40:30,783 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 303 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25878 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=19290, Invalid=73430, Unknown=0, NotChecked=0, Total=92720 [2019-10-01 22:40:30,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3244 states. [2019-10-01 22:40:30,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3244 to 755. [2019-10-01 22:40:30,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2019-10-01 22:40:30,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1074 transitions. [2019-10-01 22:40:30,908 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1074 transitions. Word has length 263 [2019-10-01 22:40:30,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:40:30,908 INFO L475 AbstractCegarLoop]: Abstraction has 755 states and 1074 transitions. [2019-10-01 22:40:30,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-10-01 22:40:30,908 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1074 transitions. [2019-10-01 22:40:30,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-10-01 22:40:30,910 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:40:30,910 INFO L411 BasicCegarLoop]: trace histogram [49, 49, 49, 46, 46, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:40:30,910 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:40:30,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:40:30,911 INFO L82 PathProgramCache]: Analyzing trace with hash -176266009, now seen corresponding path program 49 times [2019-10-01 22:40:30,911 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:40:30,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:40:30,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:40:30,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:40:30,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:40:30,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:40:32,497 INFO L134 CoverageAnalysis]: Checked inductivity of 5697 backedges. 2 proven. 3577 refuted. 0 times theorem prover too weak. 2118 trivial. 0 not checked. [2019-10-01 22:40:32,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:40:32,497 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:40:32,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:40:32,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:40:32,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 854 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-01 22:40:32,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:40:33,792 INFO L134 CoverageAnalysis]: Checked inductivity of 5697 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 3581 trivial. 0 not checked. [2019-10-01 22:40:33,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:40:33,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 49] total 100 [2019-10-01 22:40:33,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-10-01 22:40:33,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-10-01 22:40:33,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2553, Invalid=7347, Unknown=0, NotChecked=0, Total=9900 [2019-10-01 22:40:33,834 INFO L87 Difference]: Start difference. First operand 755 states and 1074 transitions. Second operand 100 states. [2019-10-01 22:40:36,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:40:36,909 INFO L93 Difference]: Finished difference Result 1430 states and 2077 transitions. [2019-10-01 22:40:36,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-10-01 22:40:36,910 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 266 [2019-10-01 22:40:36,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:40:36,911 INFO L225 Difference]: With dead ends: 1430 [2019-10-01 22:40:36,911 INFO L226 Difference]: Without dead ends: 774 [2019-10-01 22:40:36,913 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 220 SyntacticMatches, 1 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5734 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=4903, Invalid=16559, Unknown=0, NotChecked=0, Total=21462 [2019-10-01 22:40:36,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2019-10-01 22:40:37,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 763. [2019-10-01 22:40:37,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 763 states. [2019-10-01 22:40:37,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1084 transitions. [2019-10-01 22:40:37,051 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1084 transitions. Word has length 266 [2019-10-01 22:40:37,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:40:37,051 INFO L475 AbstractCegarLoop]: Abstraction has 763 states and 1084 transitions. [2019-10-01 22:40:37,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-10-01 22:40:37,051 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1084 transitions. [2019-10-01 22:40:37,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-10-01 22:40:37,053 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:40:37,053 INFO L411 BasicCegarLoop]: trace histogram [50, 50, 50, 47, 47, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:40:37,053 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:40:37,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:40:37,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1616548382, now seen corresponding path program 50 times [2019-10-01 22:40:37,054 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:40:37,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:40:37,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:40:37,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:40:37,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:40:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:40:38,396 INFO L134 CoverageAnalysis]: Checked inductivity of 5938 backedges. 2 proven. 3725 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-10-01 22:40:38,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:40:38,396 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:40:38,616 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:40:38,749 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:40:38,749 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:40:38,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 870 conjuncts, 49 conjunts are in the unsatisfiable core [2019-10-01 22:40:38,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:40:40,611 INFO L134 CoverageAnalysis]: Checked inductivity of 5938 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 3729 trivial. 0 not checked. [2019-10-01 22:40:40,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:40:40,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 50] total 103 [2019-10-01 22:40:40,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-10-01 22:40:40,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-10-01 22:40:40,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2607, Invalid=7899, Unknown=0, NotChecked=0, Total=10506 [2019-10-01 22:40:40,618 INFO L87 Difference]: Start difference. First operand 763 states and 1084 transitions. Second operand 103 states. [2019-10-01 22:40:58,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:40:58,367 INFO L93 Difference]: Finished difference Result 3959 states and 5790 transitions. [2019-10-01 22:40:58,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 205 states. [2019-10-01 22:40:58,368 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 271 [2019-10-01 22:40:58,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:40:58,372 INFO L225 Difference]: With dead ends: 3959 [2019-10-01 22:40:58,372 INFO L226 Difference]: Without dead ends: 3293 [2019-10-01 22:40:58,377 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8723 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=9492, Invalid=32328, Unknown=0, NotChecked=0, Total=41820 [2019-10-01 22:40:58,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3293 states. [2019-10-01 22:40:58,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3293 to 783. [2019-10-01 22:40:58,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-10-01 22:40:58,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1114 transitions. [2019-10-01 22:40:58,503 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1114 transitions. Word has length 271 [2019-10-01 22:40:58,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:40:58,503 INFO L475 AbstractCegarLoop]: Abstraction has 783 states and 1114 transitions. [2019-10-01 22:40:58,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-10-01 22:40:58,504 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1114 transitions. [2019-10-01 22:40:58,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-10-01 22:40:58,505 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:40:58,505 INFO L411 BasicCegarLoop]: trace histogram [51, 51, 51, 48, 48, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:40:58,505 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:40:58,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:40:58,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1694257397, now seen corresponding path program 51 times [2019-10-01 22:40:58,506 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:40:58,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:40:58,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:40:58,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:40:58,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:40:58,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:40:59,933 INFO L134 CoverageAnalysis]: Checked inductivity of 6184 backedges. 2 proven. 3876 refuted. 0 times theorem prover too weak. 2306 trivial. 0 not checked. [2019-10-01 22:40:59,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:40:59,934 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:41:00,172 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:41:51,475 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2019-10-01 22:41:51,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:41:51,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 856 conjuncts, 55 conjunts are in the unsatisfiable core [2019-10-01 22:41:51,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:41:53,479 INFO L134 CoverageAnalysis]: Checked inductivity of 6184 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 3880 trivial. 0 not checked. [2019-10-01 22:41:53,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:41:53,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 51] total 105 [2019-10-01 22:41:53,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-10-01 22:41:53,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-10-01 22:41:53,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2710, Invalid=8210, Unknown=0, NotChecked=0, Total=10920 [2019-10-01 22:41:53,495 INFO L87 Difference]: Start difference. First operand 783 states and 1114 transitions. Second operand 105 states. [2019-10-01 22:42:13,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:42:13,347 INFO L93 Difference]: Finished difference Result 4016 states and 5874 transitions. [2019-10-01 22:42:13,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2019-10-01 22:42:13,347 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 276 [2019-10-01 22:42:13,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:42:13,352 INFO L225 Difference]: With dead ends: 4016 [2019-10-01 22:42:13,352 INFO L226 Difference]: Without dead ends: 3332 [2019-10-01 22:42:13,356 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9076 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=9860, Invalid=33612, Unknown=0, NotChecked=0, Total=43472 [2019-10-01 22:42:13,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3332 states. [2019-10-01 22:42:13,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3332 to 797. [2019-10-01 22:42:13,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-10-01 22:42:13,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1134 transitions. [2019-10-01 22:42:13,481 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1134 transitions. Word has length 276 [2019-10-01 22:42:13,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:42:13,481 INFO L475 AbstractCegarLoop]: Abstraction has 797 states and 1134 transitions. [2019-10-01 22:42:13,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-10-01 22:42:13,481 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1134 transitions. [2019-10-01 22:42:13,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-10-01 22:42:13,482 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:42:13,483 INFO L411 BasicCegarLoop]: trace histogram [52, 52, 52, 49, 49, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:42:13,483 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:42:13,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:42:13,483 INFO L82 PathProgramCache]: Analyzing trace with hash 589669310, now seen corresponding path program 52 times [2019-10-01 22:42:13,483 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:42:13,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:42:13,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:13,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:42:13,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:42:15,100 INFO L134 CoverageAnalysis]: Checked inductivity of 6435 backedges. 2 proven. 4030 refuted. 0 times theorem prover too weak. 2403 trivial. 0 not checked. [2019-10-01 22:42:15,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:42:15,100 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:42:15,363 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:42:15,556 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:42:15,556 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:42:15,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 902 conjuncts, 51 conjunts are in the unsatisfiable core [2019-10-01 22:42:15,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:42:16,541 INFO L134 CoverageAnalysis]: Checked inductivity of 6435 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 4034 trivial. 0 not checked. [2019-10-01 22:42:16,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:42:16,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 52] total 106 [2019-10-01 22:42:16,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-10-01 22:42:16,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-10-01 22:42:16,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2865, Invalid=8265, Unknown=0, NotChecked=0, Total=11130 [2019-10-01 22:42:16,549 INFO L87 Difference]: Start difference. First operand 797 states and 1134 transitions. Second operand 106 states. [2019-10-01 22:42:19,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:42:19,909 INFO L93 Difference]: Finished difference Result 1508 states and 2191 transitions. [2019-10-01 22:42:19,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-10-01 22:42:19,909 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 281 [2019-10-01 22:42:19,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:42:19,910 INFO L225 Difference]: With dead ends: 1508 [2019-10-01 22:42:19,911 INFO L226 Difference]: Without dead ends: 816 [2019-10-01 22:42:19,914 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 232 SyntacticMatches, 1 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6475 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5515, Invalid=18665, Unknown=0, NotChecked=0, Total=24180 [2019-10-01 22:42:19,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2019-10-01 22:42:20,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 805. [2019-10-01 22:42:20,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2019-10-01 22:42:20,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1144 transitions. [2019-10-01 22:42:20,008 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1144 transitions. Word has length 281 [2019-10-01 22:42:20,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:42:20,009 INFO L475 AbstractCegarLoop]: Abstraction has 805 states and 1144 transitions. [2019-10-01 22:42:20,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-10-01 22:42:20,009 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1144 transitions. [2019-10-01 22:42:20,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-10-01 22:42:20,011 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:42:20,011 INFO L411 BasicCegarLoop]: trace histogram [53, 53, 53, 50, 50, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:42:20,011 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:42:20,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:42:20,012 INFO L82 PathProgramCache]: Analyzing trace with hash 579307823, now seen corresponding path program 53 times [2019-10-01 22:42:20,012 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:42:20,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:42:20,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:20,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:42:20,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:20,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:42:21,753 INFO L134 CoverageAnalysis]: Checked inductivity of 6691 backedges. 2 proven. 4187 refuted. 0 times theorem prover too weak. 2502 trivial. 0 not checked. [2019-10-01 22:42:21,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:42:21,753 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:42:22,011 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1