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/standard_seq_init_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 10:27:52,769 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 10:27:52,771 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 10:27:52,783 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 10:27:52,784 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 10:27:52,785 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 10:27:52,786 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 10:27:52,788 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 10:27:52,790 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 10:27:52,791 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 10:27:52,792 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 10:27:52,793 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 10:27:52,793 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 10:27:52,794 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 10:27:52,795 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 10:27:52,796 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 10:27:52,797 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 10:27:52,798 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 10:27:52,800 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 10:27:52,804 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 10:27:52,805 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 10:27:52,806 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 10:27:52,807 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 10:27:52,808 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 10:27:52,810 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 10:27:52,810 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 10:27:52,811 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 10:27:52,811 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 10:27:52,812 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 10:27:52,813 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 10:27:52,813 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 10:27:52,814 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 10:27:52,815 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 10:27:52,815 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 10:27:52,816 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 10:27:52,817 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 10:27:52,817 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 10:27:52,817 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 10:27:52,818 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 10:27:52,819 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 10:27:52,819 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 10:27:52,820 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-09-07 10:27:52,835 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 10:27:52,835 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 10:27:52,836 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 10:27:52,837 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 10:27:52,837 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 10:27:52,837 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 10:27:52,837 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 10:27:52,838 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 10:27:52,838 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 10:27:52,838 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 10:27:52,838 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 10:27:52,838 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 10:27:52,839 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 10:27:52,839 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 10:27:52,839 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 10:27:52,839 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 10:27:52,839 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 10:27:52,840 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 10:27:52,840 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 10:27:52,840 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 10:27:52,840 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 10:27:52,840 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 10:27:52,841 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 10:27:52,841 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 10:27:52,841 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 10:27:52,841 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 10:27:52,841 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 10:27:52,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 10:27:52,842 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 10:27:52,871 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 10:27:52,884 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 10:27:52,887 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 10:27:52,889 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 10:27:52,889 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 10:27:52,890 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_seq_init_ground.i [2019-09-07 10:27:52,968 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bded515b/209fe41d271d481c876e1491b7c6a2c9/FLAGb926bc82c [2019-09-07 10:27:53,420 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 10:27:53,422 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_seq_init_ground.i [2019-09-07 10:27:53,429 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bded515b/209fe41d271d481c876e1491b7c6a2c9/FLAGb926bc82c [2019-09-07 10:27:53,807 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bded515b/209fe41d271d481c876e1491b7c6a2c9 [2019-09-07 10:27:53,819 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 10:27:53,821 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 10:27:53,822 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 10:27:53,822 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 10:27:53,826 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 10:27:53,827 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:27:53" (1/1) ... [2019-09-07 10:27:53,830 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@621c7695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:27:53, skipping insertion in model container [2019-09-07 10:27:53,831 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:27:53" (1/1) ... [2019-09-07 10:27:53,838 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 10:27:53,855 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 10:27:54,055 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 10:27:54,065 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 10:27:54,091 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 10:27:54,108 INFO L192 MainTranslator]: Completed translation [2019-09-07 10:27:54,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:27:54 WrapperNode [2019-09-07 10:27:54,109 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 10:27:54,110 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 10:27:54,110 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 10:27:54,110 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 10:27:54,218 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:27:54" (1/1) ... [2019-09-07 10:27:54,218 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:27:54" (1/1) ... [2019-09-07 10:27:54,227 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:27:54" (1/1) ... [2019-09-07 10:27:54,227 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:27:54" (1/1) ... [2019-09-07 10:27:54,240 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:27:54" (1/1) ... [2019-09-07 10:27:54,247 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:27:54" (1/1) ... [2019-09-07 10:27:54,254 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:27:54" (1/1) ... [2019-09-07 10:27:54,259 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 10:27:54,260 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 10:27:54,260 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 10:27:54,262 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 10:27:54,263 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:27:54" (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-09-07 10:27:54,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 10:27:54,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 10:27:54,313 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-07 10:27:54,313 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 10:27:54,313 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 10:27:54,313 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-07 10:27:54,313 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 10:27:54,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-07 10:27:54,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-07 10:27:54,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-07 10:27:54,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-07 10:27:54,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 10:27:54,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 10:27:54,518 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 10:27:54,518 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-07 10:27:54,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:27:54 BoogieIcfgContainer [2019-09-07 10:27:54,520 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 10:27:54,521 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 10:27:54,521 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 10:27:54,524 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 10:27:54,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 10:27:53" (1/3) ... [2019-09-07 10:27:54,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ca18bab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:27:54, skipping insertion in model container [2019-09-07 10:27:54,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:27:54" (2/3) ... [2019-09-07 10:27:54,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ca18bab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:27:54, skipping insertion in model container [2019-09-07 10:27:54,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:27:54" (3/3) ... [2019-09-07 10:27:54,528 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_seq_init_ground.i [2019-09-07 10:27:54,538 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 10:27:54,545 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 10:27:54,578 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 10:27:54,642 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 10:27:54,643 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 10:27:54,643 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 10:27:54,644 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 10:27:54,644 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 10:27:54,644 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 10:27:54,644 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 10:27:54,644 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 10:27:54,645 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 10:27:54,669 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-09-07 10:27:54,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-07 10:27:54,677 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:27:54,678 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:27:54,680 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:27:54,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:27:54,687 INFO L82 PathProgramCache]: Analyzing trace with hash -441053002, now seen corresponding path program 1 times [2019-09-07 10:27:54,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:27:54,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:27:54,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:27:54,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:27:54,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:27:54,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:27:54,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:27:54,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 10:27:54,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-07 10:27:54,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-07 10:27:54,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-07 10:27:54,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 10:27:54,841 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2019-09-07 10:27:54,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:27:54,867 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2019-09-07 10:27:54,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-07 10:27:54,869 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-09-07 10:27:54,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:27:54,878 INFO L225 Difference]: With dead ends: 39 [2019-09-07 10:27:54,878 INFO L226 Difference]: Without dead ends: 18 [2019-09-07 10:27:54,882 INFO L628 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-09-07 10:27:54,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-07 10:27:54,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-07 10:27:54,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-07 10:27:54,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-09-07 10:27:54,938 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2019-09-07 10:27:54,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:27:54,938 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-09-07 10:27:54,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-07 10:27:54,939 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-09-07 10:27:54,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-07 10:27:54,941 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:27:54,941 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:27:54,943 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:27:54,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:27:54,944 INFO L82 PathProgramCache]: Analyzing trace with hash 303899570, now seen corresponding path program 1 times [2019-09-07 10:27:54,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:27:54,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:27:54,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:27:54,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:27:54,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:27:54,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:27:55,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:27:55,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 10:27:55,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 10:27:55,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 10:27:55,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 10:27:55,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 10:27:55,060 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 3 states. [2019-09-07 10:27:55,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:27:55,091 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-09-07 10:27:55,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 10:27:55,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-09-07 10:27:55,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:27:55,094 INFO L225 Difference]: With dead ends: 30 [2019-09-07 10:27:55,094 INFO L226 Difference]: Without dead ends: 19 [2019-09-07 10:27:55,095 INFO L628 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-09-07 10:27:55,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-07 10:27:55,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-07 10:27:55,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-07 10:27:55,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-09-07 10:27:55,103 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 13 [2019-09-07 10:27:55,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:27:55,104 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-09-07 10:27:55,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 10:27:55,104 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-09-07 10:27:55,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-07 10:27:55,105 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:27:55,105 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:27:55,107 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:27:55,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:27:55,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1260126610, now seen corresponding path program 1 times [2019-09-07 10:27:55,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:27:55,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:27:55,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:27:55,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:27:55,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:27:55,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:27:55,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:27:55,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:27:55,195 INFO L223 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-09-07 10:27:55,210 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-09-07 10:27:55,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:27:55,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 10:27:55,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:27:55,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:27:55,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:27:55,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-09-07 10:27:55,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 10:27:55,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 10:27:55,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 10:27:55,278 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 4 states. [2019-09-07 10:27:55,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:27:55,304 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2019-09-07 10:27:55,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 10:27:55,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-09-07 10:27:55,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:27:55,308 INFO L225 Difference]: With dead ends: 31 [2019-09-07 10:27:55,308 INFO L226 Difference]: Without dead ends: 20 [2019-09-07 10:27:55,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 10:27:55,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-07 10:27:55,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-09-07 10:27:55,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-07 10:27:55,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-09-07 10:27:55,314 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 14 [2019-09-07 10:27:55,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:27:55,315 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-09-07 10:27:55,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 10:27:55,315 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-09-07 10:27:55,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-07 10:27:55,316 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:27:55,316 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:27:55,317 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:27:55,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:27:55,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1794669362, now seen corresponding path program 2 times [2019-09-07 10:27:55,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:27:55,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:27:55,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:27:55,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:27:55,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:27:55,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:27:55,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:27:55,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:27:55,399 INFO L223 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-09-07 10:27:55,419 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-09-07 10:27:55,453 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:27:55,454 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:27:55,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 10:27:55,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:27:55,467 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:27:55,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:27:55,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-09-07 10:27:55,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 10:27:55,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 10:27:55,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 10:27:55,474 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 5 states. [2019-09-07 10:27:55,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:27:55,501 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2019-09-07 10:27:55,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 10:27:55,502 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-09-07 10:27:55,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:27:55,503 INFO L225 Difference]: With dead ends: 32 [2019-09-07 10:27:55,503 INFO L226 Difference]: Without dead ends: 21 [2019-09-07 10:27:55,506 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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-09-07 10:27:55,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-07 10:27:55,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-07 10:27:55,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-07 10:27:55,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-09-07 10:27:55,515 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 15 [2019-09-07 10:27:55,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:27:55,516 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-09-07 10:27:55,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 10:27:55,516 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-09-07 10:27:55,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-07 10:27:55,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:27:55,518 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:27:55,518 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:27:55,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:27:55,519 INFO L82 PathProgramCache]: Analyzing trace with hash 2004063982, now seen corresponding path program 3 times [2019-09-07 10:27:55,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:27:55,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:27:55,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:27:55,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:27:55,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:27:55,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:27:55,611 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:27:55,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:27:55,612 INFO L223 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-09-07 10:27:55,626 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:27:55,662 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-07 10:27:55,663 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:27:55,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 10:27:55,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:27:55,677 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:27:55,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:27:55,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-09-07 10:27:55,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 10:27:55,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 10:27:55,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 10:27:55,688 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 6 states. [2019-09-07 10:27:55,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:27:55,726 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2019-09-07 10:27:55,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 10:27:55,728 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-09-07 10:27:55,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:27:55,729 INFO L225 Difference]: With dead ends: 33 [2019-09-07 10:27:55,729 INFO L226 Difference]: Without dead ends: 22 [2019-09-07 10:27:55,732 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 10:27:55,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-07 10:27:55,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-07 10:27:55,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-07 10:27:55,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2019-09-07 10:27:55,741 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 16 [2019-09-07 10:27:55,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:27:55,741 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2019-09-07 10:27:55,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 10:27:55,743 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2019-09-07 10:27:55,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-07 10:27:55,744 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:27:55,744 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:27:55,745 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:27:55,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:27:55,745 INFO L82 PathProgramCache]: Analyzing trace with hash -94637390, now seen corresponding path program 4 times [2019-09-07 10:27:55,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:27:55,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:27:55,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:27:55,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:27:55,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:27:55,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:27:55,848 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:27:55,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:27:55,848 INFO L223 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:27:55,862 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:27:55,885 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:27:55,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:27:55,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 10:27:55,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:27:55,896 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:27:55,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:27:55,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-09-07 10:27:55,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 10:27:55,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 10:27:55,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 10:27:55,907 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 7 states. [2019-09-07 10:27:55,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:27:55,936 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2019-09-07 10:27:55,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 10:27:55,937 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-09-07 10:27:55,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:27:55,940 INFO L225 Difference]: With dead ends: 34 [2019-09-07 10:27:55,941 INFO L226 Difference]: Without dead ends: 23 [2019-09-07 10:27:55,941 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 10:27:55,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-07 10:27:55,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-07 10:27:55,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-07 10:27:55,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-09-07 10:27:55,951 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 17 [2019-09-07 10:27:55,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:27:55,956 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-09-07 10:27:55,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 10:27:55,956 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-09-07 10:27:55,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-07 10:27:55,957 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:27:55,957 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:27:55,957 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:27:55,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:27:55,958 INFO L82 PathProgramCache]: Analyzing trace with hash -729870482, now seen corresponding path program 5 times [2019-09-07 10:27:55,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:27:55,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:27:55,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:27:55,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:27:55,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:27:55,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:27:56,108 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:27:56,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:27:56,109 INFO L223 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-09-07 10:27:56,133 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:27:56,166 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-09-07 10:27:56,166 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:27:56,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 10:27:56,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:27:56,176 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:27:56,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:27:56,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-09-07 10:27:56,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 10:27:56,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 10:27:56,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-07 10:27:56,189 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 8 states. [2019-09-07 10:27:56,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:27:56,222 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2019-09-07 10:27:56,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 10:27:56,222 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-09-07 10:27:56,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:27:56,223 INFO L225 Difference]: With dead ends: 35 [2019-09-07 10:27:56,223 INFO L226 Difference]: Without dead ends: 24 [2019-09-07 10:27:56,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-07 10:27:56,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-07 10:27:56,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-09-07 10:27:56,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-07 10:27:56,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-09-07 10:27:56,229 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 18 [2019-09-07 10:27:56,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:27:56,229 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-09-07 10:27:56,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 10:27:56,230 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-09-07 10:27:56,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-07 10:27:56,230 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:27:56,231 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:27:56,231 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:27:56,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:27:56,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1052740146, now seen corresponding path program 6 times [2019-09-07 10:27:56,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:27:56,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:27:56,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:27:56,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:27:56,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:27:56,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:27:56,305 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:27:56,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:27:56,305 INFO L223 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-09-07 10:27:56,331 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:27:56,356 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-09-07 10:27:56,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:27:56,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 10:27:56,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:27:56,367 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:27:56,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:27:56,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-09-07 10:27:56,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 10:27:56,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 10:27:56,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-07 10:27:56,373 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 9 states. [2019-09-07 10:27:56,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:27:56,401 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2019-09-07 10:27:56,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 10:27:56,401 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-09-07 10:27:56,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:27:56,402 INFO L225 Difference]: With dead ends: 36 [2019-09-07 10:27:56,402 INFO L226 Difference]: Without dead ends: 25 [2019-09-07 10:27:56,403 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-07 10:27:56,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-07 10:27:56,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-09-07 10:27:56,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-07 10:27:56,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-09-07 10:27:56,409 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 19 [2019-09-07 10:27:56,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:27:56,410 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-09-07 10:27:56,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 10:27:56,410 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-09-07 10:27:56,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-07 10:27:56,412 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:27:56,413 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:27:56,415 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:27:56,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:27:56,417 INFO L82 PathProgramCache]: Analyzing trace with hash 479094766, now seen corresponding path program 7 times [2019-09-07 10:27:56,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:27:56,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:27:56,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:27:56,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:27:56,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:27:56,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:27:56,538 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:27:56,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:27:56,539 INFO L223 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-09-07 10:27:56,554 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-09-07 10:27:56,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:27:56,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 10:27:56,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:27:56,595 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:27:56,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:27:56,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-09-07 10:27:56,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 10:27:56,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 10:27:56,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-07 10:27:56,609 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 10 states. [2019-09-07 10:27:56,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:27:56,642 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2019-09-07 10:27:56,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 10:27:56,644 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-09-07 10:27:56,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:27:56,645 INFO L225 Difference]: With dead ends: 37 [2019-09-07 10:27:56,646 INFO L226 Difference]: Without dead ends: 26 [2019-09-07 10:27:56,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-07 10:27:56,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-07 10:27:56,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-09-07 10:27:56,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-07 10:27:56,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-09-07 10:27:56,655 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 20 [2019-09-07 10:27:56,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:27:56,656 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-09-07 10:27:56,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 10:27:56,656 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-09-07 10:27:56,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-07 10:27:56,657 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:27:56,657 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:27:56,659 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:27:56,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:27:56,659 INFO L82 PathProgramCache]: Analyzing trace with hash -124042830, now seen corresponding path program 8 times [2019-09-07 10:27:56,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:27:56,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:27:56,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:27:56,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:27:56,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:27:56,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:27:56,802 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:27:56,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:27:56,802 INFO L223 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-09-07 10:27:56,828 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:27:56,848 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:27:56,848 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:27:56,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 10:27:56,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:27:56,867 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:27:56,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:27:56,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-09-07 10:27:56,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 10:27:56,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 10:27:56,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 10:27:56,886 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 11 states. [2019-09-07 10:27:56,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:27:56,911 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2019-09-07 10:27:56,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 10:27:56,912 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-09-07 10:27:56,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:27:56,912 INFO L225 Difference]: With dead ends: 38 [2019-09-07 10:27:56,912 INFO L226 Difference]: Without dead ends: 27 [2019-09-07 10:27:56,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 10:27:56,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-07 10:27:56,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-07 10:27:56,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-07 10:27:56,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-09-07 10:27:56,918 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 21 [2019-09-07 10:27:56,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:27:56,918 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-09-07 10:27:56,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 10:27:56,918 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-09-07 10:27:56,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-07 10:27:56,919 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:27:56,919 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:27:56,919 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:27:56,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:27:56,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1641439122, now seen corresponding path program 9 times [2019-09-07 10:27:56,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:27:56,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:27:56,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:27:56,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:27:56,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:27:56,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:27:57,015 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:27:57,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:27:57,015 INFO L223 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-09-07 10:27:57,033 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-09-07 10:27:57,107 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-07 10:27:57,107 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:27:57,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 10:27:57,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:27:57,127 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:27:57,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:27:57,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-09-07 10:27:57,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 10:27:57,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 10:27:57,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-07 10:27:57,135 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 12 states. [2019-09-07 10:27:57,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:27:57,188 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2019-09-07 10:27:57,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 10:27:57,193 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-09-07 10:27:57,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:27:57,194 INFO L225 Difference]: With dead ends: 39 [2019-09-07 10:27:57,194 INFO L226 Difference]: Without dead ends: 28 [2019-09-07 10:27:57,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-07 10:27:57,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-07 10:27:57,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-09-07 10:27:57,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-07 10:27:57,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-09-07 10:27:57,201 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 22 [2019-09-07 10:27:57,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:27:57,202 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-09-07 10:27:57,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 10:27:57,202 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-09-07 10:27:57,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-07 10:27:57,203 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:27:57,203 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:27:57,204 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:27:57,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:27:57,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1436083918, now seen corresponding path program 10 times [2019-09-07 10:27:57,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:27:57,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:27:57,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:27:57,206 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:27:57,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:27:57,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:27:57,346 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:27:57,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:27:57,347 INFO L223 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-09-07 10:27:57,361 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-09-07 10:27:57,387 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:27:57,387 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:27:57,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 10:27:57,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:27:57,407 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:27:57,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:27:57,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2019-09-07 10:27:57,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 10:27:57,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 10:27:57,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-07 10:27:57,419 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 13 states. [2019-09-07 10:27:57,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:27:57,456 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2019-09-07 10:27:57,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 10:27:57,457 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-09-07 10:27:57,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:27:57,458 INFO L225 Difference]: With dead ends: 40 [2019-09-07 10:27:57,458 INFO L226 Difference]: Without dead ends: 29 [2019-09-07 10:27:57,459 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-07 10:27:57,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-07 10:27:57,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-09-07 10:27:57,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-07 10:27:57,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-09-07 10:27:57,466 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 23 [2019-09-07 10:27:57,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:27:57,467 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-09-07 10:27:57,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 10:27:57,467 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-09-07 10:27:57,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-07 10:27:57,471 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:27:57,471 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:27:57,472 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:27:57,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:27:57,474 INFO L82 PathProgramCache]: Analyzing trace with hash 634960110, now seen corresponding path program 11 times [2019-09-07 10:27:57,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:27:57,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:27:57,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:27:57,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:27:57,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:27:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:27:57,604 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:27:57,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:27:57,604 INFO L223 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) [2019-09-07 10:27:57,627 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:27:57,698 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-09-07 10:27:57,698 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:27:57,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 10:27:57,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:27:57,720 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:27:57,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:27:57,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2019-09-07 10:27:57,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 10:27:57,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 10:27:57,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-07 10:27:57,726 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 14 states. [2019-09-07 10:27:57,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:27:57,757 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2019-09-07 10:27:57,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 10:27:57,758 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2019-09-07 10:27:57,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:27:57,759 INFO L225 Difference]: With dead ends: 41 [2019-09-07 10:27:57,759 INFO L226 Difference]: Without dead ends: 30 [2019-09-07 10:27:57,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-07 10:27:57,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-07 10:27:57,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-09-07 10:27:57,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-07 10:27:57,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-09-07 10:27:57,763 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 24 [2019-09-07 10:27:57,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:27:57,764 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-09-07 10:27:57,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 10:27:57,764 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-09-07 10:27:57,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-07 10:27:57,765 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:27:57,765 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:27:57,765 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:27:57,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:27:57,765 INFO L82 PathProgramCache]: Analyzing trace with hash 412815538, now seen corresponding path program 12 times [2019-09-07 10:27:57,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:27:57,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:27:57,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:27:57,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:27:57,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:27:57,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:27:57,906 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:27:57,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:27:57,906 INFO L223 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-09-07 10:27:57,923 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:27:58,075 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-07 10:27:58,076 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:27:58,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 10:27:58,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:27:58,088 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:27:58,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:27:58,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2019-09-07 10:27:58,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 10:27:58,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 10:27:58,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-07 10:27:58,095 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 15 states. [2019-09-07 10:27:58,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:27:58,133 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-09-07 10:27:58,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 10:27:58,133 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2019-09-07 10:27:58,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:27:58,134 INFO L225 Difference]: With dead ends: 42 [2019-09-07 10:27:58,134 INFO L226 Difference]: Without dead ends: 31 [2019-09-07 10:27:58,135 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-07 10:27:58,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-07 10:27:58,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-09-07 10:27:58,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-07 10:27:58,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-09-07 10:27:58,139 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 25 [2019-09-07 10:27:58,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:27:58,140 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-09-07 10:27:58,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 10:27:58,140 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-09-07 10:27:58,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-07 10:27:58,140 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:27:58,141 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:27:58,141 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:27:58,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:27:58,141 INFO L82 PathProgramCache]: Analyzing trace with hash 2116268398, now seen corresponding path program 13 times [2019-09-07 10:27:58,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:27:58,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:27:58,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:27:58,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:27:58,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:27:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:27:58,291 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:27:58,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:27:58,291 INFO L223 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-09-07 10:27:58,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:27:58,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:27:58,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 10:27:58,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:27:58,332 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (14)] Exception during sending of exit command (exit): Stream closed [2019-09-07 10:27:58,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:27:58,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2019-09-07 10:27:58,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 10:27:58,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 10:27:58,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 10:27:58,343 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 16 states. [2019-09-07 10:27:58,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:27:58,386 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2019-09-07 10:27:58,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 10:27:58,387 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-09-07 10:27:58,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:27:58,387 INFO L225 Difference]: With dead ends: 43 [2019-09-07 10:27:58,387 INFO L226 Difference]: Without dead ends: 32 [2019-09-07 10:27:58,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 10:27:58,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-07 10:27:58,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-09-07 10:27:58,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-07 10:27:58,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-09-07 10:27:58,396 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 26 [2019-09-07 10:27:58,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:27:58,396 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-09-07 10:27:58,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 10:27:58,396 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-09-07 10:27:58,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-07 10:27:58,397 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:27:58,397 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:27:58,397 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:27:58,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:27:58,398 INFO L82 PathProgramCache]: Analyzing trace with hash -911267790, now seen corresponding path program 14 times [2019-09-07 10:27:58,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:27:58,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:27:58,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:27:58,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:27:58,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:27:58,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:27:58,581 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:27:58,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:27:58,581 INFO L223 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-09-07 10:27:58,608 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:27:58,631 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:27:58,631 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:27:58,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 10:27:58,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:27:58,642 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:27:58,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:27:58,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2019-09-07 10:27:58,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 10:27:58,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 10:27:58,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-07 10:27:58,650 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 17 states. [2019-09-07 10:27:58,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:27:58,673 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2019-09-07 10:27:58,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 10:27:58,675 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-09-07 10:27:58,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:27:58,676 INFO L225 Difference]: With dead ends: 44 [2019-09-07 10:27:58,676 INFO L226 Difference]: Without dead ends: 33 [2019-09-07 10:27:58,677 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-07 10:27:58,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-07 10:27:58,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-07 10:27:58,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-07 10:27:58,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-09-07 10:27:58,680 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 27 [2019-09-07 10:27:58,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:27:58,681 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-09-07 10:27:58,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 10:27:58,681 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-09-07 10:27:58,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-07 10:27:58,682 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:27:58,682 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:27:58,682 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:27:58,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:27:58,682 INFO L82 PathProgramCache]: Analyzing trace with hash -275609106, now seen corresponding path program 15 times [2019-09-07 10:27:58,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:27:58,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:27:58,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:27:58,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:27:58,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:27:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:27:58,848 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:27:58,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:27:58,848 INFO L223 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-09-07 10:27:58,871 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:27:59,085 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-07 10:27:59,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:27:59,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 10:27:59,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:27:59,098 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:27:59,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:27:59,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2019-09-07 10:27:59,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-07 10:27:59,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-07 10:27:59,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-07 10:27:59,109 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 18 states. [2019-09-07 10:27:59,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:27:59,144 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2019-09-07 10:27:59,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 10:27:59,145 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 28 [2019-09-07 10:27:59,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:27:59,145 INFO L225 Difference]: With dead ends: 45 [2019-09-07 10:27:59,145 INFO L226 Difference]: Without dead ends: 34 [2019-09-07 10:27:59,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-07 10:27:59,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-07 10:27:59,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-09-07 10:27:59,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-07 10:27:59,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2019-09-07 10:27:59,150 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 28 [2019-09-07 10:27:59,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:27:59,151 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2019-09-07 10:27:59,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-07 10:27:59,151 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2019-09-07 10:27:59,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-07 10:27:59,151 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:27:59,151 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:27:59,152 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:27:59,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:27:59,152 INFO L82 PathProgramCache]: Analyzing trace with hash -2045026382, now seen corresponding path program 16 times [2019-09-07 10:27:59,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:27:59,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:27:59,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:27:59,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:27:59,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:27:59,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:27:59,322 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:27:59,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:27:59,323 INFO L223 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) [2019-09-07 10:27:59,349 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:27:59,370 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:27:59,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:27:59,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 10:27:59,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:27:59,382 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:27:59,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:27:59,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2019-09-07 10:27:59,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 10:27:59,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 10:27:59,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-07 10:27:59,388 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 19 states. [2019-09-07 10:27:59,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:27:59,416 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2019-09-07 10:27:59,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 10:27:59,417 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 29 [2019-09-07 10:27:59,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:27:59,418 INFO L225 Difference]: With dead ends: 46 [2019-09-07 10:27:59,418 INFO L226 Difference]: Without dead ends: 35 [2019-09-07 10:27:59,419 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-07 10:27:59,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-07 10:27:59,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-09-07 10:27:59,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-07 10:27:59,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-09-07 10:27:59,423 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 29 [2019-09-07 10:27:59,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:27:59,423 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-09-07 10:27:59,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 10:27:59,423 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-09-07 10:27:59,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-07 10:27:59,424 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:27:59,424 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:27:59,424 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:27:59,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:27:59,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1062387090, now seen corresponding path program 17 times [2019-09-07 10:27:59,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:27:59,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:27:59,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:27:59,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:27:59,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:27:59,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:27:59,667 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:27:59,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:27:59,668 INFO L223 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-09-07 10:27:59,697 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:28:00,072 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-09-07 10:28:00,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:28:00,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 10:28:00,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:28:00,086 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:28:00,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:28:00,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2019-09-07 10:28:00,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 10:28:00,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 10:28:00,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-07 10:28:00,093 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 20 states. [2019-09-07 10:28:00,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:28:00,135 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2019-09-07 10:28:00,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 10:28:00,136 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2019-09-07 10:28:00,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:28:00,136 INFO L225 Difference]: With dead ends: 47 [2019-09-07 10:28:00,136 INFO L226 Difference]: Without dead ends: 36 [2019-09-07 10:28:00,137 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-07 10:28:00,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-07 10:28:00,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-09-07 10:28:00,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-07 10:28:00,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-09-07 10:28:00,141 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 30 [2019-09-07 10:28:00,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:28:00,142 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-09-07 10:28:00,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 10:28:00,142 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-09-07 10:28:00,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-07 10:28:00,142 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:28:00,143 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:28:00,143 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:28:00,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:28:00,143 INFO L82 PathProgramCache]: Analyzing trace with hash -665340110, now seen corresponding path program 18 times [2019-09-07 10:28:00,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:28:00,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:28:00,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:00,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:28:00,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:00,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:00,368 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:28:00,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:28:00,369 INFO L223 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) [2019-09-07 10:28:00,387 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:28:00,705 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-09-07 10:28:00,705 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:28:00,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 10:28:00,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:28:00,719 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:28:00,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:28:00,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2019-09-07 10:28:00,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 10:28:00,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 10:28:00,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-07 10:28:00,728 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 21 states. [2019-09-07 10:28:00,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:28:00,766 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2019-09-07 10:28:00,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 10:28:00,767 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 31 [2019-09-07 10:28:00,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:28:00,767 INFO L225 Difference]: With dead ends: 48 [2019-09-07 10:28:00,767 INFO L226 Difference]: Without dead ends: 37 [2019-09-07 10:28:00,768 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-07 10:28:00,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-07 10:28:00,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-09-07 10:28:00,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-07 10:28:00,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-09-07 10:28:00,771 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 31 [2019-09-07 10:28:00,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:28:00,771 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-09-07 10:28:00,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 10:28:00,771 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-09-07 10:28:00,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-07 10:28:00,772 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:28:00,772 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:28:00,772 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:28:00,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:28:00,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1241785618, now seen corresponding path program 19 times [2019-09-07 10:28:00,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:28:00,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:28:00,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:00,774 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:28:00,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:00,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:01,009 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:28:01,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:28:01,009 INFO L223 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) [2019-09-07 10:28:01,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:28:01,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:01,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-07 10:28:01,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:28:01,074 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:28:01,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:28:01,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2019-09-07 10:28:01,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-07 10:28:01,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-07 10:28:01,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-07 10:28:01,079 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 22 states. [2019-09-07 10:28:01,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:28:01,112 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2019-09-07 10:28:01,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 10:28:01,113 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 32 [2019-09-07 10:28:01,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:28:01,114 INFO L225 Difference]: With dead ends: 49 [2019-09-07 10:28:01,114 INFO L226 Difference]: Without dead ends: 38 [2019-09-07 10:28:01,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-07 10:28:01,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-07 10:28:01,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-09-07 10:28:01,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-07 10:28:01,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-09-07 10:28:01,118 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 32 [2019-09-07 10:28:01,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:28:01,119 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-09-07 10:28:01,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-07 10:28:01,119 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-09-07 10:28:01,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-07 10:28:01,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:28:01,120 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:28:01,120 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:28:01,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:28:01,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1931727182, now seen corresponding path program 20 times [2019-09-07 10:28:01,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:28:01,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:28:01,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:01,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:28:01,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:01,381 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:28:01,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:28:01,382 INFO L223 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-09-07 10:28:01,398 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:28:01,440 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:28:01,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:28:01,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-07 10:28:01,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:28:01,453 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:28:01,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:28:01,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2019-09-07 10:28:01,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-07 10:28:01,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-07 10:28:01,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-07 10:28:01,458 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 23 states. [2019-09-07 10:28:01,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:28:01,495 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2019-09-07 10:28:01,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 10:28:01,496 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 33 [2019-09-07 10:28:01,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:28:01,496 INFO L225 Difference]: With dead ends: 50 [2019-09-07 10:28:01,496 INFO L226 Difference]: Without dead ends: 39 [2019-09-07 10:28:01,497 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-07 10:28:01,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-07 10:28:01,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-09-07 10:28:01,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-07 10:28:01,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-09-07 10:28:01,501 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 33 [2019-09-07 10:28:01,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:28:01,501 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-09-07 10:28:01,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-07 10:28:01,501 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-09-07 10:28:01,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-07 10:28:01,502 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:28:01,502 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:28:01,502 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:28:01,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:28:01,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1845079186, now seen corresponding path program 21 times [2019-09-07 10:28:01,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:28:01,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:28:01,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:01,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:28:01,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:01,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:01,824 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:28:01,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:28:01,824 INFO L223 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) [2019-09-07 10:28:01,840 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:28:02,515 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-07 10:28:02,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:28:02,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 10:28:02,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:28:02,528 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:28:02,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:28:02,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2019-09-07 10:28:02,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-07 10:28:02,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-07 10:28:02,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-07 10:28:02,534 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 24 states. [2019-09-07 10:28:02,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:28:02,581 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2019-09-07 10:28:02,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-07 10:28:02,582 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 34 [2019-09-07 10:28:02,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:28:02,582 INFO L225 Difference]: With dead ends: 51 [2019-09-07 10:28:02,582 INFO L226 Difference]: Without dead ends: 40 [2019-09-07 10:28:02,583 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-07 10:28:02,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-07 10:28:02,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-09-07 10:28:02,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-07 10:28:02,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-09-07 10:28:02,587 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 34 [2019-09-07 10:28:02,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:28:02,587 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-09-07 10:28:02,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-07 10:28:02,587 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-09-07 10:28:02,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-07 10:28:02,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:28:02,588 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:28:02,588 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:28:02,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:28:02,589 INFO L82 PathProgramCache]: Analyzing trace with hash 841008690, now seen corresponding path program 22 times [2019-09-07 10:28:02,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:28:02,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:28:02,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:02,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:28:02,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:02,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:02,914 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:28:02,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:28:02,915 INFO L223 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) [2019-09-07 10:28:02,932 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:28:02,955 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:28:02,955 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:28:02,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-07 10:28:02,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:28:02,967 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:28:02,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:28:02,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2019-09-07 10:28:02,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-07 10:28:02,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-07 10:28:02,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-07 10:28:02,972 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 25 states. [2019-09-07 10:28:03,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:28:03,021 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2019-09-07 10:28:03,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 10:28:03,022 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 35 [2019-09-07 10:28:03,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:28:03,022 INFO L225 Difference]: With dead ends: 52 [2019-09-07 10:28:03,022 INFO L226 Difference]: Without dead ends: 41 [2019-09-07 10:28:03,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-07 10:28:03,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-07 10:28:03,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-09-07 10:28:03,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-07 10:28:03,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-09-07 10:28:03,028 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 35 [2019-09-07 10:28:03,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:28:03,028 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-09-07 10:28:03,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-07 10:28:03,028 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-09-07 10:28:03,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-07 10:28:03,029 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:28:03,029 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:28:03,029 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:28:03,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:28:03,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1789613074, now seen corresponding path program 23 times [2019-09-07 10:28:03,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:28:03,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:28:03,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:03,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:28:03,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:03,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:03,332 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:28:03,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:28:03,333 INFO L223 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-09-07 10:28:03,343 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:28:03,832 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-09-07 10:28:03,832 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:28:03,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-07 10:28:03,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:28:03,845 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:28:03,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:28:03,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2019-09-07 10:28:03,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-07 10:28:03,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-07 10:28:03,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-07 10:28:03,853 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 26 states. [2019-09-07 10:28:03,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:28:03,885 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2019-09-07 10:28:03,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-07 10:28:03,886 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 36 [2019-09-07 10:28:03,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:28:03,887 INFO L225 Difference]: With dead ends: 53 [2019-09-07 10:28:03,887 INFO L226 Difference]: Without dead ends: 42 [2019-09-07 10:28:03,887 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-07 10:28:03,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-07 10:28:03,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-09-07 10:28:03,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-07 10:28:03,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-09-07 10:28:03,890 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 36 [2019-09-07 10:28:03,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:28:03,891 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-09-07 10:28:03,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-07 10:28:03,891 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2019-09-07 10:28:03,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-07 10:28:03,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:28:03,891 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:28:03,892 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:28:03,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:28:03,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1734509134, now seen corresponding path program 24 times [2019-09-07 10:28:03,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:28:03,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:28:03,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:03,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:28:03,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:04,204 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:28:04,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:28:04,205 INFO L223 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-09-07 10:28:04,217 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:28:05,339 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-07 10:28:05,339 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:28:05,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-07 10:28:05,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:28:05,354 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:28:05,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:28:05,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2019-09-07 10:28:05,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-07 10:28:05,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-07 10:28:05,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-07 10:28:05,361 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 27 states. [2019-09-07 10:28:05,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:28:05,418 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2019-09-07 10:28:05,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 10:28:05,419 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 37 [2019-09-07 10:28:05,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:28:05,420 INFO L225 Difference]: With dead ends: 54 [2019-09-07 10:28:05,420 INFO L226 Difference]: Without dead ends: 43 [2019-09-07 10:28:05,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-07 10:28:05,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-07 10:28:05,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-09-07 10:28:05,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-07 10:28:05,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-09-07 10:28:05,430 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 37 [2019-09-07 10:28:05,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:28:05,430 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-09-07 10:28:05,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-07 10:28:05,431 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-09-07 10:28:05,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-07 10:28:05,431 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:28:05,431 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:28:05,432 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:28:05,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:28:05,432 INFO L82 PathProgramCache]: Analyzing trace with hash -26286994, now seen corresponding path program 25 times [2019-09-07 10:28:05,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:28:05,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:28:05,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:05,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:28:05,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:05,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:05,758 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:28:05,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:28:05,759 INFO L223 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-09-07 10:28:05,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:28:05,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:05,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-07 10:28:05,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:28:05,810 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:28:05,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:28:05,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2019-09-07 10:28:05,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-07 10:28:05,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-07 10:28:05,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-07 10:28:05,815 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 28 states. [2019-09-07 10:28:05,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:28:05,868 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2019-09-07 10:28:05,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-07 10:28:05,869 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 38 [2019-09-07 10:28:05,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:28:05,869 INFO L225 Difference]: With dead ends: 55 [2019-09-07 10:28:05,869 INFO L226 Difference]: Without dead ends: 44 [2019-09-07 10:28:05,870 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-07 10:28:05,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-07 10:28:05,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-09-07 10:28:05,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-07 10:28:05,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-09-07 10:28:05,873 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 38 [2019-09-07 10:28:05,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:28:05,873 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-09-07 10:28:05,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-07 10:28:05,873 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-09-07 10:28:05,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-07 10:28:05,874 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:28:05,874 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:28:05,874 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:28:05,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:28:05,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1388991794, now seen corresponding path program 26 times [2019-09-07 10:28:05,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:28:05,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:28:05,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:05,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:28:05,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:05,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:06,190 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:28:06,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:28:06,191 INFO L223 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-09-07 10:28:06,201 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:28:06,231 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:28:06,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:28:06,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-07 10:28:06,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:28:06,242 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:28:06,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:28:06,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2019-09-07 10:28:06,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-07 10:28:06,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-07 10:28:06,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 10:28:06,246 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 29 states. [2019-09-07 10:28:06,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:28:06,301 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2019-09-07 10:28:06,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-07 10:28:06,301 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 39 [2019-09-07 10:28:06,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:28:06,302 INFO L225 Difference]: With dead ends: 56 [2019-09-07 10:28:06,302 INFO L226 Difference]: Without dead ends: 45 [2019-09-07 10:28:06,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 10:28:06,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-07 10:28:06,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-09-07 10:28:06,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-07 10:28:06,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-09-07 10:28:06,308 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 39 [2019-09-07 10:28:06,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:28:06,308 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-09-07 10:28:06,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-07 10:28:06,308 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-09-07 10:28:06,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-07 10:28:06,309 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:28:06,309 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:28:06,312 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:28:06,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:28:06,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1982006034, now seen corresponding path program 27 times [2019-09-07 10:28:06,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:28:06,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:28:06,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:06,319 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:28:06,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:06,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:06,698 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:28:06,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:28:06,699 INFO L223 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-09-07 10:28:06,711 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:28:08,510 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-07 10:28:08,510 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:28:08,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-07 10:28:08,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:28:08,525 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:28:08,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:28:08,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2019-09-07 10:28:08,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-07 10:28:08,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-07 10:28:08,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-07 10:28:08,532 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 30 states. [2019-09-07 10:28:08,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:28:08,572 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2019-09-07 10:28:08,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-07 10:28:08,572 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 40 [2019-09-07 10:28:08,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:28:08,573 INFO L225 Difference]: With dead ends: 57 [2019-09-07 10:28:08,573 INFO L226 Difference]: Without dead ends: 46 [2019-09-07 10:28:08,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-07 10:28:08,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-07 10:28:08,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-09-07 10:28:08,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-07 10:28:08,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2019-09-07 10:28:08,576 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 40 [2019-09-07 10:28:08,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:28:08,577 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2019-09-07 10:28:08,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-07 10:28:08,577 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2019-09-07 10:28:08,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-07 10:28:08,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:28:08,578 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:28:08,578 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:28:08,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:28:08,580 INFO L82 PathProgramCache]: Analyzing trace with hash 891243698, now seen corresponding path program 28 times [2019-09-07 10:28:08,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:28:08,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:28:08,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:08,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:28:08,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:08,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:09,053 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:28:09,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:28:09,054 INFO L223 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-09-07 10:28:09,067 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:28:09,099 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:28:09,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:28:09,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-07 10:28:09,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:28:09,111 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:28:09,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:28:09,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2019-09-07 10:28:09,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-07 10:28:09,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-07 10:28:09,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-07 10:28:09,116 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 31 states. [2019-09-07 10:28:09,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:28:09,164 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2019-09-07 10:28:09,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-07 10:28:09,165 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 41 [2019-09-07 10:28:09,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:28:09,165 INFO L225 Difference]: With dead ends: 58 [2019-09-07 10:28:09,165 INFO L226 Difference]: Without dead ends: 47 [2019-09-07 10:28:09,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-07 10:28:09,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-07 10:28:09,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-09-07 10:28:09,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-07 10:28:09,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-09-07 10:28:09,169 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 41 [2019-09-07 10:28:09,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:28:09,170 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-09-07 10:28:09,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-07 10:28:09,170 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-09-07 10:28:09,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-07 10:28:09,170 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:28:09,170 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:28:09,171 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:28:09,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:28:09,171 INFO L82 PathProgramCache]: Analyzing trace with hash -232327826, now seen corresponding path program 29 times [2019-09-07 10:28:09,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:28:09,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:28:09,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:09,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:28:09,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:09,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:09,647 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:28:09,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:28:09,647 INFO L223 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) [2019-09-07 10:28:09,668 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:28:10,809 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2019-09-07 10:28:10,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:28:10,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-07 10:28:10,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:28:10,824 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (30)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:28:10,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:28:10,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2019-09-07 10:28:10,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-07 10:28:10,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-07 10:28:10,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-07 10:28:10,832 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 32 states. [2019-09-07 10:28:10,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:28:10,885 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2019-09-07 10:28:10,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-07 10:28:10,886 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 42 [2019-09-07 10:28:10,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:28:10,887 INFO L225 Difference]: With dead ends: 59 [2019-09-07 10:28:10,887 INFO L226 Difference]: Without dead ends: 48 [2019-09-07 10:28:10,887 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-07 10:28:10,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-07 10:28:10,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-09-07 10:28:10,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-07 10:28:10,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2019-09-07 10:28:10,891 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 42 [2019-09-07 10:28:10,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:28:10,891 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2019-09-07 10:28:10,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-07 10:28:10,891 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2019-09-07 10:28:10,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-07 10:28:10,892 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:28:10,892 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:28:10,892 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:28:10,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:28:10,893 INFO L82 PathProgramCache]: Analyzing trace with hash -703306702, now seen corresponding path program 30 times [2019-09-07 10:28:10,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:28:10,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:28:10,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:10,894 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:28:10,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:10,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:11,496 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:28:11,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:28:11,496 INFO L223 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-09-07 10:28:11,507 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:28:14,200 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2019-09-07 10:28:14,200 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:28:14,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-07 10:28:14,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:28:14,217 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:28:14,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:28:14,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2019-09-07 10:28:14,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-07 10:28:14,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-07 10:28:14,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 10:28:14,226 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 33 states. [2019-09-07 10:28:14,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:28:14,269 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2019-09-07 10:28:14,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-07 10:28:14,269 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 43 [2019-09-07 10:28:14,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:28:14,270 INFO L225 Difference]: With dead ends: 60 [2019-09-07 10:28:14,270 INFO L226 Difference]: Without dead ends: 49 [2019-09-07 10:28:14,271 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 10:28:14,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-07 10:28:14,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-09-07 10:28:14,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-07 10:28:14,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-09-07 10:28:14,275 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 43 [2019-09-07 10:28:14,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:28:14,276 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-09-07 10:28:14,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-07 10:28:14,276 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-09-07 10:28:14,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-07 10:28:14,276 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:28:14,276 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:28:14,277 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:28:14,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:28:14,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1876217326, now seen corresponding path program 31 times [2019-09-07 10:28:14,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:28:14,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:28:14,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:14,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:28:14,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:14,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:14,736 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:28:14,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:28:14,736 INFO L223 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-09-07 10:28:14,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:28:14,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:14,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-07 10:28:14,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:28:14,805 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (32)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:28:14,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:28:14,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2019-09-07 10:28:14,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-07 10:28:14,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-07 10:28:14,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 10:28:14,811 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 34 states. [2019-09-07 10:28:14,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:28:14,859 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2019-09-07 10:28:14,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-07 10:28:14,859 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 44 [2019-09-07 10:28:14,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:28:14,860 INFO L225 Difference]: With dead ends: 61 [2019-09-07 10:28:14,860 INFO L226 Difference]: Without dead ends: 50 [2019-09-07 10:28:14,861 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 10:28:14,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-07 10:28:14,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-09-07 10:28:14,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-07 10:28:14,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-09-07 10:28:14,865 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 44 [2019-09-07 10:28:14,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:28:14,866 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-09-07 10:28:14,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-07 10:28:14,866 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-09-07 10:28:14,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-07 10:28:14,869 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:28:14,869 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:28:14,869 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:28:14,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:28:14,869 INFO L82 PathProgramCache]: Analyzing trace with hash 237083570, now seen corresponding path program 32 times [2019-09-07 10:28:14,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:28:14,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:28:14,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:14,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:28:14,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:14,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:15,329 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:28:15,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:28:15,329 INFO L223 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-09-07 10:28:15,340 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:28:15,387 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:28:15,388 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:28:15,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-07 10:28:15,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:28:15,405 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:28:15,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:28:15,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2019-09-07 10:28:15,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-07 10:28:15,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-07 10:28:15,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 10:28:15,411 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 35 states. [2019-09-07 10:28:15,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:28:15,459 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2019-09-07 10:28:15,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-07 10:28:15,459 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 45 [2019-09-07 10:28:15,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:28:15,460 INFO L225 Difference]: With dead ends: 62 [2019-09-07 10:28:15,460 INFO L226 Difference]: Without dead ends: 51 [2019-09-07 10:28:15,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 10:28:15,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-07 10:28:15,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-09-07 10:28:15,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-07 10:28:15,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-09-07 10:28:15,465 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 45 [2019-09-07 10:28:15,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:28:15,465 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-09-07 10:28:15,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-07 10:28:15,466 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-09-07 10:28:15,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-07 10:28:15,469 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:28:15,470 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:28:15,470 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:28:15,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:28:15,470 INFO L82 PathProgramCache]: Analyzing trace with hash 963544686, now seen corresponding path program 33 times [2019-09-07 10:28:15,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:28:15,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:28:15,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:15,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:28:15,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:16,003 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:28:16,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:28:16,004 INFO L223 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-09-07 10:28:16,014 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:28:21,977 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-07 10:28:21,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:28:21,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-07 10:28:21,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:28:21,995 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:28:22,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:28:22,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2019-09-07 10:28:22,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-07 10:28:22,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-07 10:28:22,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 10:28:22,005 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 36 states. [2019-09-07 10:28:22,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:28:22,074 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2019-09-07 10:28:22,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-07 10:28:22,075 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 46 [2019-09-07 10:28:22,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:28:22,076 INFO L225 Difference]: With dead ends: 63 [2019-09-07 10:28:22,076 INFO L226 Difference]: Without dead ends: 52 [2019-09-07 10:28:22,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 10:28:22,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-07 10:28:22,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-09-07 10:28:22,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-07 10:28:22,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2019-09-07 10:28:22,080 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 46 [2019-09-07 10:28:22,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:28:22,080 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2019-09-07 10:28:22,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-07 10:28:22,080 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2019-09-07 10:28:22,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-07 10:28:22,081 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:28:22,081 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:28:22,081 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:28:22,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:28:22,082 INFO L82 PathProgramCache]: Analyzing trace with hash 2009002802, now seen corresponding path program 34 times [2019-09-07 10:28:22,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:28:22,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:28:22,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:22,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:28:22,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:22,668 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:28:22,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:28:22,668 INFO L223 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-09-07 10:28:22,679 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:28:22,713 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:28:22,713 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:28:22,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-07 10:28:22,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:28:22,725 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:28:22,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:28:22,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2019-09-07 10:28:22,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-07 10:28:22,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-07 10:28:22,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 10:28:22,730 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 37 states. [2019-09-07 10:28:22,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:28:22,781 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2019-09-07 10:28:22,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-07 10:28:22,781 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 47 [2019-09-07 10:28:22,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:28:22,782 INFO L225 Difference]: With dead ends: 64 [2019-09-07 10:28:22,782 INFO L226 Difference]: Without dead ends: 53 [2019-09-07 10:28:22,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 10:28:22,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-07 10:28:22,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-09-07 10:28:22,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-07 10:28:22,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-09-07 10:28:22,786 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 47 [2019-09-07 10:28:22,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:28:22,786 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-09-07 10:28:22,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-07 10:28:22,786 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-09-07 10:28:22,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-07 10:28:22,787 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:28:22,787 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:28:22,787 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:28:22,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:28:22,788 INFO L82 PathProgramCache]: Analyzing trace with hash 58466030, now seen corresponding path program 35 times [2019-09-07 10:28:22,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:28:22,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:28:22,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:22,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:28:22,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:22,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:23,365 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:28:23,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:28:23,365 INFO L223 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-09-07 10:28:23,376 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:28:25,654 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2019-09-07 10:28:25,655 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:28:25,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-07 10:28:25,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:28:25,669 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:28:25,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:28:25,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2019-09-07 10:28:25,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-07 10:28:25,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-07 10:28:25,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 10:28:25,678 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 38 states. [2019-09-07 10:28:25,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:28:25,754 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2019-09-07 10:28:25,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-07 10:28:25,755 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 48 [2019-09-07 10:28:25,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:28:25,756 INFO L225 Difference]: With dead ends: 65 [2019-09-07 10:28:25,756 INFO L226 Difference]: Without dead ends: 54 [2019-09-07 10:28:25,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 10:28:25,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-07 10:28:25,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-09-07 10:28:25,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-07 10:28:25,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2019-09-07 10:28:25,759 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 48 [2019-09-07 10:28:25,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:28:25,760 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2019-09-07 10:28:25,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-07 10:28:25,762 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2019-09-07 10:28:25,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-07 10:28:25,763 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:28:25,763 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:28:25,764 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:28:25,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:28:25,764 INFO L82 PathProgramCache]: Analyzing trace with hash -278631758, now seen corresponding path program 36 times [2019-09-07 10:28:25,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:28:25,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:28:25,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:25,767 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:28:25,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:25,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:26,346 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:28:26,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:28:26,347 INFO L223 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-09-07 10:28:26,359 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:28:31,851 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-07 10:28:31,851 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:28:31,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-07 10:28:31,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:28:31,867 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:28:31,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:28:31,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2019-09-07 10:28:31,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-07 10:28:31,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-07 10:28:31,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 10:28:31,877 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 39 states. [2019-09-07 10:28:31,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:28:31,956 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2019-09-07 10:28:31,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-07 10:28:31,956 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 49 [2019-09-07 10:28:31,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:28:31,957 INFO L225 Difference]: With dead ends: 66 [2019-09-07 10:28:31,957 INFO L226 Difference]: Without dead ends: 55 [2019-09-07 10:28:31,958 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 10:28:31,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-07 10:28:31,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-09-07 10:28:31,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-07 10:28:31,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-09-07 10:28:31,962 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 49 [2019-09-07 10:28:31,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:28:31,962 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-09-07 10:28:31,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-07 10:28:31,963 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-09-07 10:28:31,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-07 10:28:31,963 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:28:31,964 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:28:31,964 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:28:31,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:28:31,964 INFO L82 PathProgramCache]: Analyzing trace with hash -2138728594, now seen corresponding path program 37 times [2019-09-07 10:28:31,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:28:31,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:28:31,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:31,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:28:31,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:31,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:32,727 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:28:32,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:28:32,728 INFO L223 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-09-07 10:28:32,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:28:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:32,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-07 10:28:32,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:28:32,786 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:28:32,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:28:32,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2019-09-07 10:28:32,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-07 10:28:32,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-07 10:28:32,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-07 10:28:32,791 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 40 states. [2019-09-07 10:28:32,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:28:32,858 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2019-09-07 10:28:32,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-07 10:28:32,858 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 50 [2019-09-07 10:28:32,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:28:32,859 INFO L225 Difference]: With dead ends: 67 [2019-09-07 10:28:32,859 INFO L226 Difference]: Without dead ends: 56 [2019-09-07 10:28:32,860 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-07 10:28:32,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-07 10:28:32,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-09-07 10:28:32,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-07 10:28:32,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-09-07 10:28:32,863 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 50 [2019-09-07 10:28:32,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:28:32,864 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-09-07 10:28:32,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-07 10:28:32,864 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-09-07 10:28:32,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-07 10:28:32,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:28:32,865 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:28:32,865 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:28:32,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:28:32,865 INFO L82 PathProgramCache]: Analyzing trace with hash 327811634, now seen corresponding path program 38 times [2019-09-07 10:28:32,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:28:32,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:28:32,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:32,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:28:32,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:32,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:33,495 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:28:33,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:28:33,496 INFO L223 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-09-07 10:28:33,506 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:28:33,549 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:28:33,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:28:33,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-07 10:28:33,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:28:33,561 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:28:33,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:28:33,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2019-09-07 10:28:33,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-07 10:28:33,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-07 10:28:33,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-07 10:28:33,566 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 41 states. [2019-09-07 10:28:33,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:28:33,628 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2019-09-07 10:28:33,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-07 10:28:33,629 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 51 [2019-09-07 10:28:33,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:28:33,629 INFO L225 Difference]: With dead ends: 68 [2019-09-07 10:28:33,630 INFO L226 Difference]: Without dead ends: 57 [2019-09-07 10:28:33,631 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-07 10:28:33,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-07 10:28:33,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-09-07 10:28:33,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-07 10:28:33,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-09-07 10:28:33,635 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 51 [2019-09-07 10:28:33,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:28:33,635 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-09-07 10:28:33,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-07 10:28:33,635 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-09-07 10:28:33,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-07 10:28:33,636 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:28:33,636 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:28:33,636 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:28:33,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:28:33,637 INFO L82 PathProgramCache]: Analyzing trace with hash -518852626, now seen corresponding path program 39 times [2019-09-07 10:28:33,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:28:33,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:28:33,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:33,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:28:33,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:33,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:34,351 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:28:34,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:28:34,351 INFO L223 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-09-07 10:28:34,362 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:28:47,463 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-09-07 10:28:47,463 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:28:47,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-07 10:28:47,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:28:47,484 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:28:47,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:28:47,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2019-09-07 10:28:47,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-07 10:28:47,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-07 10:28:47,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-07 10:28:47,494 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 42 states. [2019-09-07 10:28:47,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:28:47,556 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2019-09-07 10:28:47,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-07 10:28:47,556 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 52 [2019-09-07 10:28:47,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:28:47,557 INFO L225 Difference]: With dead ends: 69 [2019-09-07 10:28:47,557 INFO L226 Difference]: Without dead ends: 58 [2019-09-07 10:28:47,558 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-07 10:28:47,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-07 10:28:47,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-09-07 10:28:47,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-07 10:28:47,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2019-09-07 10:28:47,561 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 52 [2019-09-07 10:28:47,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:28:47,561 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2019-09-07 10:28:47,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-07 10:28:47,561 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2019-09-07 10:28:47,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-07 10:28:47,562 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:28:47,562 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:28:47,562 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:28:47,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:28:47,562 INFO L82 PathProgramCache]: Analyzing trace with hash -995640910, now seen corresponding path program 40 times [2019-09-07 10:28:47,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:28:47,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:28:47,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:47,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:28:47,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:47,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:48,221 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:28:48,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:28:48,221 INFO L223 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-09-07 10:28:48,231 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:28:48,272 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:28:48,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:28:48,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-07 10:28:48,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:28:48,285 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:28:48,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:28:48,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2019-09-07 10:28:48,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-07 10:28:48,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-07 10:28:48,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 10:28:48,291 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 43 states. [2019-09-07 10:28:48,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:28:48,362 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2019-09-07 10:28:48,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-07 10:28:48,364 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 53 [2019-09-07 10:28:48,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:28:48,365 INFO L225 Difference]: With dead ends: 70 [2019-09-07 10:28:48,365 INFO L226 Difference]: Without dead ends: 59 [2019-09-07 10:28:48,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 10:28:48,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-07 10:28:48,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-09-07 10:28:48,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-07 10:28:48,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-09-07 10:28:48,370 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 53 [2019-09-07 10:28:48,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:28:48,370 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-09-07 10:28:48,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-07 10:28:48,370 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-09-07 10:28:48,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-07 10:28:48,371 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:28:48,371 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:28:48,371 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:28:48,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:28:48,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1403791470, now seen corresponding path program 41 times [2019-09-07 10:28:48,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:28:48,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:28:48,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:48,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:28:48,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:48,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:49,316 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:28:49,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:28:49,316 INFO L223 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-09-07 10:28:49,326 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:28:55,074 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2019-09-07 10:28:55,074 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:28:55,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-07 10:28:55,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:28:55,090 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:28:55,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:28:55,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2019-09-07 10:28:55,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-07 10:28:55,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-07 10:28:55,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-07 10:28:55,100 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 44 states. [2019-09-07 10:28:55,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:28:55,159 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2019-09-07 10:28:55,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-07 10:28:55,163 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 54 [2019-09-07 10:28:55,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:28:55,163 INFO L225 Difference]: With dead ends: 71 [2019-09-07 10:28:55,164 INFO L226 Difference]: Without dead ends: 60 [2019-09-07 10:28:55,164 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-07 10:28:55,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-07 10:28:55,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-09-07 10:28:55,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-07 10:28:55,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2019-09-07 10:28:55,167 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 54 [2019-09-07 10:28:55,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:28:55,168 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2019-09-07 10:28:55,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-07 10:28:55,168 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2019-09-07 10:28:55,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-07 10:28:55,168 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:28:55,168 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:28:55,168 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:28:55,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:28:55,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1523216078, now seen corresponding path program 42 times [2019-09-07 10:28:55,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:28:55,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:28:55,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:55,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:28:55,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:55,943 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:28:55,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:28:55,944 INFO L223 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-09-07 10:28:55,954 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:29:06,647 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2019-09-07 10:29:06,648 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:29:06,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-07 10:29:06,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:29:06,668 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:29:06,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:29:06,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2019-09-07 10:29:06,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-07 10:29:06,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-07 10:29:06,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-09-07 10:29:06,679 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 45 states. [2019-09-07 10:29:06,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:29:06,743 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2019-09-07 10:29:06,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-07 10:29:06,744 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 55 [2019-09-07 10:29:06,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:29:06,744 INFO L225 Difference]: With dead ends: 72 [2019-09-07 10:29:06,744 INFO L226 Difference]: Without dead ends: 61 [2019-09-07 10:29:06,747 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-09-07 10:29:06,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-07 10:29:06,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-09-07 10:29:06,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-07 10:29:06,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-09-07 10:29:06,751 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 55 [2019-09-07 10:29:06,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:29:06,751 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-09-07 10:29:06,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-07 10:29:06,752 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-09-07 10:29:06,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-07 10:29:06,752 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:29:06,753 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:29:06,753 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:29:06,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:29:06,753 INFO L82 PathProgramCache]: Analyzing trace with hash -2066136850, now seen corresponding path program 43 times [2019-09-07 10:29:06,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:29:06,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:29:06,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:29:06,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:29:06,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:29:06,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:29:07,514 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:29:07,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:29:07,514 INFO L223 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-09-07 10:29:07,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:29:07,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:29:07,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-07 10:29:07,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:29:07,586 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:29:07,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:29:07,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2019-09-07 10:29:07,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-07 10:29:07,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-07 10:29:07,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-07 10:29:07,592 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 46 states. [2019-09-07 10:29:07,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:29:07,673 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2019-09-07 10:29:07,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-07 10:29:07,673 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 56 [2019-09-07 10:29:07,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:29:07,674 INFO L225 Difference]: With dead ends: 73 [2019-09-07 10:29:07,674 INFO L226 Difference]: Without dead ends: 62 [2019-09-07 10:29:07,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-07 10:29:07,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-09-07 10:29:07,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-09-07 10:29:07,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-07 10:29:07,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2019-09-07 10:29:07,677 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 56 [2019-09-07 10:29:07,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:29:07,678 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2019-09-07 10:29:07,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-07 10:29:07,678 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2019-09-07 10:29:07,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-07 10:29:07,678 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:29:07,679 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:29:07,679 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:29:07,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:29:07,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1716811598, now seen corresponding path program 44 times [2019-09-07 10:29:07,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:29:07,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:29:07,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:29:07,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:29:07,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:29:07,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:29:08,442 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:29:08,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:29:08,443 INFO L223 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-09-07 10:29:08,453 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:29:08,496 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:29:08,497 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:29:08,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-07 10:29:08,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:29:08,511 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:29:08,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:29:08,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2019-09-07 10:29:08,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-07 10:29:08,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-07 10:29:08,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 10:29:08,516 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 47 states. [2019-09-07 10:29:08,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:29:08,599 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2019-09-07 10:29:08,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-07 10:29:08,599 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 57 [2019-09-07 10:29:08,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:29:08,600 INFO L225 Difference]: With dead ends: 74 [2019-09-07 10:29:08,600 INFO L226 Difference]: Without dead ends: 63 [2019-09-07 10:29:08,600 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 10:29:08,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-07 10:29:08,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-09-07 10:29:08,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-07 10:29:08,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-09-07 10:29:08,602 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 57 [2019-09-07 10:29:08,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:29:08,603 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-09-07 10:29:08,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-07 10:29:08,603 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-09-07 10:29:08,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-07 10:29:08,603 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:29:08,603 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:29:08,604 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:29:08,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:29:08,604 INFO L82 PathProgramCache]: Analyzing trace with hash 522336622, now seen corresponding path program 45 times [2019-09-07 10:29:08,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:29:08,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:29:08,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:29:08,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:29:08,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:29:08,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:29:09,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:29:09,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:29:09,479 INFO L223 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-09-07 10:29:09,494 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:29:28,471 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-09-07 10:29:28,471 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:29:28,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-07 10:29:28,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:29:28,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:29:28,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:29:28,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2019-09-07 10:29:28,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-07 10:29:28,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-07 10:29:28,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-07 10:29:28,504 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 48 states. [2019-09-07 10:29:28,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:29:28,581 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2019-09-07 10:29:28,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-07 10:29:28,586 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 58 [2019-09-07 10:29:28,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:29:28,587 INFO L225 Difference]: With dead ends: 75 [2019-09-07 10:29:28,587 INFO L226 Difference]: Without dead ends: 64 [2019-09-07 10:29:28,588 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-07 10:29:28,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-07 10:29:28,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-09-07 10:29:28,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-07 10:29:28,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2019-09-07 10:29:28,591 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 58 [2019-09-07 10:29:28,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:29:28,591 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2019-09-07 10:29:28,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-07 10:29:28,592 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2019-09-07 10:29:28,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-07 10:29:28,592 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:29:28,592 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:29:28,593 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:29:28,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:29:28,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1216454706, now seen corresponding path program 46 times [2019-09-07 10:29:28,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:29:28,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:29:28,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:29:28,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:29:28,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:29:28,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:29:29,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:29:29,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:29:29,412 INFO L223 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-09-07 10:29:29,423 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:29:29,469 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:29:29,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:29:29,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-07 10:29:29,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:29:29,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:29:29,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:29:29,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2019-09-07 10:29:29,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-07 10:29:29,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-07 10:29:29,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 10:29:29,489 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 49 states. [2019-09-07 10:29:29,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:29:29,579 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2019-09-07 10:29:29,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-07 10:29:29,581 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 59 [2019-09-07 10:29:29,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:29:29,581 INFO L225 Difference]: With dead ends: 76 [2019-09-07 10:29:29,582 INFO L226 Difference]: Without dead ends: 65 [2019-09-07 10:29:29,582 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 10:29:29,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-07 10:29:29,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-09-07 10:29:29,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-07 10:29:29,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-09-07 10:29:29,585 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 59 [2019-09-07 10:29:29,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:29:29,585 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-09-07 10:29:29,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-07 10:29:29,585 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-09-07 10:29:29,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-07 10:29:29,586 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:29:29,586 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:29:29,586 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:29:29,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:29:29,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1259278830, now seen corresponding path program 47 times [2019-09-07 10:29:29,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:29:29,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:29:29,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:29:29,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:29:29,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:29:29,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:29:30,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:29:30,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:29:30,524 INFO L223 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-09-07 10:29:30,535 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:29:44,549 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2019-09-07 10:29:44,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:29:44,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-07 10:29:44,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:29:44,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:29:44,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:29:44,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2019-09-07 10:29:44,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-07 10:29:44,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-07 10:29:44,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-07 10:29:44,584 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 50 states. [2019-09-07 10:29:44,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:29:44,649 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2019-09-07 10:29:44,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-07 10:29:44,650 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 60 [2019-09-07 10:29:44,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:29:44,651 INFO L225 Difference]: With dead ends: 77 [2019-09-07 10:29:44,651 INFO L226 Difference]: Without dead ends: 66 [2019-09-07 10:29:44,652 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-07 10:29:44,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-07 10:29:44,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-09-07 10:29:44,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-07 10:29:44,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2019-09-07 10:29:44,655 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 60 [2019-09-07 10:29:44,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:29:44,656 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2019-09-07 10:29:44,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-07 10:29:44,656 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2019-09-07 10:29:44,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-07 10:29:44,656 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:29:44,657 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:29:44,657 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:29:44,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:29:44,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1708140622, now seen corresponding path program 48 times [2019-09-07 10:29:44,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:29:44,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:29:44,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:29:44,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:29:44,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:29:44,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:29:45,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:29:45,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:29:45,564 INFO L223 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-09-07 10:29:45,574 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:30:09,509 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-09-07 10:30:09,510 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:30:09,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-07 10:30:09,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:30:09,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:30:09,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:30:09,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2019-09-07 10:30:09,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-07 10:30:09,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-07 10:30:09,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-07 10:30:09,549 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 51 states. [2019-09-07 10:30:09,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:30:09,632 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2019-09-07 10:30:09,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-07 10:30:09,632 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 61 [2019-09-07 10:30:09,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:30:09,633 INFO L225 Difference]: With dead ends: 78 [2019-09-07 10:30:09,633 INFO L226 Difference]: Without dead ends: 67 [2019-09-07 10:30:09,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-07 10:30:09,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-07 10:30:09,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-09-07 10:30:09,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-07 10:30:09,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-09-07 10:30:09,636 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 61 [2019-09-07 10:30:09,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:30:09,636 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-09-07 10:30:09,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-07 10:30:09,637 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-09-07 10:30:09,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-07 10:30:09,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:30:09,637 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:30:09,638 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:30:09,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:30:09,639 INFO L82 PathProgramCache]: Analyzing trace with hash 791136878, now seen corresponding path program 49 times [2019-09-07 10:30:09,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:30:09,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:30:09,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:09,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:30:09,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:09,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:30:10,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:30:10,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:30:10,883 INFO L223 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-09-07 10:30:10,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:30:10,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:30:10,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-07 10:30:10,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:30:10,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:30:10,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:30:10,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2019-09-07 10:30:10,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-07 10:30:10,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-07 10:30:10,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-07 10:30:10,967 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 52 states. [2019-09-07 10:30:11,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:30:11,047 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2019-09-07 10:30:11,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-07 10:30:11,049 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 62 [2019-09-07 10:30:11,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:30:11,051 INFO L225 Difference]: With dead ends: 79 [2019-09-07 10:30:11,051 INFO L226 Difference]: Without dead ends: 68 [2019-09-07 10:30:11,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-07 10:30:11,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-07 10:30:11,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-09-07 10:30:11,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-07 10:30:11,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2019-09-07 10:30:11,059 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 62 [2019-09-07 10:30:11,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:30:11,059 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2019-09-07 10:30:11,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-07 10:30:11,060 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2019-09-07 10:30:11,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-07 10:30:11,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:30:11,060 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:30:11,061 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:30:11,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:30:11,061 INFO L82 PathProgramCache]: Analyzing trace with hash 959328050, now seen corresponding path program 50 times [2019-09-07 10:30:11,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:30:11,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:30:11,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:11,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:30:11,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:11,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:30:12,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:30:12,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:30:12,058 INFO L223 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-09-07 10:30:12,069 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:30:12,139 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:30:12,140 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:30:12,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-07 10:30:12,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:30:12,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:30:12,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:30:12,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 53 [2019-09-07 10:30:12,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-07 10:30:12,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-07 10:30:12,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-07 10:30:12,156 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 53 states. [2019-09-07 10:30:12,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:30:12,227 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2019-09-07 10:30:12,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-07 10:30:12,227 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 63 [2019-09-07 10:30:12,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:30:12,228 INFO L225 Difference]: With dead ends: 80 [2019-09-07 10:30:12,228 INFO L226 Difference]: Without dead ends: 69 [2019-09-07 10:30:12,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-07 10:30:12,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-07 10:30:12,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-09-07 10:30:12,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-07 10:30:12,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-09-07 10:30:12,232 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 63 [2019-09-07 10:30:12,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:30:12,232 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-09-07 10:30:12,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-07 10:30:12,232 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-09-07 10:30:12,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-07 10:30:12,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:30:12,233 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:30:12,233 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:30:12,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:30:12,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1878287086, now seen corresponding path program 51 times [2019-09-07 10:30:12,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:30:12,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:30:12,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:12,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:30:12,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:12,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:30:13,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:30:13,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:30:13,331 INFO L223 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-09-07 10:30:13,341 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:30:47,605 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-09-07 10:30:47,605 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:30:47,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-07 10:30:47,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:30:47,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:30:47,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:30:47,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2019-09-07 10:30:47,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-07 10:30:47,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-07 10:30:47,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-07 10:30:47,647 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 54 states. [2019-09-07 10:30:47,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:30:47,730 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2019-09-07 10:30:47,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-07 10:30:47,730 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 64 [2019-09-07 10:30:47,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:30:47,731 INFO L225 Difference]: With dead ends: 81 [2019-09-07 10:30:47,732 INFO L226 Difference]: Without dead ends: 70 [2019-09-07 10:30:47,732 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-07 10:30:47,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-07 10:30:47,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-09-07 10:30:47,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-07 10:30:47,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2019-09-07 10:30:47,736 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 64 [2019-09-07 10:30:47,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:30:47,737 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2019-09-07 10:30:47,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-07 10:30:47,737 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2019-09-07 10:30:47,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-07 10:30:47,738 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:30:47,738 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:30:47,739 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:30:47,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:30:47,739 INFO L82 PathProgramCache]: Analyzing trace with hash 301246130, now seen corresponding path program 52 times [2019-09-07 10:30:47,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:30:47,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:30:47,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:47,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:30:47,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:47,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:30:48,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:30:48,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:30:48,883 INFO L223 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-09-07 10:30:48,895 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:30:48,941 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:30:48,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:30:48,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-07 10:30:48,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:30:48,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:30:48,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:30:48,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 55 [2019-09-07 10:30:48,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-07 10:30:48,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-07 10:30:48,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-09-07 10:30:48,961 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 55 states. [2019-09-07 10:30:49,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:30:49,043 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2019-09-07 10:30:49,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-07 10:30:49,043 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 65 [2019-09-07 10:30:49,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:30:49,044 INFO L225 Difference]: With dead ends: 82 [2019-09-07 10:30:49,044 INFO L226 Difference]: Without dead ends: 71 [2019-09-07 10:30:49,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-09-07 10:30:49,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-07 10:30:49,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-09-07 10:30:49,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-07 10:30:49,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-09-07 10:30:49,049 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 65 [2019-09-07 10:30:49,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:30:49,049 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-09-07 10:30:49,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-07 10:30:49,049 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-09-07 10:30:49,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-07 10:30:49,050 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:30:49,050 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:30:49,050 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:30:49,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:30:49,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1342383250, now seen corresponding path program 53 times [2019-09-07 10:30:49,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:30:49,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:30:49,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:49,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:30:49,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:49,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:30:50,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:30:50,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:30:50,120 INFO L223 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-09-07 10:30:50,129 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:31:13,744 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 28 check-sat command(s) [2019-09-07 10:31:13,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:31:13,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-07 10:31:13,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:31:13,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:31:13,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:31:13,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 56 [2019-09-07 10:31:13,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-07 10:31:13,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-07 10:31:13,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-07 10:31:13,785 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 56 states. [2019-09-07 10:31:13,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:31:13,872 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2019-09-07 10:31:13,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-07 10:31:13,872 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 66 [2019-09-07 10:31:13,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:31:13,873 INFO L225 Difference]: With dead ends: 83 [2019-09-07 10:31:13,873 INFO L226 Difference]: Without dead ends: 72 [2019-09-07 10:31:13,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-07 10:31:13,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-07 10:31:13,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-09-07 10:31:13,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-07 10:31:13,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2019-09-07 10:31:13,878 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 66 [2019-09-07 10:31:13,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:31:13,878 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2019-09-07 10:31:13,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-07 10:31:13,878 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2019-09-07 10:31:13,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-07 10:31:13,879 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:31:13,879 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:31:13,879 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:31:13,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:31:13,880 INFO L82 PathProgramCache]: Analyzing trace with hash -755286478, now seen corresponding path program 54 times [2019-09-07 10:31:13,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:31:13,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:31:13,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:31:13,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:31:13,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:31:13,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:31:15,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:31:15,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:31:15,047 INFO L223 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-09-07 10:31:15,059 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:31:51,449 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2019-09-07 10:31:51,450 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:31:51,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-07 10:31:51,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:31:51,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:31:51,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:31:51,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 57 [2019-09-07 10:31:51,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-07 10:31:51,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-07 10:31:51,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-09-07 10:31:51,494 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 57 states. [2019-09-07 10:31:51,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:31:51,615 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2019-09-07 10:31:51,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-07 10:31:51,616 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 67 [2019-09-07 10:31:51,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:31:51,617 INFO L225 Difference]: With dead ends: 84 [2019-09-07 10:31:51,617 INFO L226 Difference]: Without dead ends: 73 [2019-09-07 10:31:51,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-09-07 10:31:51,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-09-07 10:31:51,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-09-07 10:31:51,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-07 10:31:51,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-09-07 10:31:51,620 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 67 [2019-09-07 10:31:51,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:31:51,621 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-09-07 10:31:51,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-07 10:31:51,621 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-09-07 10:31:51,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-07 10:31:51,622 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:31:51,622 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:31:51,622 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:31:51,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:31:51,622 INFO L82 PathProgramCache]: Analyzing trace with hash 264844270, now seen corresponding path program 55 times [2019-09-07 10:31:51,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:31:51,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:31:51,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:31:51,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:31:51,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:31:51,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:31:53,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:31:53,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:31:53,105 INFO L223 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-09-07 10:31:53,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:31:53,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:31:53,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-07 10:31:53,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:31:53,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:31:53,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:31:53,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 58 [2019-09-07 10:31:53,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-07 10:31:53,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-07 10:31:53,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-09-07 10:31:53,185 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 58 states. [2019-09-07 10:31:53,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:31:53,282 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2019-09-07 10:31:53,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-07 10:31:53,283 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 68 [2019-09-07 10:31:53,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:31:53,284 INFO L225 Difference]: With dead ends: 85 [2019-09-07 10:31:53,285 INFO L226 Difference]: Without dead ends: 74 [2019-09-07 10:31:53,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-09-07 10:31:53,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-07 10:31:53,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-09-07 10:31:53,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-09-07 10:31:53,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2019-09-07 10:31:53,290 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 68 [2019-09-07 10:31:53,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:31:53,290 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2019-09-07 10:31:53,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-07 10:31:53,290 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2019-09-07 10:31:53,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-07 10:31:53,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:31:53,291 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:31:53,291 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:31:53,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:31:53,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1824126386, now seen corresponding path program 56 times [2019-09-07 10:31:53,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:31:53,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:31:53,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:31:53,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:31:53,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:31:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:31:54,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:31:54,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:31:54,537 INFO L223 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-09-07 10:31:54,550 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:31:54,593 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:31:54,593 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:31:54,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-07 10:31:54,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:31:54,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:31:54,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:31:54,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 59 [2019-09-07 10:31:54,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-07 10:31:54,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-07 10:31:54,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-09-07 10:31:54,611 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 59 states. [2019-09-07 10:31:54,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:31:54,727 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2019-09-07 10:31:54,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-07 10:31:54,727 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 69 [2019-09-07 10:31:54,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:31:54,728 INFO L225 Difference]: With dead ends: 86 [2019-09-07 10:31:54,728 INFO L226 Difference]: Without dead ends: 75 [2019-09-07 10:31:54,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-09-07 10:31:54,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-07 10:31:54,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-09-07 10:31:54,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-07 10:31:54,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-09-07 10:31:54,731 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 69 [2019-09-07 10:31:54,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:31:54,732 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-09-07 10:31:54,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-07 10:31:54,732 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-09-07 10:31:54,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-07 10:31:54,732 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:31:54,732 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:31:54,733 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:31:54,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:31:54,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1377735570, now seen corresponding path program 57 times [2019-09-07 10:31:54,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:31:54,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:31:54,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:31:54,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:31:54,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:31:54,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:31:56,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:31:56,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:31:56,044 INFO L223 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-09-07 10:31:56,053 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:33:00,611 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-09-07 10:33:00,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:33:00,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-07 10:33:00,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:33:00,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:33:00,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:33:00,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 60 [2019-09-07 10:33:00,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-07 10:33:00,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-07 10:33:00,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-09-07 10:33:00,651 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 60 states. [2019-09-07 10:33:00,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:33:00,745 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2019-09-07 10:33:00,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-07 10:33:00,746 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 70 [2019-09-07 10:33:00,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:33:00,747 INFO L225 Difference]: With dead ends: 87 [2019-09-07 10:33:00,747 INFO L226 Difference]: Without dead ends: 76 [2019-09-07 10:33:00,747 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-09-07 10:33:00,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-07 10:33:00,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-09-07 10:33:00,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-07 10:33:00,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2019-09-07 10:33:00,750 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 70 [2019-09-07 10:33:00,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:33:00,751 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2019-09-07 10:33:00,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-07 10:33:00,751 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2019-09-07 10:33:00,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-07 10:33:00,752 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:33:00,752 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:33:00,752 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:33:00,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:33:00,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1851208398, now seen corresponding path program 58 times [2019-09-07 10:33:00,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:33:00,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:33:00,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:33:00,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:33:00,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:33:00,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:33:02,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:33:02,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:33:02,568 INFO L223 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-09-07 10:33:02,579 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:33:02,634 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:33:02,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:33:02,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-07 10:33:02,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:33:02,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:33:02,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:33:02,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 61 [2019-09-07 10:33:02,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-07 10:33:02,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-07 10:33:02,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 10:33:02,654 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 61 states. [2019-09-07 10:33:02,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:33:02,779 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2019-09-07 10:33:02,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-07 10:33:02,779 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 71 [2019-09-07 10:33:02,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:33:02,780 INFO L225 Difference]: With dead ends: 88 [2019-09-07 10:33:02,780 INFO L226 Difference]: Without dead ends: 77 [2019-09-07 10:33:02,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 10:33:02,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-09-07 10:33:02,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-09-07 10:33:02,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-07 10:33:02,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-09-07 10:33:02,784 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 71 [2019-09-07 10:33:02,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:33:02,784 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-09-07 10:33:02,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-07 10:33:02,784 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-09-07 10:33:02,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-07 10:33:02,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:33:02,785 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:33:02,785 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:33:02,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:33:02,785 INFO L82 PathProgramCache]: Analyzing trace with hash 651003118, now seen corresponding path program 59 times [2019-09-07 10:33:02,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:33:02,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:33:02,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:33:02,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:33:02,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:33:02,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:33:04,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:33:04,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:33:04,109 INFO L223 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-09-07 10:33:04,120 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:33:53,378 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2019-09-07 10:33:53,378 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:33:53,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-07 10:33:53,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:33:53,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:33:53,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:33:53,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 62 [2019-09-07 10:33:53,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-07 10:33:53,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-07 10:33:53,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-09-07 10:33:53,424 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 62 states. [2019-09-07 10:33:53,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:33:53,517 INFO L93 Difference]: Finished difference Result 89 states and 91 transitions. [2019-09-07 10:33:53,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-07 10:33:53,517 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 72 [2019-09-07 10:33:53,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:33:53,518 INFO L225 Difference]: With dead ends: 89 [2019-09-07 10:33:53,518 INFO L226 Difference]: Without dead ends: 78 [2019-09-07 10:33:53,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-09-07 10:33:53,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-07 10:33:53,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-09-07 10:33:53,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-09-07 10:33:53,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2019-09-07 10:33:53,523 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 72 [2019-09-07 10:33:53,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:33:53,523 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2019-09-07 10:33:53,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-07 10:33:53,523 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2019-09-07 10:33:53,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-07 10:33:53,524 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:33:53,524 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:33:53,524 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:33:53,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:33:53,524 INFO L82 PathProgramCache]: Analyzing trace with hash 910148786, now seen corresponding path program 60 times [2019-09-07 10:33:53,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:33:53,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:33:53,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:33:53,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:33:53,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:33:53,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:33:54,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:33:54,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:33:54,889 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:33:54,901 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:35:15,319 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-09-07 10:35:15,319 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:35:15,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-07 10:35:15,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:35:15,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:35:15,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:35:15,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 63 [2019-09-07 10:35:15,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-07 10:35:15,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-07 10:35:15,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-09-07 10:35:15,380 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 63 states. [2019-09-07 10:35:15,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:35:15,487 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2019-09-07 10:35:15,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-07 10:35:15,488 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 73 [2019-09-07 10:35:15,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:35:15,488 INFO L225 Difference]: With dead ends: 90 [2019-09-07 10:35:15,488 INFO L226 Difference]: Without dead ends: 79 [2019-09-07 10:35:15,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-09-07 10:35:15,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-09-07 10:35:15,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-09-07 10:35:15,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-07 10:35:15,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-09-07 10:35:15,492 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 73 [2019-09-07 10:35:15,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:35:15,492 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-09-07 10:35:15,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-07 10:35:15,493 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-09-07 10:35:15,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-07 10:35:15,493 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:35:15,493 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:35:15,494 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:35:15,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:35:15,494 INFO L82 PathProgramCache]: Analyzing trace with hash 353729902, now seen corresponding path program 61 times [2019-09-07 10:35:15,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:35:15,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:35:15,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:35:15,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:35:15,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:35:15,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:35:17,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:35:17,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:35:17,002 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:35:17,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:35:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:35:17,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-07 10:35:17,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:35:17,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:35:17,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:35:17,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 64 [2019-09-07 10:35:17,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-07 10:35:17,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-07 10:35:17,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-09-07 10:35:17,109 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 64 states. [2019-09-07 10:35:17,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:35:17,211 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2019-09-07 10:35:17,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-07 10:35:17,211 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 74 [2019-09-07 10:35:17,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:35:17,212 INFO L225 Difference]: With dead ends: 91 [2019-09-07 10:35:17,212 INFO L226 Difference]: Without dead ends: 80 [2019-09-07 10:35:17,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-09-07 10:35:17,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-07 10:35:17,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-09-07 10:35:17,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-07 10:35:17,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2019-09-07 10:35:17,217 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 74 [2019-09-07 10:35:17,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:35:17,217 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2019-09-07 10:35:17,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-07 10:35:17,217 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2019-09-07 10:35:17,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-07 10:35:17,219 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:35:17,219 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:35:17,219 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:35:17,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:35:17,220 INFO L82 PathProgramCache]: Analyzing trace with hash 284613682, now seen corresponding path program 62 times [2019-09-07 10:35:17,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:35:17,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:35:17,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:35:17,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:35:17,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:35:17,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:35:19,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:35:19,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:35:19,057 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:35:19,075 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:35:19,129 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:35:19,130 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:35:19,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-07 10:35:19,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:35:19,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (63)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:35:19,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:35:19,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 65 [2019-09-07 10:35:19,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-07 10:35:19,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-07 10:35:19,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-09-07 10:35:19,157 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 65 states. [2019-09-07 10:35:19,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:35:19,252 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2019-09-07 10:35:19,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-07 10:35:19,252 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 75 [2019-09-07 10:35:19,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:35:19,253 INFO L225 Difference]: With dead ends: 92 [2019-09-07 10:35:19,253 INFO L226 Difference]: Without dead ends: 81 [2019-09-07 10:35:19,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-09-07 10:35:19,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-09-07 10:35:19,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-09-07 10:35:19,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-07 10:35:19,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-09-07 10:35:19,258 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 75 [2019-09-07 10:35:19,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:35:19,259 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-09-07 10:35:19,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-07 10:35:19,259 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-09-07 10:35:19,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-07 10:35:19,260 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:35:19,260 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:35:19,260 INFO L418 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:35:19,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:35:19,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1857989138, now seen corresponding path program 63 times [2019-09-07 10:35:19,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:35:19,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:35:19,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:35:19,261 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:35:19,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:35:19,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:35:20,827 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:35:20,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:35:20,828 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:35:20,840 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:36:50,564 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-09-07 10:36:50,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:36:50,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-07 10:36:50,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:36:50,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:36:50,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:36:50,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 66 [2019-09-07 10:36:50,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-07 10:36:50,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-07 10:36:50,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-09-07 10:36:50,630 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 66 states. [2019-09-07 10:36:50,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:36:50,757 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2019-09-07 10:36:50,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-09-07 10:36:50,757 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 76 [2019-09-07 10:36:50,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:36:50,758 INFO L225 Difference]: With dead ends: 93 [2019-09-07 10:36:50,758 INFO L226 Difference]: Without dead ends: 82 [2019-09-07 10:36:50,758 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-09-07 10:36:50,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-07 10:36:50,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-09-07 10:36:50,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-07 10:36:50,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2019-09-07 10:36:50,762 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 76 [2019-09-07 10:36:50,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:36:50,762 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2019-09-07 10:36:50,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-07 10:36:50,762 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2019-09-07 10:36:50,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-07 10:36:50,763 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:36:50,763 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:36:50,763 INFO L418 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:36:50,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:36:50,764 INFO L82 PathProgramCache]: Analyzing trace with hash 440800178, now seen corresponding path program 64 times [2019-09-07 10:36:50,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:36:50,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:36:50,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:36:50,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:36:50,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:36:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:36:52,867 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:36:52,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:36:52,868 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:36:52,886 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:36:52,941 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:36:52,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:36:52,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 66 conjunts are in the unsatisfiable core [2019-09-07 10:36:52,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:36:52,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (65)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:36:52,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:36:52,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 67 [2019-09-07 10:36:52,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-07 10:36:52,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-07 10:36:52,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-09-07 10:36:52,968 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 67 states. [2019-09-07 10:36:53,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:36:53,111 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2019-09-07 10:36:53,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-07 10:36:53,112 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 77 [2019-09-07 10:36:53,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:36:53,112 INFO L225 Difference]: With dead ends: 94 [2019-09-07 10:36:53,113 INFO L226 Difference]: Without dead ends: 83 [2019-09-07 10:36:53,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-09-07 10:36:53,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-09-07 10:36:53,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-09-07 10:36:53,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-07 10:36:53,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-09-07 10:36:53,116 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 77 [2019-09-07 10:36:53,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:36:53,117 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-09-07 10:36:53,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-07 10:36:53,117 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-09-07 10:36:53,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-07 10:36:53,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:36:53,117 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:36:53,118 INFO L418 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:36:53,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:36:53,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1311175058, now seen corresponding path program 65 times [2019-09-07 10:36:53,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:36:53,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:36:53,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:36:53,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:36:53,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:36:53,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:36:54,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:36:54,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:36:54,676 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:36:54,685 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:37:58,455 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 34 check-sat command(s) [2019-09-07 10:37:58,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:37:58,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 67 conjunts are in the unsatisfiable core [2019-09-07 10:37:58,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:37:58,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:37:58,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:37:58,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 68 [2019-09-07 10:37:58,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-07 10:37:58,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-07 10:37:58,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-09-07 10:37:58,511 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 68 states. [2019-09-07 10:37:58,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:37:58,636 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2019-09-07 10:37:58,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-07 10:37:58,636 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 78 [2019-09-07 10:37:58,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:37:58,637 INFO L225 Difference]: With dead ends: 95 [2019-09-07 10:37:58,637 INFO L226 Difference]: Without dead ends: 84 [2019-09-07 10:37:58,638 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-09-07 10:37:58,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-09-07 10:37:58,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-09-07 10:37:58,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-09-07 10:37:58,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2019-09-07 10:37:58,642 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 78 [2019-09-07 10:37:58,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:37:58,642 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2019-09-07 10:37:58,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-07 10:37:58,643 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2019-09-07 10:37:58,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-07 10:37:58,643 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:37:58,643 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:37:58,643 INFO L418 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:37:58,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:37:58,644 INFO L82 PathProgramCache]: Analyzing trace with hash 212167474, now seen corresponding path program 66 times [2019-09-07 10:37:58,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:37:58,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:37:58,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:37:58,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:37:58,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:37:58,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:38:00,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:38:00,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:38:00,289 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:38:00,303 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:39:48,823 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2019-09-07 10:39:48,823 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:39:48,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-07 10:39:48,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:39:48,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:39:48,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:39:48,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 69 [2019-09-07 10:39:48,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-07 10:39:48,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-07 10:39:48,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-09-07 10:39:48,890 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 69 states. [2019-09-07 10:39:49,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:39:49,011 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2019-09-07 10:39:49,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-07 10:39:49,011 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 79 [2019-09-07 10:39:49,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:39:49,012 INFO L225 Difference]: With dead ends: 96 [2019-09-07 10:39:49,012 INFO L226 Difference]: Without dead ends: 85 [2019-09-07 10:39:49,013 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-09-07 10:39:49,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-09-07 10:39:49,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-09-07 10:39:49,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-09-07 10:39:49,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-09-07 10:39:49,016 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 79 [2019-09-07 10:39:49,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:39:49,016 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-09-07 10:39:49,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-07 10:39:49,017 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-09-07 10:39:49,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-07 10:39:49,017 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:39:49,017 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:39:49,018 INFO L418 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:39:49,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:39:49,018 INFO L82 PathProgramCache]: Analyzing trace with hash 191145710, now seen corresponding path program 67 times [2019-09-07 10:39:49,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:39:49,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:39:49,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:39:49,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:39:49,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:39:49,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:39:50,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:39:50,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:39:50,665 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:39:50,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:39:50,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:39:50,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 69 conjunts are in the unsatisfiable core [2019-09-07 10:39:50,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:39:50,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:39:50,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:39:50,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 70 [2019-09-07 10:39:50,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-07 10:39:50,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-07 10:39:50,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-09-07 10:39:50,768 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 70 states. [2019-09-07 10:39:50,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:39:50,885 INFO L93 Difference]: Finished difference Result 97 states and 99 transitions. [2019-09-07 10:39:50,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-07 10:39:50,885 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 80 [2019-09-07 10:39:50,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:39:50,886 INFO L225 Difference]: With dead ends: 97 [2019-09-07 10:39:50,886 INFO L226 Difference]: Without dead ends: 86 [2019-09-07 10:39:50,887 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-09-07 10:39:50,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-09-07 10:39:50,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-09-07 10:39:50,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-09-07 10:39:50,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2019-09-07 10:39:50,890 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 80 [2019-09-07 10:39:50,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:39:50,890 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2019-09-07 10:39:50,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-07 10:39:50,890 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2019-09-07 10:39:50,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-07 10:39:50,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:39:50,891 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:39:50,891 INFO L418 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:39:50,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:39:50,891 INFO L82 PathProgramCache]: Analyzing trace with hash -460528974, now seen corresponding path program 68 times [2019-09-07 10:39:50,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:39:50,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:39:50,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:39:50,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:39:50,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:39:50,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:39:52,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:39:52,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:39:52,641 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:39:52,650 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:39:52,720 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:39:52,720 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:39:52,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 70 conjunts are in the unsatisfiable core [2019-09-07 10:39:52,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:39:52,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:39:52,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:39:52,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 71 [2019-09-07 10:39:52,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-07 10:39:52,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-07 10:39:52,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-09-07 10:39:52,739 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand 71 states. [2019-09-07 10:39:52,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:39:52,876 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2019-09-07 10:39:52,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-07 10:39:52,876 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 81 [2019-09-07 10:39:52,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:39:52,877 INFO L225 Difference]: With dead ends: 98 [2019-09-07 10:39:52,877 INFO L226 Difference]: Without dead ends: 87 [2019-09-07 10:39:52,877 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-09-07 10:39:52,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-09-07 10:39:52,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-09-07 10:39:52,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-07 10:39:52,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-09-07 10:39:52,879 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 81 [2019-09-07 10:39:52,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:39:52,880 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-09-07 10:39:52,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-07 10:39:52,880 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-09-07 10:39:52,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-07 10:39:52,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:39:52,880 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:39:52,880 INFO L418 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:39:52,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:39:52,881 INFO L82 PathProgramCache]: Analyzing trace with hash 812392302, now seen corresponding path program 69 times [2019-09-07 10:39:52,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:39:52,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:39:52,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:39:52,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:39:52,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:39:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:39:54,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:39:54,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:39:54,686 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:39:54,699 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:41:56,481 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-09-07 10:41:56,481 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:41:56,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-07 10:41:56,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:41:56,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:41:56,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:41:56,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 72 [2019-09-07 10:41:56,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-09-07 10:41:56,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-09-07 10:41:56,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-09-07 10:41:56,545 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 72 states. [2019-09-07 10:41:56,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:41:56,668 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2019-09-07 10:41:56,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-09-07 10:41:56,668 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 82 [2019-09-07 10:41:56,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:41:56,669 INFO L225 Difference]: With dead ends: 99 [2019-09-07 10:41:56,669 INFO L226 Difference]: Without dead ends: 88 [2019-09-07 10:41:56,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-09-07 10:41:56,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-09-07 10:41:56,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-09-07 10:41:56,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-07 10:41:56,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2019-09-07 10:41:56,672 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 82 [2019-09-07 10:41:56,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:41:56,672 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2019-09-07 10:41:56,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-09-07 10:41:56,673 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2019-09-07 10:41:56,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-07 10:41:56,673 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:41:56,673 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:41:56,674 INFO L418 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:41:56,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:41:56,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1618246194, now seen corresponding path program 70 times [2019-09-07 10:41:56,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:41:56,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:41:56,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:41:56,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:41:56,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:41:56,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:41:58,514 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:41:58,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:41:58,514 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:41:58,524 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:41:58,586 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:41:58,586 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:41:58,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 72 conjunts are in the unsatisfiable core [2019-09-07 10:41:58,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:41:58,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:41:58,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:41:58,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 73 [2019-09-07 10:41:58,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-07 10:41:58,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-07 10:41:58,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-09-07 10:41:58,610 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 73 states. [2019-09-07 10:41:58,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:41:58,762 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2019-09-07 10:41:58,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-07 10:41:58,762 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 83 [2019-09-07 10:41:58,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:41:58,763 INFO L225 Difference]: With dead ends: 100 [2019-09-07 10:41:58,763 INFO L226 Difference]: Without dead ends: 89 [2019-09-07 10:41:58,764 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-09-07 10:41:58,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-09-07 10:41:58,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-09-07 10:41:58,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-09-07 10:41:58,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-09-07 10:41:58,767 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 83 [2019-09-07 10:41:58,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:41:58,767 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-09-07 10:41:58,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-07 10:41:58,768 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-09-07 10:41:58,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-07 10:41:58,768 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:41:58,768 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:41:58,768 INFO L418 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:41:58,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:41:58,768 INFO L82 PathProgramCache]: Analyzing trace with hash 829913070, now seen corresponding path program 71 times [2019-09-07 10:41:58,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:41:58,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:41:58,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:41:58,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:41:58,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:41:58,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:42:00,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:42:00,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:42:00,615 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:42:00,625 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1