java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-acceleration/simple_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 19:38:51,794 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 19:38:51,796 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 19:38:51,808 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 19:38:51,808 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 19:38:51,809 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 19:38:51,812 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 19:38:51,814 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 19:38:51,816 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 19:38:51,816 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 19:38:51,817 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 19:38:51,818 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 19:38:51,819 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 19:38:51,820 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 19:38:51,821 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 19:38:51,822 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 19:38:51,822 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 19:38:51,823 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 19:38:51,825 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 19:38:51,827 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 19:38:51,829 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 19:38:51,830 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 19:38:51,831 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 19:38:51,832 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 19:38:51,834 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 19:38:51,834 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 19:38:51,835 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 19:38:51,836 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 19:38:51,836 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 19:38:51,837 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 19:38:51,837 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 19:38:51,838 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 19:38:51,839 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 19:38:51,840 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 19:38:51,841 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 19:38:51,841 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 19:38:51,842 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 19:38:51,842 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 19:38:51,842 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 19:38:51,843 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 19:38:51,844 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 19:38:51,845 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-03 19:38:51,860 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 19:38:51,860 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 19:38:51,861 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 19:38:51,862 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 19:38:51,862 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 19:38:51,862 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 19:38:51,862 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 19:38:51,862 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 19:38:51,863 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 19:38:51,863 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 19:38:51,863 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 19:38:51,863 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 19:38:51,863 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 19:38:51,864 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 19:38:51,864 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 19:38:51,864 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 19:38:51,864 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 19:38:51,864 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 19:38:51,865 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 19:38:51,865 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 19:38:51,865 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 19:38:51,865 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:38:51,865 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 19:38:51,866 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 19:38:51,866 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 19:38:51,866 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 19:38:51,866 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 19:38:51,866 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 19:38:51,867 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 19:38:51,900 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 19:38:51,916 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 19:38:51,919 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 19:38:51,920 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 19:38:51,921 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 19:38:51,921 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/simple_1-2.c [2019-09-03 19:38:51,994 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dfbd2708/b2bf0708849d4ff3a60263f7e758f15c/FLAGfa53700e2 [2019-09-03 19:38:52,444 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 19:38:52,444 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_1-2.c [2019-09-03 19:38:52,450 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dfbd2708/b2bf0708849d4ff3a60263f7e758f15c/FLAGfa53700e2 [2019-09-03 19:38:52,811 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dfbd2708/b2bf0708849d4ff3a60263f7e758f15c [2019-09-03 19:38:52,820 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 19:38:52,822 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 19:38:52,823 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 19:38:52,823 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 19:38:52,828 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 19:38:52,829 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:38:52" (1/1) ... [2019-09-03 19:38:52,832 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2aafe825 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:38:52, skipping insertion in model container [2019-09-03 19:38:52,832 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:38:52" (1/1) ... [2019-09-03 19:38:52,839 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 19:38:52,854 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 19:38:53,028 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:38:53,039 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 19:38:53,056 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:38:53,069 INFO L192 MainTranslator]: Completed translation [2019-09-03 19:38:53,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:38:53 WrapperNode [2019-09-03 19:38:53,069 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 19:38:53,070 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 19:38:53,070 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 19:38:53,070 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 19:38:53,080 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:38:53" (1/1) ... [2019-09-03 19:38:53,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:38:53" (1/1) ... [2019-09-03 19:38:53,173 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:38:53" (1/1) ... [2019-09-03 19:38:53,173 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:38:53" (1/1) ... [2019-09-03 19:38:53,178 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:38:53" (1/1) ... [2019-09-03 19:38:53,183 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:38:53" (1/1) ... [2019-09-03 19:38:53,184 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:38:53" (1/1) ... [2019-09-03 19:38:53,185 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 19:38:53,185 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 19:38:53,185 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 19:38:53,185 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 19:38:53,186 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:38:53" (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-03 19:38:53,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 19:38:53,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 19:38:53,235 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 19:38:53,235 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 19:38:53,235 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 19:38:53,235 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 19:38:53,235 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 19:38:53,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 19:38:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 19:38:53,369 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 19:38:53,369 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-03 19:38:53,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:38:53 BoogieIcfgContainer [2019-09-03 19:38:53,370 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 19:38:53,371 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 19:38:53,371 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 19:38:53,374 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 19:38:53,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 07:38:52" (1/3) ... [2019-09-03 19:38:53,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@235fee69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:38:53, skipping insertion in model container [2019-09-03 19:38:53,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:38:53" (2/3) ... [2019-09-03 19:38:53,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@235fee69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:38:53, skipping insertion in model container [2019-09-03 19:38:53,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:38:53" (3/3) ... [2019-09-03 19:38:53,378 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_1-2.c [2019-09-03 19:38:53,387 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 19:38:53,393 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 19:38:53,405 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 19:38:53,434 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 19:38:53,434 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 19:38:53,435 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 19:38:53,435 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 19:38:53,435 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 19:38:53,435 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 19:38:53,435 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 19:38:53,435 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 19:38:53,436 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 19:38:53,452 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-09-03 19:38:53,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 19:38:53,458 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:38:53,459 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:38:53,460 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:38:53,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:38:53,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1846144830, now seen corresponding path program 1 times [2019-09-03 19:38:53,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:38:53,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:38:53,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:53,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:38:53,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:53,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:38:53,655 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-03 19:38:53,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:38:53,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 19:38:53,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 19:38:53,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 19:38:53,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 19:38:53,691 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-09-03 19:38:53,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:38:53,728 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2019-09-03 19:38:53,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 19:38:53,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-03 19:38:53,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:38:53,739 INFO L225 Difference]: With dead ends: 29 [2019-09-03 19:38:53,739 INFO L226 Difference]: Without dead ends: 12 [2019-09-03 19:38:53,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 19:38:53,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-03 19:38:53,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-03 19:38:53,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-03 19:38:53,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-09-03 19:38:53,779 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-09-03 19:38:53,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:38:53,780 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-09-03 19:38:53,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 19:38:53,780 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-09-03 19:38:53,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-03 19:38:53,781 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:38:53,781 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:38:53,781 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:38:53,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:38:53,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1432376145, now seen corresponding path program 1 times [2019-09-03 19:38:53,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:38:53,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:38:53,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:53,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:38:53,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:53,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:38:53,894 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-03 19:38:53,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:38:53,895 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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:38:53,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:38:53,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:38:53,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-03 19:38:53,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:38:53,982 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-03 19:38:53,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:38:53,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-03 19:38:53,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:38:53,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:38:53,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:38:53,988 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 5 states. [2019-09-03 19:38:54,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:38:54,008 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-09-03 19:38:54,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 19:38:54,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-09-03 19:38:54,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:38:54,009 INFO L225 Difference]: With dead ends: 18 [2019-09-03 19:38:54,010 INFO L226 Difference]: Without dead ends: 13 [2019-09-03 19:38:54,011 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:38:54,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-09-03 19:38:54,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-09-03 19:38:54,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-09-03 19:38:54,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-09-03 19:38:54,015 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-09-03 19:38:54,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:38:54,016 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-09-03 19:38:54,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:38:54,016 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-09-03 19:38:54,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 19:38:54,017 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:38:54,017 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:38:54,017 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:38:54,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:38:54,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1490448798, now seen corresponding path program 2 times [2019-09-03 19:38:54,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:38:54,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:38:54,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:54,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:38:54,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:38:54,121 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-03 19:38:54,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:38:54,122 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:38:54,148 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:38:54,160 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:38:54,161 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:38:54,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-03 19:38:54,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:38:54,196 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-03 19:38:54,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:38:54,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-03 19:38:54,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 19:38:54,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 19:38:54,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:38:54,201 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 6 states. [2019-09-03 19:38:54,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:38:54,229 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-09-03 19:38:54,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:38:54,229 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-09-03 19:38:54,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:38:54,230 INFO L225 Difference]: With dead ends: 19 [2019-09-03 19:38:54,231 INFO L226 Difference]: Without dead ends: 14 [2019-09-03 19:38:54,231 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:38:54,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-03 19:38:54,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-09-03 19:38:54,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-03 19:38:54,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-09-03 19:38:54,236 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-09-03 19:38:54,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:38:54,236 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-09-03 19:38:54,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 19:38:54,236 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-09-03 19:38:54,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-03 19:38:54,237 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:38:54,237 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:38:54,238 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:38:54,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:38:54,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1004266255, now seen corresponding path program 3 times [2019-09-03 19:38:54,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:38:54,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:38:54,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:54,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:38:54,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:54,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:38:54,332 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-03 19:38:54,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:38:54,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 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-03 19:38:54,355 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:38:54,366 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-03 19:38:54,367 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:38:54,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-03 19:38:54,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:38:54,405 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-03 19:38:54,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:38:54,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-03 19:38:54,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 19:38:54,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 19:38:54,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:38:54,411 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 7 states. [2019-09-03 19:38:54,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:38:54,464 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-09-03 19:38:54,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:38:54,465 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-09-03 19:38:54,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:38:54,466 INFO L225 Difference]: With dead ends: 20 [2019-09-03 19:38:54,466 INFO L226 Difference]: Without dead ends: 15 [2019-09-03 19:38:54,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:38:54,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-09-03 19:38:54,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-09-03 19:38:54,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-03 19:38:54,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-09-03 19:38:54,474 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-09-03 19:38:54,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:38:54,475 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-09-03 19:38:54,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 19:38:54,475 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-09-03 19:38:54,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 19:38:54,476 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:38:54,476 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:38:54,476 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:38:54,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:38:54,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1031021570, now seen corresponding path program 4 times [2019-09-03 19:38:54,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:38:54,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:38:54,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:54,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:38:54,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:54,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:38:54,624 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-03 19:38:54,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:38:54,625 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-03 19:38:54,648 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:38:54,658 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:38:54,658 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:38:54,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 19:38:54,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:38:54,685 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-03 19:38:54,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:38:54,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-03 19:38:54,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 19:38:54,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 19:38:54,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:38:54,705 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2019-09-03 19:38:54,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:38:54,759 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-09-03 19:38:54,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 19:38:54,760 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-09-03 19:38:54,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:38:54,761 INFO L225 Difference]: With dead ends: 21 [2019-09-03 19:38:54,761 INFO L226 Difference]: Without dead ends: 16 [2019-09-03 19:38:54,762 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:38:54,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-03 19:38:54,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-09-03 19:38:54,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-09-03 19:38:54,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-09-03 19:38:54,769 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-09-03 19:38:54,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:38:54,770 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-09-03 19:38:54,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 19:38:54,770 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-09-03 19:38:54,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-03 19:38:54,771 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:38:54,771 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:38:54,771 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:38:54,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:38:54,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1860436335, now seen corresponding path program 5 times [2019-09-03 19:38:54,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:38:54,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:38:54,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:54,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:38:54,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:54,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:38:54,920 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-03 19:38:54,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:38:54,921 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-03 19:38:54,942 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-03 19:38:54,960 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-09-03 19:38:54,960 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:38:54,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-03 19:38:54,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:38:54,997 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-03 19:38:55,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:38:55,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-03 19:38:55,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 19:38:55,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 19:38:55,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:38:55,002 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 9 states. [2019-09-03 19:38:55,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:38:55,052 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-09-03 19:38:55,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 19:38:55,053 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-09-03 19:38:55,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:38:55,053 INFO L225 Difference]: With dead ends: 22 [2019-09-03 19:38:55,054 INFO L226 Difference]: Without dead ends: 17 [2019-09-03 19:38:55,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:38:55,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-09-03 19:38:55,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-09-03 19:38:55,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-03 19:38:55,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-09-03 19:38:55,058 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-09-03 19:38:55,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:38:55,059 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-09-03 19:38:55,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 19:38:55,059 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-09-03 19:38:55,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 19:38:55,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:38:55,060 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:38:55,060 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:38:55,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:38:55,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1802490274, now seen corresponding path program 6 times [2019-09-03 19:38:55,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:38:55,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:38:55,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:55,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:38:55,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:55,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:38:55,181 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-03 19:38:55,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:38:55,181 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-03 19:38:55,197 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:38:55,213 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-09-03 19:38:55,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:38:55,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 19:38:55,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:38:55,239 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-03 19:38:55,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:38:55,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-03 19:38:55,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 19:38:55,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 19:38:55,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:38:55,244 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2019-09-03 19:38:55,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:38:55,312 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-09-03 19:38:55,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 19:38:55,313 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-09-03 19:38:55,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:38:55,314 INFO L225 Difference]: With dead ends: 23 [2019-09-03 19:38:55,314 INFO L226 Difference]: Without dead ends: 18 [2019-09-03 19:38:55,315 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:38:55,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-03 19:38:55,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-03 19:38:55,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-03 19:38:55,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-09-03 19:38:55,323 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-09-03 19:38:55,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:38:55,323 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-09-03 19:38:55,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 19:38:55,324 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-09-03 19:38:55,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 19:38:55,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:38:55,325 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:38:55,325 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:38:55,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:38:55,326 INFO L82 PathProgramCache]: Analyzing trace with hash -6162383, now seen corresponding path program 7 times [2019-09-03 19:38:55,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:38:55,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:38:55,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:55,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:38:55,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:55,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:38:55,486 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-03 19:38:55,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:38:55,486 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-03 19:38:55,500 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-03 19:38:55,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:38:55,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-03 19:38:55,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:38:55,539 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-03 19:38:55,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:38:55,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-03 19:38:55,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 19:38:55,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 19:38:55,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:38:55,544 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 11 states. [2019-09-03 19:38:55,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:38:55,610 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-09-03 19:38:55,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 19:38:55,611 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2019-09-03 19:38:55,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:38:55,612 INFO L225 Difference]: With dead ends: 24 [2019-09-03 19:38:55,612 INFO L226 Difference]: Without dead ends: 19 [2019-09-03 19:38:55,613 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:38:55,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-03 19:38:55,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-03 19:38:55,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-03 19:38:55,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-09-03 19:38:55,618 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-09-03 19:38:55,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:38:55,618 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-09-03 19:38:55,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 19:38:55,619 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-09-03 19:38:55,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 19:38:55,619 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:38:55,619 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:38:55,620 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:38:55,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:38:55,620 INFO L82 PathProgramCache]: Analyzing trace with hash -154572610, now seen corresponding path program 8 times [2019-09-03 19:38:55,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:38:55,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:38:55,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:55,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:38:55,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:55,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:38:55,766 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-03 19:38:55,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:38:55,767 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-03 19:38:55,789 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:38:55,803 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:38:55,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:38:55,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-03 19:38:55,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:38:55,833 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-03 19:38:55,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:38:55,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-09-03 19:38:55,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 19:38:55,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 19:38:55,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:38:55,841 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 12 states. [2019-09-03 19:38:55,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:38:55,938 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-09-03 19:38:55,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 19:38:55,939 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-09-03 19:38:55,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:38:55,940 INFO L225 Difference]: With dead ends: 25 [2019-09-03 19:38:55,940 INFO L226 Difference]: Without dead ends: 20 [2019-09-03 19:38:55,941 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:38:55,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-03 19:38:55,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-09-03 19:38:55,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-03 19:38:55,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-09-03 19:38:55,945 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-09-03 19:38:55,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:38:55,945 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-09-03 19:38:55,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 19:38:55,945 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-09-03 19:38:55,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-03 19:38:55,946 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:38:55,946 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:38:55,946 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:38:55,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:38:55,947 INFO L82 PathProgramCache]: Analyzing trace with hash -460322351, now seen corresponding path program 9 times [2019-09-03 19:38:55,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:38:55,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:38:55,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:55,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:38:55,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:38:55,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:38:56,105 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-03 19:38:56,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:38:56,106 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) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:38:56,122 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:39:08,738 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-03 19:39:08,738 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:39:08,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-03 19:39:08,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:39:08,774 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-03 19:39:08,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:39:08,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-03 19:39:08,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 19:39:08,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 19:39:08,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-03 19:39:08,781 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 13 states. [2019-09-03 19:39:08,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:39:08,883 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-09-03 19:39:08,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 19:39:08,884 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2019-09-03 19:39:08,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:39:08,885 INFO L225 Difference]: With dead ends: 26 [2019-09-03 19:39:08,885 INFO L226 Difference]: Without dead ends: 21 [2019-09-03 19:39:08,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-03 19:39:08,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-03 19:39:08,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-03 19:39:08,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-03 19:39:08,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-09-03 19:39:08,893 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-09-03 19:39:08,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:39:08,893 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-09-03 19:39:08,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 19:39:08,893 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-09-03 19:39:08,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 19:39:08,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:39:08,894 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:39:08,894 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:39:08,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:39:08,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1348629730, now seen corresponding path program 10 times [2019-09-03 19:39:08,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:39:08,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:39:08,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:39:08,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:39:08,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:39:08,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:39:09,078 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-03 19:39:09,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:39:09,079 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) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:39:09,094 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:39:09,105 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:39:09,105 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:39:09,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-03 19:39:09,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:39:09,135 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-03 19:39:09,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:39:09,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-03 19:39:09,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 19:39:09,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 19:39:09,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:39:09,140 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 14 states. [2019-09-03 19:39:09,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:39:09,235 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-09-03 19:39:09,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 19:39:09,236 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2019-09-03 19:39:09,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:39:09,236 INFO L225 Difference]: With dead ends: 27 [2019-09-03 19:39:09,236 INFO L226 Difference]: Without dead ends: 22 [2019-09-03 19:39:09,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:39:09,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-03 19:39:09,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-03 19:39:09,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-03 19:39:09,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-09-03 19:39:09,241 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-09-03 19:39:09,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:39:09,241 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-09-03 19:39:09,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 19:39:09,242 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-09-03 19:39:09,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-03 19:39:09,242 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:39:09,243 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:39:09,243 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:39:09,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:39:09,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1178612593, now seen corresponding path program 11 times [2019-09-03 19:39:09,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:39:09,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:39:09,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:39:09,244 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:39:09,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:39:09,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:39:09,411 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-03 19:39:09,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:39:09,411 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-03 19:39:09,432 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-03 19:39:25,843 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-09-03 19:39:25,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:39:25,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-03 19:39:25,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:39:25,908 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-03 19:39:25,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:39:25,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-09-03 19:39:25,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 19:39:25,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 19:39:25,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-09-03 19:39:25,915 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 15 states. [2019-09-03 19:39:26,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:39:26,056 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-09-03 19:39:26,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 19:39:26,057 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2019-09-03 19:39:26,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:39:26,058 INFO L225 Difference]: With dead ends: 28 [2019-09-03 19:39:26,058 INFO L226 Difference]: Without dead ends: 23 [2019-09-03 19:39:26,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-09-03 19:39:26,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-03 19:39:26,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-03 19:39:26,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-03 19:39:26,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-09-03 19:39:26,063 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-09-03 19:39:26,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:39:26,063 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-09-03 19:39:26,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 19:39:26,064 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-09-03 19:39:26,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-03 19:39:26,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:39:26,065 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:39:26,065 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:39:26,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:39:26,065 INFO L82 PathProgramCache]: Analyzing trace with hash -2081254018, now seen corresponding path program 12 times [2019-09-03 19:39:26,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:39:26,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:39:26,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:39:26,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:39:26,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:39:26,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:39:26,259 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-03 19:39:26,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:39:26,260 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) [2019-09-03 19:39:26,274 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:39:26,402 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-03 19:39:26,402 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:39:26,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-03 19:39:26,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:39:26,457 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-03 19:39:26,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:39:26,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-03 19:39:26,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 19:39:26,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 19:39:26,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-09-03 19:39:26,464 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 16 states. [2019-09-03 19:39:26,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:39:26,612 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-09-03 19:39:26,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 19:39:26,615 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-09-03 19:39:26,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:39:26,616 INFO L225 Difference]: With dead ends: 29 [2019-09-03 19:39:26,616 INFO L226 Difference]: Without dead ends: 24 [2019-09-03 19:39:26,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-09-03 19:39:26,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-03 19:39:26,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-09-03 19:39:26,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-03 19:39:26,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-09-03 19:39:26,622 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-09-03 19:39:26,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:39:26,622 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-09-03 19:39:26,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 19:39:26,622 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-09-03 19:39:26,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-03 19:39:26,623 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:39:26,623 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:39:26,624 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:39:26,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:39:26,624 INFO L82 PathProgramCache]: Analyzing trace with hash -57903855, now seen corresponding path program 13 times [2019-09-03 19:39:26,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:39:26,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:39:26,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:39:26,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:39:26,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:39:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:39:26,846 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-03 19:39:26,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:39:26,847 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-03 19:39:26,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:39:26,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:39:26,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-03 19:39:26,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:39:26,913 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-03 19:39:26,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:39:26,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-09-03 19:39:26,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 19:39:26,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 19:39:26,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-09-03 19:39:26,919 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 17 states. [2019-09-03 19:39:27,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:39:27,086 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-09-03 19:39:27,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 19:39:27,087 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2019-09-03 19:39:27,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:39:27,088 INFO L225 Difference]: With dead ends: 30 [2019-09-03 19:39:27,088 INFO L226 Difference]: Without dead ends: 25 [2019-09-03 19:39:27,089 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-09-03 19:39:27,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-03 19:39:27,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-09-03 19:39:27,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-03 19:39:27,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-09-03 19:39:27,093 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-09-03 19:39:27,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:39:27,093 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-09-03 19:39:27,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 19:39:27,094 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-09-03 19:39:27,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-03 19:39:27,094 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:39:27,094 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:39:27,095 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:39:27,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:39:27,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1758558242, now seen corresponding path program 14 times [2019-09-03 19:39:27,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:39:27,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:39:27,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:39:27,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:39:27,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:39:27,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:39:27,321 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-03 19:39:27,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:39:27,321 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-03 19:39:27,341 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:39:27,353 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:39:27,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:39:27,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-03 19:39:27,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:39:27,384 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-03 19:39:27,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:39:27,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-09-03 19:39:27,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 19:39:27,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 19:39:27,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-09-03 19:39:27,388 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 18 states. [2019-09-03 19:39:27,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:39:27,559 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-09-03 19:39:27,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 19:39:27,560 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2019-09-03 19:39:27,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:39:27,561 INFO L225 Difference]: With dead ends: 31 [2019-09-03 19:39:27,561 INFO L226 Difference]: Without dead ends: 26 [2019-09-03 19:39:27,562 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-09-03 19:39:27,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-03 19:39:27,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-09-03 19:39:27,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-03 19:39:27,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-09-03 19:39:27,565 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-09-03 19:39:27,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:39:27,566 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-09-03 19:39:27,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 19:39:27,566 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-09-03 19:39:27,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-03 19:39:27,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:39:27,567 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:39:27,567 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:39:27,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:39:27,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1355730609, now seen corresponding path program 15 times [2019-09-03 19:39:27,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:39:27,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:39:27,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:39:27,568 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:39:27,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:39:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:39:27,833 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-03 19:39:27,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:39:27,833 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-03 19:39:27,844 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:39:41,670 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-03 19:39:41,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:39:41,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-03 19:39:41,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:39:41,713 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-03 19:39:41,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:39:41,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-09-03 19:39:41,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 19:39:41,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 19:39:41,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-09-03 19:39:41,720 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 19 states. [2019-09-03 19:39:41,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:39:41,923 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-09-03 19:39:41,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-03 19:39:41,929 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 25 [2019-09-03 19:39:41,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:39:41,930 INFO L225 Difference]: With dead ends: 32 [2019-09-03 19:39:41,930 INFO L226 Difference]: Without dead ends: 27 [2019-09-03 19:39:41,931 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-09-03 19:39:41,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-03 19:39:41,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-03 19:39:41,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-03 19:39:41,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-09-03 19:39:41,936 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-09-03 19:39:41,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:39:41,936 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-09-03 19:39:41,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 19:39:41,936 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-09-03 19:39:41,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-03 19:39:41,937 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:39:41,937 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:39:41,938 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:39:41,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:39:41,938 INFO L82 PathProgramCache]: Analyzing trace with hash -885562818, now seen corresponding path program 16 times [2019-09-03 19:39:41,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:39:41,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:39:41,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:39:41,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:39:41,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:39:41,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:39:42,221 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-03 19:39:42,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:39:42,222 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) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:39:42,232 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:39:42,250 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:39:42,250 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:39:42,251 WARN L254 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-03 19:39:42,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:39:42,288 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-03 19:39:42,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:39:42,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-09-03 19:39:42,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 19:39:42,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 19:39:42,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:39:42,292 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 20 states. [2019-09-03 19:39:42,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:39:42,523 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-09-03 19:39:42,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 19:39:42,523 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 26 [2019-09-03 19:39:42,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:39:42,524 INFO L225 Difference]: With dead ends: 33 [2019-09-03 19:39:42,524 INFO L226 Difference]: Without dead ends: 28 [2019-09-03 19:39:42,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:39:42,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-03 19:39:42,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-09-03 19:39:42,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-03 19:39:42,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-09-03 19:39:42,540 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-09-03 19:39:42,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:39:42,542 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-09-03 19:39:42,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 19:39:42,542 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-09-03 19:39:42,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-03 19:39:42,543 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:39:42,543 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:39:42,543 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:39:42,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:39:42,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1646182319, now seen corresponding path program 17 times [2019-09-03 19:39:42,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:39:42,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:39:42,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:39:42,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:39:42,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:39:42,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:39:42,780 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-03 19:39:42,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:39:42,781 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-03 19:39:42,793 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:40:35,091 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-09-03 19:40:35,091 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:40:35,117 WARN L254 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-03 19:40:35,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:40:35,176 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-03 19:40:35,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:40:35,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-09-03 19:40:35,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 19:40:35,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 19:40:35,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-09-03 19:40:35,185 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 21 states. [2019-09-03 19:40:35,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:40:35,402 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-09-03 19:40:35,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 19:40:35,403 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 [2019-09-03 19:40:35,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:40:35,404 INFO L225 Difference]: With dead ends: 34 [2019-09-03 19:40:35,404 INFO L226 Difference]: Without dead ends: 29 [2019-09-03 19:40:35,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-09-03 19:40:35,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-03 19:40:35,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-09-03 19:40:35,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-03 19:40:35,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-09-03 19:40:35,409 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-09-03 19:40:35,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:40:35,410 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-09-03 19:40:35,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 19:40:35,410 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-09-03 19:40:35,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 19:40:35,411 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:40:35,411 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:40:35,411 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:40:35,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:40:35,411 INFO L82 PathProgramCache]: Analyzing trace with hash 544416926, now seen corresponding path program 18 times [2019-09-03 19:40:35,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:40:35,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:40:35,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:40:35,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:40:35,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:40:35,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:40:35,785 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-03 19:40:35,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:40:35,785 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) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:40:35,814 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:40:36,013 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-09-03 19:40:36,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:40:36,015 WARN L254 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-03 19:40:36,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:40:36,053 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-03 19:40:36,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:40:36,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-09-03 19:40:36,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-03 19:40:36,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-03 19:40:36,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-09-03 19:40:36,059 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 22 states. [2019-09-03 19:40:36,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:40:36,296 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-09-03 19:40:36,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-03 19:40:36,296 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2019-09-03 19:40:36,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:40:36,297 INFO L225 Difference]: With dead ends: 35 [2019-09-03 19:40:36,297 INFO L226 Difference]: Without dead ends: 30 [2019-09-03 19:40:36,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-09-03 19:40:36,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-03 19:40:36,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-09-03 19:40:36,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-03 19:40:36,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-09-03 19:40:36,306 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-09-03 19:40:36,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:40:36,308 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-09-03 19:40:36,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-03 19:40:36,309 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-09-03 19:40:36,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-03 19:40:36,309 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:40:36,309 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:40:36,310 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:40:36,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:40:36,310 INFO L82 PathProgramCache]: Analyzing trace with hash -266483215, now seen corresponding path program 19 times [2019-09-03 19:40:36,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:40:36,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:40:36,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:40:36,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:40:36,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:40:36,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:40:36,639 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-03 19:40:36,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:40:36,639 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) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:40:36,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:40:36,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:40:36,678 WARN L254 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-03 19:40:36,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:40:36,706 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-03 19:40:36,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:40:36,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-09-03 19:40:36,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 19:40:36,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 19:40:36,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-09-03 19:40:36,711 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 23 states. [2019-09-03 19:40:36,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:40:36,989 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-09-03 19:40:36,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-03 19:40:36,990 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 29 [2019-09-03 19:40:36,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:40:36,990 INFO L225 Difference]: With dead ends: 36 [2019-09-03 19:40:36,990 INFO L226 Difference]: Without dead ends: 31 [2019-09-03 19:40:36,991 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-09-03 19:40:36,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-03 19:40:37,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-09-03 19:40:37,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-03 19:40:37,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-09-03 19:40:37,001 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-09-03 19:40:37,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:40:37,002 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-09-03 19:40:37,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 19:40:37,002 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-09-03 19:40:37,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-03 19:40:37,002 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:40:37,002 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:40:37,003 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:40:37,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:40:37,003 INFO L82 PathProgramCache]: Analyzing trace with hash 365416190, now seen corresponding path program 20 times [2019-09-03 19:40:37,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:40:37,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:40:37,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:40:37,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:40:37,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:40:37,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:40:37,316 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-03 19:40:37,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:40:37,317 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-03 19:40:37,327 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:40:37,340 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:40:37,341 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:40:37,344 WARN L254 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-03 19:40:37,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:40:37,392 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-03 19:40:37,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:40:37,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-09-03 19:40:37,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 19:40:37,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 19:40:37,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-09-03 19:40:37,396 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 24 states. [2019-09-03 19:40:37,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:40:37,690 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-09-03 19:40:37,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 19:40:37,695 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 30 [2019-09-03 19:40:37,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:40:37,696 INFO L225 Difference]: With dead ends: 37 [2019-09-03 19:40:37,696 INFO L226 Difference]: Without dead ends: 32 [2019-09-03 19:40:37,697 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-09-03 19:40:37,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-03 19:40:37,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-09-03 19:40:37,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-03 19:40:37,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-09-03 19:40:37,702 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-09-03 19:40:37,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:40:37,703 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-09-03 19:40:37,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 19:40:37,703 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-09-03 19:40:37,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-03 19:40:37,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:40:37,706 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:40:37,706 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:40:37,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:40:37,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1520538735, now seen corresponding path program 21 times [2019-09-03 19:40:37,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:40:37,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:40:37,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:40:37,715 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:40:37,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:40:37,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:40:38,133 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-03 19:40:38,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:40:38,133 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) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:40:38,147 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:40:44,717 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-03 19:40:44,718 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:40:44,726 WARN L254 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-03 19:40:44,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:40:44,825 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-03 19:40:44,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:40:44,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-09-03 19:40:44,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 19:40:44,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 19:40:44,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-09-03 19:40:44,831 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 25 states. [2019-09-03 19:40:45,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:40:45,145 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-09-03 19:40:45,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 19:40:45,150 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 31 [2019-09-03 19:40:45,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:40:45,150 INFO L225 Difference]: With dead ends: 38 [2019-09-03 19:40:45,151 INFO L226 Difference]: Without dead ends: 33 [2019-09-03 19:40:45,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-09-03 19:40:45,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-03 19:40:45,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-03 19:40:45,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-03 19:40:45,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-09-03 19:40:45,158 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-09-03 19:40:45,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:40:45,158 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-09-03 19:40:45,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 19:40:45,158 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-09-03 19:40:45,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-03 19:40:45,159 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:40:45,160 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:40:45,161 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:40:45,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:40:45,161 INFO L82 PathProgramCache]: Analyzing trace with hash 144400734, now seen corresponding path program 22 times [2019-09-03 19:40:45,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:40:45,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:40:45,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:40:45,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:40:45,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:40:45,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:40:45,538 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-03 19:40:45,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:40:45,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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:40:45,548 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:40:45,564 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:40:45,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:40:45,565 WARN L254 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-03 19:40:45,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:40:45,606 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-03 19:40:45,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:40:45,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-09-03 19:40:45,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-03 19:40:45,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-03 19:40:45,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2019-09-03 19:40:45,611 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 26 states. [2019-09-03 19:40:45,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:40:45,956 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-09-03 19:40:45,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-03 19:40:45,957 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 32 [2019-09-03 19:40:45,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:40:45,957 INFO L225 Difference]: With dead ends: 39 [2019-09-03 19:40:45,957 INFO L226 Difference]: Without dead ends: 34 [2019-09-03 19:40:45,958 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2019-09-03 19:40:45,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-03 19:40:45,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-09-03 19:40:45,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-03 19:40:45,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-09-03 19:40:45,963 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-09-03 19:40:45,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:40:45,964 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-09-03 19:40:45,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-03 19:40:45,964 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-09-03 19:40:45,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-03 19:40:45,965 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:40:45,976 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:40:45,976 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:40:45,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:40:45,977 INFO L82 PathProgramCache]: Analyzing trace with hash 217916721, now seen corresponding path program 23 times [2019-09-03 19:40:45,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:40:45,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:40:45,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:40:45,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:40:45,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:40:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:40:46,472 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-03 19:40:46,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:40:46,473 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) [2019-09-03 19:40:46,496 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:42:32,273 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-09-03 19:42:32,274 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:42:32,430 WARN L254 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-03 19:42:32,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:42:32,467 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-03 19:42:32,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:42:32,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-09-03 19:42:32,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 19:42:32,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 19:42:32,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-09-03 19:42:32,475 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 27 states. [2019-09-03 19:42:32,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:42:32,838 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-09-03 19:42:32,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-03 19:42:32,838 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 33 [2019-09-03 19:42:32,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:42:32,839 INFO L225 Difference]: With dead ends: 40 [2019-09-03 19:42:32,839 INFO L226 Difference]: Without dead ends: 35 [2019-09-03 19:42:32,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-09-03 19:42:32,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-03 19:42:32,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-09-03 19:42:32,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-03 19:42:32,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-09-03 19:42:32,844 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-09-03 19:42:32,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:42:32,844 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-09-03 19:42:32,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 19:42:32,844 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-09-03 19:42:32,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-03 19:42:32,845 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:42:32,845 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:42:32,845 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:42:32,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:42:32,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1798054978, now seen corresponding path program 24 times [2019-09-03 19:42:32,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:42:32,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:42:32,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:42:32,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:42:32,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:42:32,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:42:33,277 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-03 19:42:33,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:42:33,277 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-03 19:42:33,288 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:42:36,814 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-03 19:42:36,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:42:36,821 WARN L254 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-03 19:42:36,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:42:36,866 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-03 19:42:36,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:42:36,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-09-03 19:42:36,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 19:42:36,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 19:42:36,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2019-09-03 19:42:36,872 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 28 states. [2019-09-03 19:42:37,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:42:37,278 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-09-03 19:42:37,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 19:42:37,278 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 34 [2019-09-03 19:42:37,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:42:37,279 INFO L225 Difference]: With dead ends: 41 [2019-09-03 19:42:37,279 INFO L226 Difference]: Without dead ends: 36 [2019-09-03 19:42:37,280 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2019-09-03 19:42:37,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-03 19:42:37,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-09-03 19:42:37,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-03 19:42:37,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-09-03 19:42:37,283 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-09-03 19:42:37,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:42:37,283 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-09-03 19:42:37,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 19:42:37,284 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-09-03 19:42:37,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-03 19:42:37,284 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:42:37,284 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:42:37,284 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:42:37,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:42:37,285 INFO L82 PathProgramCache]: Analyzing trace with hash 131331793, now seen corresponding path program 25 times [2019-09-03 19:42:37,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:42:37,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:42:37,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:42:37,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:42:37,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:42:37,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:42:37,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-03 19:42:37,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:42:37,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-03 19:42:37,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:42:37,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:42:37,785 WARN L254 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-03 19:42:37,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:42:37,833 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-03 19:42:37,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:42:37,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-09-03 19:42:37,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-03 19:42:37,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-03 19:42:37,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2019-09-03 19:42:37,838 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 29 states. [2019-09-03 19:42:38,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:42:38,282 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-09-03 19:42:38,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-03 19:42:38,283 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 35 [2019-09-03 19:42:38,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:42:38,284 INFO L225 Difference]: With dead ends: 42 [2019-09-03 19:42:38,284 INFO L226 Difference]: Without dead ends: 37 [2019-09-03 19:42:38,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2019-09-03 19:42:38,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-03 19:42:38,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-09-03 19:42:38,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-03 19:42:38,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-09-03 19:42:38,288 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-09-03 19:42:38,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:42:38,289 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-09-03 19:42:38,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-03 19:42:38,289 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-09-03 19:42:38,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-03 19:42:38,289 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:42:38,290 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:42:38,290 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:42:38,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:42:38,290 INFO L82 PathProgramCache]: Analyzing trace with hash -187220450, now seen corresponding path program 26 times [2019-09-03 19:42:38,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:42:38,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:42:38,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:42:38,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:42:38,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:42:38,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:42:38,768 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-03 19:42:38,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:42:38,768 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-03 19:42:38,778 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:42:38,794 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:42:38,794 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:42:38,796 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-03 19:42:38,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:42:38,860 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-03 19:42:38,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:42:38,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-09-03 19:42:38,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-03 19:42:38,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-03 19:42:38,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2019-09-03 19:42:38,865 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 30 states. [2019-09-03 19:42:39,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:42:39,295 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-09-03 19:42:39,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 19:42:39,295 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 36 [2019-09-03 19:42:39,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:42:39,296 INFO L225 Difference]: With dead ends: 43 [2019-09-03 19:42:39,296 INFO L226 Difference]: Without dead ends: 38 [2019-09-03 19:42:39,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2019-09-03 19:42:39,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-03 19:42:39,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-09-03 19:42:39,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-03 19:42:39,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-09-03 19:42:39,301 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-09-03 19:42:39,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:42:39,302 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-09-03 19:42:39,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-03 19:42:39,302 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-09-03 19:42:39,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-03 19:42:39,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:42:39,303 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:42:39,303 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:42:39,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:42:39,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1472405391, now seen corresponding path program 27 times [2019-09-03 19:42:39,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:42:39,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:42:39,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:42:39,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:42:39,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:42:39,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:42:39,997 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-03 19:42:39,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:42:39,997 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) [2019-09-03 19:42:40,028 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:45:24,464 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-03 19:45:24,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:45:27,734 WARN L254 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-03 19:45:27,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:45:27,777 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-03 19:45:27,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:45:27,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-09-03 19:45:27,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 19:45:27,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 19:45:27,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2019-09-03 19:45:27,785 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 31 states. [2019-09-03 19:45:28,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:45:28,282 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-09-03 19:45:28,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-03 19:45:28,282 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 37 [2019-09-03 19:45:28,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:45:28,283 INFO L225 Difference]: With dead ends: 44 [2019-09-03 19:45:28,283 INFO L226 Difference]: Without dead ends: 39 [2019-09-03 19:45:28,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2019-09-03 19:45:28,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-03 19:45:28,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-09-03 19:45:28,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-03 19:45:28,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-09-03 19:45:28,288 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-09-03 19:45:28,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:45:28,288 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-09-03 19:45:28,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 19:45:28,288 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-09-03 19:45:28,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-03 19:45:28,289 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:45:28,289 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:45:28,289 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:45:28,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:45:28,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1636534398, now seen corresponding path program 28 times [2019-09-03 19:45:28,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:45:28,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:45:28,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:45:28,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:45:28,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:45:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:45:28,841 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-03 19:45:28,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:45:28,841 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-03 19:45:28,851 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:45:28,869 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:45:28,869 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:45:28,871 WARN L254 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-03 19:45:28,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:45:28,919 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-03 19:45:28,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:45:28,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-09-03 19:45:28,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-03 19:45:28,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-03 19:45:28,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2019-09-03 19:45:28,923 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 32 states. [2019-09-03 19:45:29,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:45:29,471 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-09-03 19:45:29,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 19:45:29,472 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 38 [2019-09-03 19:45:29,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:45:29,472 INFO L225 Difference]: With dead ends: 45 [2019-09-03 19:45:29,473 INFO L226 Difference]: Without dead ends: 40 [2019-09-03 19:45:29,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2019-09-03 19:45:29,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-03 19:45:29,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-09-03 19:45:29,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-03 19:45:29,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-09-03 19:45:29,478 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-09-03 19:45:29,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:45:29,478 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-09-03 19:45:29,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-03 19:45:29,479 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-09-03 19:45:29,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-03 19:45:29,479 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:45:29,479 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:45:29,479 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:45:29,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:45:29,480 INFO L82 PathProgramCache]: Analyzing trace with hash -770579951, now seen corresponding path program 29 times [2019-09-03 19:45:29,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:45:29,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:45:29,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:45:29,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:45:29,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:45:29,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:45:30,000 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-03 19:45:30,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:45:30,000 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) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:45:30,010 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:48:49,647 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2019-09-03 19:48:49,647 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:48:50,097 WARN L254 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-03 19:48:50,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:48:50,145 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-03 19:48:50,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:48:50,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-09-03 19:48:50,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 19:48:50,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 19:48:50,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 19:48:50,150 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 33 states. [2019-09-03 19:48:50,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:48:50,741 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-09-03 19:48:50,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-03 19:48:50,742 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 39 [2019-09-03 19:48:50,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:48:50,743 INFO L225 Difference]: With dead ends: 46 [2019-09-03 19:48:50,743 INFO L226 Difference]: Without dead ends: 41 [2019-09-03 19:48:50,744 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 19:48:50,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-03 19:48:50,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-09-03 19:48:50,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-03 19:48:50,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-09-03 19:48:50,749 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-09-03 19:48:50,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:48:50,750 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-09-03 19:48:50,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 19:48:50,750 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-09-03 19:48:50,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-03 19:48:50,751 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:48:50,751 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:48:50,751 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:48:50,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:48:50,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1918286558, now seen corresponding path program 30 times [2019-09-03 19:48:50,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:48:50,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:48:50,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:48:50,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:48:50,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:48:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:48:51,336 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-03 19:48:51,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:48:51,336 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-03 19:48:51,346 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:50:38,854 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2019-09-03 19:50:38,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:39,002 WARN L254 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-03 19:50:39,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:39,045 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-03 19:50:39,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:39,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-09-03 19:50:39,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-03 19:50:39,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-03 19:50:39,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 19:50:39,053 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 34 states. [2019-09-03 19:50:39,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:39,686 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-09-03 19:50:39,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 19:50:39,686 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 40 [2019-09-03 19:50:39,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:39,687 INFO L225 Difference]: With dead ends: 47 [2019-09-03 19:50:39,687 INFO L226 Difference]: Without dead ends: 42 [2019-09-03 19:50:39,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 19:50:39,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-03 19:50:39,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-09-03 19:50:39,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-03 19:50:39,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-09-03 19:50:39,692 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-09-03 19:50:39,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:39,692 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-09-03 19:50:39,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-03 19:50:39,692 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-09-03 19:50:39,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-03 19:50:39,693 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:39,693 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:39,693 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:39,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:39,694 INFO L82 PathProgramCache]: Analyzing trace with hash -626197583, now seen corresponding path program 31 times [2019-09-03 19:50:39,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:39,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:39,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:39,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:39,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:40,313 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-03 19:50:40,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:40,313 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) [2019-09-03 19:50:40,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:40,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:40,369 WARN L254 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-03 19:50:40,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:40,448 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-03 19:50:40,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:40,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-09-03 19:50:40,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-03 19:50:40,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-03 19:50:40,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 19:50:40,455 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 35 states. [2019-09-03 19:50:41,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:41,122 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-09-03 19:50:41,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-03 19:50:41,123 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 41 [2019-09-03 19:50:41,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:41,124 INFO L225 Difference]: With dead ends: 48 [2019-09-03 19:50:41,124 INFO L226 Difference]: Without dead ends: 43 [2019-09-03 19:50:41,125 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 19:50:41,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-03 19:50:41,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-09-03 19:50:41,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-03 19:50:41,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-09-03 19:50:41,128 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-09-03 19:50:41,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:41,128 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-09-03 19:50:41,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-03 19:50:41,128 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-09-03 19:50:41,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-03 19:50:41,129 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:41,129 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:41,129 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:41,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:41,130 INFO L82 PathProgramCache]: Analyzing trace with hash 2099172670, now seen corresponding path program 32 times [2019-09-03 19:50:41,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:41,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:41,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:41,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:41,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:41,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:41,756 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-03 19:50:41,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:41,757 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-03 19:50:41,766 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:50:41,785 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:50:41,786 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:50:41,787 WARN L254 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 67 conjunts are in the unsatisfiable core [2019-09-03 19:50:41,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:41,837 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-03 19:50:41,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:41,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-09-03 19:50:41,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-03 19:50:41,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-03 19:50:41,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 19:50:41,842 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 36 states. [2019-09-03 19:50:42,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:42,541 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-09-03 19:50:42,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 19:50:42,542 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 42 [2019-09-03 19:50:42,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:42,543 INFO L225 Difference]: With dead ends: 49 [2019-09-03 19:50:42,543 INFO L226 Difference]: Without dead ends: 44 [2019-09-03 19:50:42,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 19:50:42,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-03 19:50:42,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-09-03 19:50:42,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-03 19:50:42,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-09-03 19:50:42,547 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-09-03 19:50:42,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:42,547 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-09-03 19:50:42,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-03 19:50:42,547 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-09-03 19:50:42,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-03 19:50:42,548 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:42,548 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:42,548 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:42,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:42,548 INFO L82 PathProgramCache]: Analyzing trace with hash 686304593, now seen corresponding path program 33 times [2019-09-03 19:50:42,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:42,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:42,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:42,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:50:42,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:42,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:43,320 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-03 19:50:43,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:43,321 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) [2019-09-03 19:50:43,348 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:52:38,189 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-03 19:52:38,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:38,549 WARN L254 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 69 conjunts are in the unsatisfiable core [2019-09-03 19:52:38,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:38,601 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-03 19:52:38,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:38,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-09-03 19:52:38,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 19:52:38,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 19:52:38,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 19:52:38,610 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 37 states. [2019-09-03 19:52:39,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:39,366 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-09-03 19:52:39,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-03 19:52:39,367 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 43 [2019-09-03 19:52:39,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:39,368 INFO L225 Difference]: With dead ends: 50 [2019-09-03 19:52:39,368 INFO L226 Difference]: Without dead ends: 45 [2019-09-03 19:52:39,369 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 19:52:39,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-03 19:52:39,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-09-03 19:52:39,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-03 19:52:39,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-09-03 19:52:39,373 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-09-03 19:52:39,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:39,373 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-09-03 19:52:39,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 19:52:39,373 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-09-03 19:52:39,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-03 19:52:39,374 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:39,374 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:39,374 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:39,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:39,374 INFO L82 PathProgramCache]: Analyzing trace with hash -162932834, now seen corresponding path program 34 times [2019-09-03 19:52:39,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:39,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:39,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:39,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:39,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:39,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:40,197 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-03 19:52:40,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:40,197 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-03 19:52:40,207 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:52:40,230 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:52:40,230 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:52:40,231 WARN L254 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-03 19:52:40,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:52:40,272 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-03 19:52:40,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:52:40,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-09-03 19:52:40,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-03 19:52:40,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-03 19:52:40,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 19:52:40,276 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 38 states. [2019-09-03 19:52:41,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:52:41,035 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-09-03 19:52:41,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-03 19:52:41,035 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 44 [2019-09-03 19:52:41,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:52:41,036 INFO L225 Difference]: With dead ends: 51 [2019-09-03 19:52:41,036 INFO L226 Difference]: Without dead ends: 46 [2019-09-03 19:52:41,037 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 19:52:41,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-03 19:52:41,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-09-03 19:52:41,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-03 19:52:41,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-09-03 19:52:41,040 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-09-03 19:52:41,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:52:41,041 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-09-03 19:52:41,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-03 19:52:41,041 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-09-03 19:52:41,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-03 19:52:41,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:52:41,041 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:52:41,042 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:52:41,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:52:41,042 INFO L82 PathProgramCache]: Analyzing trace with hash -719489295, now seen corresponding path program 35 times [2019-09-03 19:52:41,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:52:41,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:52:41,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:41,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:52:41,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:52:41,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:52:41,813 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-03 19:52:41,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:52:41,813 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-03 19:52:41,830 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1