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/reducercommutativity/sum20-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 11:21:30,836 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 11:21:30,838 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 11:21:30,850 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 11:21:30,850 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 11:21:30,851 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 11:21:30,854 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 11:21:30,867 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 11:21:30,868 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 11:21:30,869 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 11:21:30,871 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 11:21:30,872 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 11:21:30,873 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 11:21:30,874 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 11:21:30,875 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 11:21:30,876 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 11:21:30,877 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 11:21:30,878 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 11:21:30,879 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 11:21:30,881 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 11:21:30,882 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 11:21:30,883 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 11:21:30,884 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 11:21:30,885 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 11:21:30,887 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 11:21:30,887 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 11:21:30,888 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 11:21:30,888 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 11:21:30,889 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 11:21:30,890 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 11:21:30,890 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 11:21:30,891 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 11:21:30,891 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 11:21:30,892 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 11:21:30,893 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 11:21:30,893 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 11:21:30,894 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 11:21:30,894 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 11:21:30,894 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 11:21:30,895 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 11:21:30,896 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 11:21:30,897 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 11:21:30,918 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 11:21:30,918 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 11:21:30,920 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 11:21:30,921 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 11:21:30,921 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 11:21:30,922 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 11:21:30,922 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 11:21:30,922 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 11:21:30,922 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 11:21:30,922 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 11:21:30,923 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 11:21:30,923 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 11:21:30,923 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 11:21:30,923 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 11:21:30,924 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 11:21:30,924 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 11:21:30,924 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 11:21:30,925 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 11:21:30,926 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 11:21:30,926 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 11:21:30,926 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 11:21:30,926 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 11:21:30,927 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 11:21:30,927 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 11:21:30,927 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 11:21:30,927 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 11:21:30,927 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 11:21:30,928 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 11:21:30,928 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 11:21:30,983 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 11:21:31,002 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 11:21:31,006 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 11:21:31,007 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 11:21:31,008 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 11:21:31,009 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/sum20-2.i [2019-09-07 11:21:31,081 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c907bd41f/d5893304e2f14a41920b5b2a09d406d6/FLAG787166063 [2019-09-07 11:21:31,563 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 11:21:31,565 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/sum20-2.i [2019-09-07 11:21:31,572 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c907bd41f/d5893304e2f14a41920b5b2a09d406d6/FLAG787166063 [2019-09-07 11:21:31,942 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c907bd41f/d5893304e2f14a41920b5b2a09d406d6 [2019-09-07 11:21:31,951 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 11:21:31,952 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 11:21:31,953 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 11:21:31,953 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 11:21:31,957 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 11:21:31,958 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 11:21:31" (1/1) ... [2019-09-07 11:21:31,961 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eca2f5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:21:31, skipping insertion in model container [2019-09-07 11:21:31,962 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 11:21:31" (1/1) ... [2019-09-07 11:21:31,969 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 11:21:31,993 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 11:21:32,201 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 11:21:32,209 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 11:21:32,232 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 11:21:32,336 INFO L192 MainTranslator]: Completed translation [2019-09-07 11:21:32,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:21:32 WrapperNode [2019-09-07 11:21:32,337 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 11:21:32,337 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 11:21:32,338 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 11:21:32,338 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 11:21:32,352 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:21:32" (1/1) ... [2019-09-07 11:21:32,352 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:21:32" (1/1) ... [2019-09-07 11:21:32,359 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:21:32" (1/1) ... [2019-09-07 11:21:32,360 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:21:32" (1/1) ... [2019-09-07 11:21:32,368 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:21:32" (1/1) ... [2019-09-07 11:21:32,374 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:21:32" (1/1) ... [2019-09-07 11:21:32,375 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:21:32" (1/1) ... [2019-09-07 11:21:32,378 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 11:21:32,378 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 11:21:32,379 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 11:21:32,379 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 11:21:32,380 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:21:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 11:21:32,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 11:21:32,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 11:21:32,440 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2019-09-07 11:21:32,440 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 11:21:32,440 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 11:21:32,440 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 11:21:32,441 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2019-09-07 11:21:32,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-07 11:21:32,441 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 11:21:32,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-07 11:21:32,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-07 11:21:32,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-07 11:21:32,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 11:21:32,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 11:21:32,740 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 11:21:32,740 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-07 11:21:32,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 11:21:32 BoogieIcfgContainer [2019-09-07 11:21:32,742 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 11:21:32,743 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 11:21:32,743 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 11:21:32,746 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 11:21:32,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 11:21:31" (1/3) ... [2019-09-07 11:21:32,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2396b918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 11:21:32, skipping insertion in model container [2019-09-07 11:21:32,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:21:32" (2/3) ... [2019-09-07 11:21:32,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2396b918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 11:21:32, skipping insertion in model container [2019-09-07 11:21:32,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 11:21:32" (3/3) ... [2019-09-07 11:21:32,750 INFO L109 eAbstractionObserver]: Analyzing ICFG sum20-2.i [2019-09-07 11:21:32,764 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 11:21:32,777 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 11:21:32,794 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 11:21:32,826 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 11:21:32,826 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 11:21:32,827 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 11:21:32,827 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 11:21:32,827 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 11:21:32,827 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 11:21:32,827 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 11:21:32,827 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 11:21:32,827 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 11:21:32,847 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-09-07 11:21:32,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-07 11:21:32,853 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:21:32,854 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:21:32,856 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:21:32,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:21:32,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1461178031, now seen corresponding path program 1 times [2019-09-07 11:21:32,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:21:32,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:21:32,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:32,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:21:32,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:21:33,014 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-07 11:21:33,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:21:33,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-07 11:21:33,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-07 11:21:33,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-07 11:21:33,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 11:21:33,037 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2019-09-07 11:21:33,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:21:33,059 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2019-09-07 11:21:33,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-07 11:21:33,060 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2019-09-07 11:21:33,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:21:33,070 INFO L225 Difference]: With dead ends: 54 [2019-09-07 11:21:33,070 INFO L226 Difference]: Without dead ends: 26 [2019-09-07 11:21:33,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 11:21:33,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-07 11:21:33,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-09-07 11:21:33,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-07 11:21:33,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-09-07 11:21:33,116 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 32 [2019-09-07 11:21:33,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:21:33,117 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-09-07 11:21:33,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-07 11:21:33,117 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-09-07 11:21:33,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-07 11:21:33,119 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:21:33,120 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:21:33,120 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:21:33,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:21:33,121 INFO L82 PathProgramCache]: Analyzing trace with hash -595992629, now seen corresponding path program 1 times [2019-09-07 11:21:33,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:21:33,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:21:33,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:33,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:21:33,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:33,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:21:33,191 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-07 11:21:33,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:21:33,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 11:21:33,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 11:21:33,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 11:21:33,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 11:21:33,195 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 3 states. [2019-09-07 11:21:33,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:21:33,226 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2019-09-07 11:21:33,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 11:21:33,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-09-07 11:21:33,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:21:33,228 INFO L225 Difference]: With dead ends: 46 [2019-09-07 11:21:33,228 INFO L226 Difference]: Without dead ends: 28 [2019-09-07 11:21:33,230 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 11:21:33,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-07 11:21:33,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-09-07 11:21:33,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-07 11:21:33,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-09-07 11:21:33,238 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 32 [2019-09-07 11:21:33,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:21:33,238 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-09-07 11:21:33,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 11:21:33,238 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-09-07 11:21:33,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-07 11:21:33,240 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:21:33,240 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:21:33,240 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:21:33,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:21:33,241 INFO L82 PathProgramCache]: Analyzing trace with hash 169606189, now seen corresponding path program 1 times [2019-09-07 11:21:33,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:21:33,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:21:33,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:33,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:21:33,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:33,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:21:33,326 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-07 11:21:33,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:21:33,326 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-07 11:21:33,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:21:33,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:21:33,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-07 11:21:33,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:21:33,479 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-09-07 11:21:33,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 11:21:33,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-09-07 11:21:33,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 11:21:33,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 11:21:33,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 11:21:33,486 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 4 states. [2019-09-07 11:21:33,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:21:33,510 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2019-09-07 11:21:33,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 11:21:33,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-09-07 11:21:33,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:21:33,512 INFO L225 Difference]: With dead ends: 46 [2019-09-07 11:21:33,513 INFO L226 Difference]: Without dead ends: 29 [2019-09-07 11:21:33,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 11:21:33,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-07 11:21:33,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-09-07 11:21:33,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-07 11:21:33,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-09-07 11:21:33,520 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 34 [2019-09-07 11:21:33,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:21:33,520 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-09-07 11:21:33,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 11:21:33,521 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-09-07 11:21:33,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-07 11:21:33,522 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:21:33,522 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:21:33,523 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:21:33,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:21:33,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1462689141, now seen corresponding path program 1 times [2019-09-07 11:21:33,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:21:33,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:21:33,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:33,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:21:33,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:33,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:21:33,611 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-07 11:21:33,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:21:33,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 11:21:33,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 11:21:33,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 11:21:33,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 11:21:33,613 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 3 states. [2019-09-07 11:21:33,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:21:33,628 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2019-09-07 11:21:33,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 11:21:33,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-09-07 11:21:33,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:21:33,630 INFO L225 Difference]: With dead ends: 43 [2019-09-07 11:21:33,630 INFO L226 Difference]: Without dead ends: 30 [2019-09-07 11:21:33,631 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 11:21:33,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-07 11:21:33,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-09-07 11:21:33,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-07 11:21:33,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-09-07 11:21:33,640 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 40 [2019-09-07 11:21:33,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:21:33,643 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-09-07 11:21:33,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 11:21:33,643 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-09-07 11:21:33,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-07 11:21:33,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:21:33,646 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:21:33,646 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:21:33,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:21:33,647 INFO L82 PathProgramCache]: Analyzing trace with hash -233991671, now seen corresponding path program 1 times [2019-09-07 11:21:33,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:21:33,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:21:33,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:33,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:21:33,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:33,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:21:33,759 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-07 11:21:33,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:21:33,760 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-07 11:21:33,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:21:33,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:21:33,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 11:21:33,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:21:33,862 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:21:33,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:21:33,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-07 11:21:33,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 11:21:33,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 11:21:33,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 11:21:33,875 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 5 states. [2019-09-07 11:21:33,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:21:33,904 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2019-09-07 11:21:33,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 11:21:33,905 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-09-07 11:21:33,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:21:33,906 INFO L225 Difference]: With dead ends: 52 [2019-09-07 11:21:33,906 INFO L226 Difference]: Without dead ends: 32 [2019-09-07 11:21:33,907 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 11:21:33,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-07 11:21:33,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-09-07 11:21:33,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-07 11:21:33,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-09-07 11:21:33,913 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 42 [2019-09-07 11:21:33,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:21:33,914 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-09-07 11:21:33,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 11:21:33,914 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-09-07 11:21:33,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-07 11:21:33,915 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:21:33,916 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:21:33,916 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:21:33,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:21:33,916 INFO L82 PathProgramCache]: Analyzing trace with hash 4791275, now seen corresponding path program 2 times [2019-09-07 11:21:33,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:21:33,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:21:33,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:33,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:21:33,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:33,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:21:34,031 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-07 11:21:34,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:21:34,031 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) [2019-09-07 11:21:34,057 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:21:34,096 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:21:34,097 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:21:34,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 11:21:34,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:21:34,131 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-07 11:21:34,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:21:34,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2019-09-07 11:21:34,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 11:21:34,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 11:21:34,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-07 11:21:34,138 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 7 states. [2019-09-07 11:21:34,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:21:34,201 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2019-09-07 11:21:34,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 11:21:34,204 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2019-09-07 11:21:34,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:21:34,205 INFO L225 Difference]: With dead ends: 57 [2019-09-07 11:21:34,205 INFO L226 Difference]: Without dead ends: 37 [2019-09-07 11:21:34,206 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-07 11:21:34,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-07 11:21:34,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2019-09-07 11:21:34,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-07 11:21:34,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-09-07 11:21:34,212 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 44 [2019-09-07 11:21:34,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:21:34,212 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-09-07 11:21:34,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 11:21:34,213 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-09-07 11:21:34,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-07 11:21:34,214 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:21:34,214 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:21:34,214 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:21:34,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:21:34,215 INFO L82 PathProgramCache]: Analyzing trace with hash 602858155, now seen corresponding path program 3 times [2019-09-07 11:21:34,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:21:34,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:21:34,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:34,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:21:34,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:34,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:21:34,291 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-07 11:21:34,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:21:34,292 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:21:34,314 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 11:21:34,347 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-07 11:21:34,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:21:34,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 11:21:34,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:21:34,370 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 34 proven. 1 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-07 11:21:34,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:21:34,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-09-07 11:21:34,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 11:21:34,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 11:21:34,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-07 11:21:34,376 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 7 states. [2019-09-07 11:21:34,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:21:34,440 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2019-09-07 11:21:34,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 11:21:34,441 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-09-07 11:21:34,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:21:34,442 INFO L225 Difference]: With dead ends: 62 [2019-09-07 11:21:34,443 INFO L226 Difference]: Without dead ends: 41 [2019-09-07 11:21:34,447 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-07 11:21:34,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-07 11:21:34,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-09-07 11:21:34,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-07 11:21:34,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-09-07 11:21:34,455 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 52 [2019-09-07 11:21:34,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:21:34,456 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-09-07 11:21:34,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 11:21:34,456 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-09-07 11:21:34,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-07 11:21:34,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:21:34,457 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:21:34,457 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:21:34,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:21:34,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1131907463, now seen corresponding path program 4 times [2019-09-07 11:21:34,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:21:34,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:21:34,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:34,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:21:34,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:34,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:21:34,591 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-09-07 11:21:34,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:21:34,591 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:21:34,607 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:21:34,674 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:21:34,675 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:21:34,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 11:21:34,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:21:34,724 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:21:34,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:21:34,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-07 11:21:34,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 11:21:34,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 11:21:34,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 11:21:34,744 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 7 states. [2019-09-07 11:21:34,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:21:34,807 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2019-09-07 11:21:34,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 11:21:34,807 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2019-09-07 11:21:34,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:21:34,808 INFO L225 Difference]: With dead ends: 68 [2019-09-07 11:21:34,808 INFO L226 Difference]: Without dead ends: 42 [2019-09-07 11:21:34,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 11:21:34,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-07 11:21:34,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-09-07 11:21:34,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-07 11:21:34,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-09-07 11:21:34,824 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 60 [2019-09-07 11:21:34,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:21:34,825 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-09-07 11:21:34,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 11:21:34,826 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-09-07 11:21:34,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-07 11:21:34,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:21:34,828 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:21:34,831 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:21:34,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:21:34,832 INFO L82 PathProgramCache]: Analyzing trace with hash 397221609, now seen corresponding path program 5 times [2019-09-07 11:21:34,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:21:34,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:21:34,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:34,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:21:34,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:34,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:21:34,925 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-07 11:21:34,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:21:34,926 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) [2019-09-07 11:21:34,950 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:21:35,022 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-09-07 11:21:35,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:21:35,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 11:21:35,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:21:35,048 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 52 proven. 9 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-09-07 11:21:35,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:21:35,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-07 11:21:35,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 11:21:35,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 11:21:35,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 11:21:35,062 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 7 states. [2019-09-07 11:21:35,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:21:35,099 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2019-09-07 11:21:35,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 11:21:35,104 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2019-09-07 11:21:35,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:21:35,105 INFO L225 Difference]: With dead ends: 69 [2019-09-07 11:21:35,105 INFO L226 Difference]: Without dead ends: 44 [2019-09-07 11:21:35,106 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 11:21:35,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-07 11:21:35,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-09-07 11:21:35,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-07 11:21:35,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-09-07 11:21:35,123 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 62 [2019-09-07 11:21:35,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:21:35,124 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-09-07 11:21:35,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 11:21:35,124 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-09-07 11:21:35,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-07 11:21:35,126 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:21:35,126 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:21:35,128 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:21:35,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:21:35,129 INFO L82 PathProgramCache]: Analyzing trace with hash 236717639, now seen corresponding path program 6 times [2019-09-07 11:21:35,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:21:35,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:21:35,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:35,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:21:35,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:35,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:21:35,254 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-09-07 11:21:35,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:21:35,255 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) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:21:35,275 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 11:21:35,342 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-07 11:21:35,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:21:35,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 11:21:35,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:21:35,377 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 90 proven. 4 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:21:35,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:21:35,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-07 11:21:35,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 11:21:35,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 11:21:35,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 11:21:35,389 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 6 states. [2019-09-07 11:21:35,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:21:35,419 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2019-09-07 11:21:35,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 11:21:35,421 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-09-07 11:21:35,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:21:35,422 INFO L225 Difference]: With dead ends: 65 [2019-09-07 11:21:35,423 INFO L226 Difference]: Without dead ends: 46 [2019-09-07 11:21:35,423 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 11:21:35,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-07 11:21:35,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-09-07 11:21:35,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-07 11:21:35,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-09-07 11:21:35,433 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 68 [2019-09-07 11:21:35,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:21:35,433 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-09-07 11:21:35,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 11:21:35,434 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-09-07 11:21:35,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-07 11:21:35,438 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:21:35,439 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:21:35,439 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:21:35,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:21:35,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1582231867, now seen corresponding path program 7 times [2019-09-07 11:21:35,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:21:35,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:21:35,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:35,442 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:21:35,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:35,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:21:35,539 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-09-07 11:21:35,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:21:35,540 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:21:35,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:21:35,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:21:35,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 11:21:35,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:21:35,630 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-09-07 11:21:35,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:21:35,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-07 11:21:35,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 11:21:35,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 11:21:35,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-07 11:21:35,637 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 8 states. [2019-09-07 11:21:35,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:21:35,687 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2019-09-07 11:21:35,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 11:21:35,687 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2019-09-07 11:21:35,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:21:35,690 INFO L225 Difference]: With dead ends: 78 [2019-09-07 11:21:35,690 INFO L226 Difference]: Without dead ends: 48 [2019-09-07 11:21:35,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-07 11:21:35,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-07 11:21:35,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-09-07 11:21:35,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-07 11:21:35,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-09-07 11:21:35,703 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 70 [2019-09-07 11:21:35,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:21:35,704 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-09-07 11:21:35,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 11:21:35,704 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-09-07 11:21:35,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-07 11:21:35,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:21:35,706 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 5, 5, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:21:35,706 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:21:35,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:21:35,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1824730713, now seen corresponding path program 8 times [2019-09-07 11:21:35,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:21:35,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:21:35,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:35,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:21:35,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:35,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:21:35,791 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-09-07 11:21:35,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:21:35,791 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:21:35,805 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:21:35,851 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:21:35,852 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:21:35,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 11:21:35,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:21:35,921 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-09-07 11:21:35,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:21:35,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2019-09-07 11:21:35,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 11:21:35,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 11:21:35,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-09-07 11:21:35,931 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 13 states. [2019-09-07 11:21:36,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:21:36,016 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2019-09-07 11:21:36,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 11:21:36,018 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2019-09-07 11:21:36,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:21:36,019 INFO L225 Difference]: With dead ends: 83 [2019-09-07 11:21:36,019 INFO L226 Difference]: Without dead ends: 53 [2019-09-07 11:21:36,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-09-07 11:21:36,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-07 11:21:36,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2019-09-07 11:21:36,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-07 11:21:36,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-09-07 11:21:36,032 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 72 [2019-09-07 11:21:36,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:21:36,032 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-09-07 11:21:36,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 11:21:36,032 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-09-07 11:21:36,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-07 11:21:36,037 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:21:36,037 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:21:36,037 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:21:36,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:21:36,038 INFO L82 PathProgramCache]: Analyzing trace with hash -345746841, now seen corresponding path program 9 times [2019-09-07 11:21:36,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:21:36,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:21:36,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:36,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:21:36,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:36,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:21:36,122 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2019-09-07 11:21:36,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:21:36,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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:21:36,167 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:21:36,222 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-07 11:21:36,222 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:21:36,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 11:21:36,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:21:36,255 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 130 proven. 9 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-09-07 11:21:36,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:21:36,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-07 11:21:36,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 11:21:36,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 11:21:36,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 11:21:36,266 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 7 states. [2019-09-07 11:21:36,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:21:36,297 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2019-09-07 11:21:36,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 11:21:36,298 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 80 [2019-09-07 11:21:36,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:21:36,299 INFO L225 Difference]: With dead ends: 75 [2019-09-07 11:21:36,299 INFO L226 Difference]: Without dead ends: 54 [2019-09-07 11:21:36,300 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 11:21:36,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-07 11:21:36,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-09-07 11:21:36,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-07 11:21:36,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-09-07 11:21:36,310 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 80 [2019-09-07 11:21:36,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:21:36,310 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-09-07 11:21:36,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 11:21:36,311 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-09-07 11:21:36,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-07 11:21:36,311 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:21:36,312 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 6, 6, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:21:36,312 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:21:36,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:21:36,312 INFO L82 PathProgramCache]: Analyzing trace with hash 180247269, now seen corresponding path program 10 times [2019-09-07 11:21:36,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:21:36,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:21:36,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:36,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:21:36,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:36,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:21:36,405 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-07 11:21:36,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:21:36,406 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:21:36,428 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:21:36,484 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:21:36,485 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:21:36,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 11:21:36,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:21:36,506 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 128 proven. 25 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-07 11:21:36,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:21:36,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-07 11:21:36,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 11:21:36,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 11:21:36,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-07 11:21:36,515 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 9 states. [2019-09-07 11:21:36,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:21:36,558 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2019-09-07 11:21:36,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 11:21:36,559 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-09-07 11:21:36,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:21:36,559 INFO L225 Difference]: With dead ends: 89 [2019-09-07 11:21:36,560 INFO L226 Difference]: Without dead ends: 56 [2019-09-07 11:21:36,560 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-07 11:21:36,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-07 11:21:36,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-09-07 11:21:36,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-07 11:21:36,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-09-07 11:21:36,571 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 82 [2019-09-07 11:21:36,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:21:36,575 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-09-07 11:21:36,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 11:21:36,576 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-09-07 11:21:36,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-07 11:21:36,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:21:36,577 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 6, 6, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:21:36,577 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:21:36,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:21:36,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1497902269, now seen corresponding path program 11 times [2019-09-07 11:21:36,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:21:36,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:21:36,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:36,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:21:36,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:36,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:21:36,651 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2019-09-07 11:21:36,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:21:36,652 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:21:36,670 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 11:21:36,831 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2019-09-07 11:21:36,831 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:21:36,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 11:21:36,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:21:36,916 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 172 proven. 36 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2019-09-07 11:21:36,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:21:36,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2019-09-07 11:21:36,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 11:21:36,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 11:21:36,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-09-07 11:21:36,922 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 14 states. [2019-09-07 11:21:36,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:21:36,989 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2019-09-07 11:21:36,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 11:21:36,991 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 88 [2019-09-07 11:21:36,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:21:36,992 INFO L225 Difference]: With dead ends: 96 [2019-09-07 11:21:36,992 INFO L226 Difference]: Without dead ends: 61 [2019-09-07 11:21:36,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-09-07 11:21:36,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-07 11:21:37,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-09-07 11:21:37,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-07 11:21:37,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-09-07 11:21:37,004 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 88 [2019-09-07 11:21:37,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:21:37,005 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-09-07 11:21:37,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 11:21:37,005 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-09-07 11:21:37,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-07 11:21:37,008 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:21:37,008 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 6, 6, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:21:37,008 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:21:37,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:21:37,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1395924767, now seen corresponding path program 12 times [2019-09-07 11:21:37,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:21:37,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:21:37,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:37,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:21:37,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:37,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:21:37,138 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2019-09-07 11:21:37,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:21:37,139 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) [2019-09-07 11:21:37,160 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:21:37,315 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-07 11:21:37,316 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:21:37,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 11:21:37,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:21:37,381 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 234 proven. 25 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-09-07 11:21:37,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:21:37,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-09-07 11:21:37,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 11:21:37,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 11:21:37,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-09-07 11:21:37,391 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 15 states. [2019-09-07 11:21:37,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:21:37,466 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2019-09-07 11:21:37,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 11:21:37,466 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 96 [2019-09-07 11:21:37,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:21:37,467 INFO L225 Difference]: With dead ends: 105 [2019-09-07 11:21:37,468 INFO L226 Difference]: Without dead ends: 65 [2019-09-07 11:21:37,468 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-09-07 11:21:37,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-07 11:21:37,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2019-09-07 11:21:37,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-07 11:21:37,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-09-07 11:21:37,474 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 96 [2019-09-07 11:21:37,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:21:37,474 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-09-07 11:21:37,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 11:21:37,474 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-09-07 11:21:37,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-07 11:21:37,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:21:37,476 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 7, 7, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:21:37,476 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:21:37,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:21:37,476 INFO L82 PathProgramCache]: Analyzing trace with hash 51602815, now seen corresponding path program 13 times [2019-09-07 11:21:37,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:21:37,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:21:37,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:37,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:21:37,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:37,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:21:37,571 INFO L134 CoverageAnalysis]: Checked inductivity of 583 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-09-07 11:21:37,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:21:37,572 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) [2019-09-07 11:21:37,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:21:37,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:21:37,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 11:21:37,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:21:37,667 INFO L134 CoverageAnalysis]: Checked inductivity of 583 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-09-07 11:21:37,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:21:37,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-07 11:21:37,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 11:21:37,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 11:21:37,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 11:21:37,672 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 11 states. [2019-09-07 11:21:37,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:21:37,704 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2019-09-07 11:21:37,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 11:21:37,706 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 100 [2019-09-07 11:21:37,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:21:37,707 INFO L225 Difference]: With dead ends: 108 [2019-09-07 11:21:37,707 INFO L226 Difference]: Without dead ends: 66 [2019-09-07 11:21:37,708 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 11:21:37,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-07 11:21:37,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-09-07 11:21:37,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-07 11:21:37,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-09-07 11:21:37,713 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 100 [2019-09-07 11:21:37,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:21:37,713 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-09-07 11:21:37,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 11:21:37,713 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-09-07 11:21:37,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-07 11:21:37,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:21:37,714 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 8, 8, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:21:37,715 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:21:37,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:21:37,715 INFO L82 PathProgramCache]: Analyzing trace with hash -861900575, now seen corresponding path program 14 times [2019-09-07 11:21:37,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:21:37,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:21:37,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:37,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:21:37,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:21:37,815 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 0 proven. 281 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2019-09-07 11:21:37,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:21:37,815 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:21:37,837 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:21:37,898 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:21:37,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:21:37,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 11:21:37,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:21:38,082 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-09-07 11:21:38,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:21:38,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2019-09-07 11:21:38,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 11:21:38,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 11:21:38,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-09-07 11:21:38,094 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 19 states. [2019-09-07 11:21:38,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:21:38,192 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2019-09-07 11:21:38,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 11:21:38,193 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 102 [2019-09-07 11:21:38,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:21:38,194 INFO L225 Difference]: With dead ends: 113 [2019-09-07 11:21:38,194 INFO L226 Difference]: Without dead ends: 71 [2019-09-07 11:21:38,194 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-09-07 11:21:38,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-07 11:21:38,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2019-09-07 11:21:38,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-07 11:21:38,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-09-07 11:21:38,199 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 102 [2019-09-07 11:21:38,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:21:38,200 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-09-07 11:21:38,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 11:21:38,200 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-09-07 11:21:38,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-07 11:21:38,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:21:38,201 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 9, 9, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:21:38,202 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:21:38,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:21:38,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1202945119, now seen corresponding path program 15 times [2019-09-07 11:21:38,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:21:38,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:21:38,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:38,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:21:38,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:38,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:21:38,303 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 720 trivial. 0 not checked. [2019-09-07 11:21:38,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:21:38,304 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:21:38,333 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:21:38,438 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-07 11:21:38,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:21:38,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 11:21:38,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:21:38,460 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 298 proven. 36 refuted. 0 times theorem prover too weak. 422 trivial. 0 not checked. [2019-09-07 11:21:38,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:21:38,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-07 11:21:38,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 11:21:38,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 11:21:38,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-07 11:21:38,467 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 10 states. [2019-09-07 11:21:38,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:21:38,500 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2019-09-07 11:21:38,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 11:21:38,500 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 110 [2019-09-07 11:21:38,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:21:38,501 INFO L225 Difference]: With dead ends: 99 [2019-09-07 11:21:38,502 INFO L226 Difference]: Without dead ends: 72 [2019-09-07 11:21:38,502 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-07 11:21:38,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-07 11:21:38,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-09-07 11:21:38,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-07 11:21:38,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2019-09-07 11:21:38,507 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 110 [2019-09-07 11:21:38,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:21:38,507 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2019-09-07 11:21:38,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 11:21:38,508 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2019-09-07 11:21:38,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-07 11:21:38,509 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:21:38,509 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 9, 9, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:21:38,509 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:21:38,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:21:38,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1345733217, now seen corresponding path program 16 times [2019-09-07 11:21:38,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:21:38,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:21:38,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:38,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:21:38,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:38,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:21:38,627 INFO L134 CoverageAnalysis]: Checked inductivity of 769 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 409 trivial. 0 not checked. [2019-09-07 11:21:38,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:21:38,627 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) [2019-09-07 11:21:38,647 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:21:38,713 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:21:38,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:21:38,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 11:21:38,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:21:38,924 INFO L134 CoverageAnalysis]: Checked inductivity of 769 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2019-09-07 11:21:38,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:21:38,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2019-09-07 11:21:38,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 11:21:38,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 11:21:38,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-09-07 11:21:38,931 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 21 states. [2019-09-07 11:21:39,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:21:39,025 INFO L93 Difference]: Finished difference Result 123 states and 135 transitions. [2019-09-07 11:21:39,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 11:21:39,026 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 112 [2019-09-07 11:21:39,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:21:39,027 INFO L225 Difference]: With dead ends: 123 [2019-09-07 11:21:39,027 INFO L226 Difference]: Without dead ends: 77 [2019-09-07 11:21:39,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-09-07 11:21:39,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-09-07 11:21:39,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2019-09-07 11:21:39,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-07 11:21:39,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2019-09-07 11:21:39,031 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 112 [2019-09-07 11:21:39,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:21:39,032 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2019-09-07 11:21:39,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 11:21:39,032 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2019-09-07 11:21:39,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-07 11:21:39,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:21:39,033 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 10, 10, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:21:39,034 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:21:39,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:21:39,034 INFO L82 PathProgramCache]: Analyzing trace with hash -154970529, now seen corresponding path program 17 times [2019-09-07 11:21:39,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:21:39,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:21:39,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:39,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:21:39,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:39,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:21:39,153 INFO L134 CoverageAnalysis]: Checked inductivity of 947 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 898 trivial. 0 not checked. [2019-09-07 11:21:39,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:21:39,153 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:21:39,183 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:21:40,266 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2019-09-07 11:21:40,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:21:40,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 11:21:40,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:21:40,443 INFO L134 CoverageAnalysis]: Checked inductivity of 947 backedges. 364 proven. 81 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (19)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:21:40,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:21:40,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2019-09-07 11:21:40,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 11:21:40,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 11:21:40,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2019-09-07 11:21:40,451 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 20 states. [2019-09-07 11:21:40,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:21:40,539 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2019-09-07 11:21:40,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 11:21:40,540 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 120 [2019-09-07 11:21:40,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:21:40,541 INFO L225 Difference]: With dead ends: 128 [2019-09-07 11:21:40,541 INFO L226 Difference]: Without dead ends: 81 [2019-09-07 11:21:40,542 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2019-09-07 11:21:40,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-09-07 11:21:40,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2019-09-07 11:21:40,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-07 11:21:40,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2019-09-07 11:21:40,548 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 120 [2019-09-07 11:21:40,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:21:40,548 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2019-09-07 11:21:40,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 11:21:40,548 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2019-09-07 11:21:40,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-07 11:21:40,549 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:21:40,550 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 10, 10, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:21:40,550 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:21:40,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:21:40,550 INFO L82 PathProgramCache]: Analyzing trace with hash 313490235, now seen corresponding path program 18 times [2019-09-07 11:21:40,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:21:40,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:21:40,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:40,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:21:40,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:40,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:21:40,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 1075 trivial. 0 not checked. [2019-09-07 11:21:40,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:21:40,668 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 11:21:40,683 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 11:21:40,963 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-07 11:21:40,964 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:21:40,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 11:21:40,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:21:41,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 450 proven. 64 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (20)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:21:41,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:21:41,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-09-07 11:21:41,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 11:21:41,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 11:21:41,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-07 11:21:41,041 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 12 states. [2019-09-07 11:21:41,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:21:41,086 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2019-09-07 11:21:41,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 11:21:41,088 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 128 [2019-09-07 11:21:41,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:21:41,089 INFO L225 Difference]: With dead ends: 113 [2019-09-07 11:21:41,089 INFO L226 Difference]: Without dead ends: 82 [2019-09-07 11:21:41,089 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-07 11:21:41,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-07 11:21:41,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-09-07 11:21:41,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-07 11:21:41,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2019-09-07 11:21:41,095 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 128 [2019-09-07 11:21:41,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:21:41,096 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2019-09-07 11:21:41,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 11:21:41,096 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2019-09-07 11:21:41,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-07 11:21:41,097 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:21:41,097 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 10, 10, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:21:41,097 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:21:41,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:21:41,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1422542521, now seen corresponding path program 19 times [2019-09-07 11:21:41,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:21:41,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:21:41,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:41,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:21:41,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:21:41,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-09-07 11:21:41,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:21:41,306 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:21:41,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:21:41,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:21:41,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 11:21:41,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:21:41,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (21)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:21:41,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:21:41,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-07 11:21:41,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 11:21:41,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 11:21:41,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-07 11:21:41,441 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 14 states. [2019-09-07 11:21:41,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:21:41,481 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2019-09-07 11:21:41,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 11:21:41,482 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 130 [2019-09-07 11:21:41,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:21:41,483 INFO L225 Difference]: With dead ends: 138 [2019-09-07 11:21:41,483 INFO L226 Difference]: Without dead ends: 84 [2019-09-07 11:21:41,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-07 11:21:41,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-09-07 11:21:41,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2019-09-07 11:21:41,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-07 11:21:41,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2019-09-07 11:21:41,488 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 130 [2019-09-07 11:21:41,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:21:41,488 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2019-09-07 11:21:41,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 11:21:41,488 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2019-09-07 11:21:41,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-07 11:21:41,490 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:21:41,490 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 11, 11, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:21:41,490 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:21:41,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:21:41,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1420903781, now seen corresponding path program 20 times [2019-09-07 11:21:41,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:21:41,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:21:41,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:41,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:21:41,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:41,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:21:41,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1177 backedges. 0 proven. 548 refuted. 0 times theorem prover too weak. 629 trivial. 0 not checked. [2019-09-07 11:21:41,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:21:41,620 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-07 11:21:41,630 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:21:41,703 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:21:41,704 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:21:41,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 11:21:41,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:21:41,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1177 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-09-07 11:21:41,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:21:41,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2019-09-07 11:21:41,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-07 11:21:41,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-07 11:21:41,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-09-07 11:21:41,876 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 25 states. [2019-09-07 11:21:41,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:21:41,982 INFO L93 Difference]: Finished difference Result 143 states and 155 transitions. [2019-09-07 11:21:41,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 11:21:41,983 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 132 [2019-09-07 11:21:41,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:21:41,984 INFO L225 Difference]: With dead ends: 143 [2019-09-07 11:21:41,984 INFO L226 Difference]: Without dead ends: 89 [2019-09-07 11:21:41,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-09-07 11:21:41,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-09-07 11:21:41,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2019-09-07 11:21:41,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-07 11:21:41,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2019-09-07 11:21:41,989 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 132 [2019-09-07 11:21:41,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:21:41,990 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2019-09-07 11:21:41,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-07 11:21:41,990 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2019-09-07 11:21:41,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-07 11:21:41,991 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:21:41,992 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 12, 12, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:21:41,992 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:21:41,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:21:41,992 INFO L82 PathProgramCache]: Analyzing trace with hash -770351269, now seen corresponding path program 21 times [2019-09-07 11:21:41,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:21:41,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:21:41,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:41,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:21:41,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:42,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:21:42,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 1314 trivial. 0 not checked. [2019-09-07 11:21:42,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:21:42,175 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:21:42,194 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:21:42,388 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-07 11:21:42,389 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:21:42,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 11:21:42,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:21:42,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 538 proven. 81 refuted. 0 times theorem prover too weak. 776 trivial. 0 not checked. [2019-09-07 11:21:42,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:21:42,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-07 11:21:42,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 11:21:42,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 11:21:42,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-07 11:21:42,444 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 13 states. [2019-09-07 11:21:42,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:21:42,485 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2019-09-07 11:21:42,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 11:21:42,486 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 140 [2019-09-07 11:21:42,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:21:42,487 INFO L225 Difference]: With dead ends: 123 [2019-09-07 11:21:42,487 INFO L226 Difference]: Without dead ends: 90 [2019-09-07 11:21:42,487 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-07 11:21:42,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-07 11:21:42,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-09-07 11:21:42,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-09-07 11:21:42,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2019-09-07 11:21:42,498 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 140 [2019-09-07 11:21:42,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:21:42,498 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2019-09-07 11:21:42,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 11:21:42,498 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2019-09-07 11:21:42,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-07 11:21:42,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:21:42,499 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 12, 12, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:21:42,500 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:21:42,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:21:42,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1742940889, now seen corresponding path program 22 times [2019-09-07 11:21:42,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:21:42,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:21:42,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:42,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:21:42,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:42,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:21:42,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1414 backedges. 0 proven. 657 refuted. 0 times theorem prover too weak. 757 trivial. 0 not checked. [2019-09-07 11:21:42,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:21:42,691 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:21:42,701 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 11:21:42,776 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:21:42,776 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:21:42,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 11:21:42,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:21:42,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1414 backedges. 536 proven. 121 refuted. 0 times theorem prover too weak. 757 trivial. 0 not checked. [2019-09-07 11:21:42,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:21:42,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-09-07 11:21:42,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 11:21:42,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 11:21:42,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-07 11:21:42,816 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 15 states. [2019-09-07 11:21:42,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:21:42,868 INFO L93 Difference]: Finished difference Result 149 states and 159 transitions. [2019-09-07 11:21:42,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 11:21:42,869 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 142 [2019-09-07 11:21:42,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:21:42,870 INFO L225 Difference]: With dead ends: 149 [2019-09-07 11:21:42,870 INFO L226 Difference]: Without dead ends: 92 [2019-09-07 11:21:42,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-07 11:21:42,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-09-07 11:21:42,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2019-09-07 11:21:42,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-07 11:21:42,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2019-09-07 11:21:42,876 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 142 [2019-09-07 11:21:42,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:21:42,876 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2019-09-07 11:21:42,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 11:21:42,876 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2019-09-07 11:21:42,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-07 11:21:42,877 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:21:42,877 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 12, 12, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:21:42,877 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:21:42,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:21:42,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1856940489, now seen corresponding path program 23 times [2019-09-07 11:21:42,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:21:42,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:21:42,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:42,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:21:42,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:42,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:21:43,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1627 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 1527 trivial. 0 not checked. [2019-09-07 11:21:43,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:21:43,018 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:21:43,029 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 11:21:44,980 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2019-09-07 11:21:44,980 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:21:44,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 11:21:44,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:21:45,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1627 backedges. 628 proven. 144 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2019-09-07 11:21:45,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:21:45,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 26 [2019-09-07 11:21:45,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-07 11:21:45,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-07 11:21:45,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2019-09-07 11:21:45,264 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand 26 states. [2019-09-07 11:21:45,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:21:45,350 INFO L93 Difference]: Finished difference Result 156 states and 167 transitions. [2019-09-07 11:21:45,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-07 11:21:45,350 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 148 [2019-09-07 11:21:45,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:21:45,351 INFO L225 Difference]: With dead ends: 156 [2019-09-07 11:21:45,351 INFO L226 Difference]: Without dead ends: 97 [2019-09-07 11:21:45,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2019-09-07 11:21:45,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-09-07 11:21:45,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2019-09-07 11:21:45,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-07 11:21:45,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2019-09-07 11:21:45,358 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 148 [2019-09-07 11:21:45,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:21:45,358 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2019-09-07 11:21:45,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-07 11:21:45,358 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2019-09-07 11:21:45,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-07 11:21:45,361 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:21:45,361 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 12, 12, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:21:45,361 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:21:45,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:21:45,362 INFO L82 PathProgramCache]: Analyzing trace with hash 277518355, now seen corresponding path program 24 times [2019-09-07 11:21:45,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:21:45,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:21:45,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:45,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:21:45,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:45,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:21:45,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1879 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 1735 trivial. 0 not checked. [2019-09-07 11:21:45,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:21:45,548 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) [2019-09-07 11:21:45,561 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:21:46,027 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-09-07 11:21:46,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:21:46,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 11:21:46,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:21:46,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1879 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 1735 trivial. 0 not checked. [2019-09-07 11:21:46,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:21:46,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-07 11:21:46,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 11:21:46,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 11:21:46,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 11:21:46,064 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 16 states. [2019-09-07 11:21:46,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:21:46,125 INFO L93 Difference]: Finished difference Result 162 states and 170 transitions. [2019-09-07 11:21:46,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 11:21:46,127 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 156 [2019-09-07 11:21:46,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:21:46,128 INFO L225 Difference]: With dead ends: 162 [2019-09-07 11:21:46,128 INFO L226 Difference]: Without dead ends: 98 [2019-09-07 11:21:46,129 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 11:21:46,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-09-07 11:21:46,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-09-07 11:21:46,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-09-07 11:21:46,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2019-09-07 11:21:46,134 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 156 [2019-09-07 11:21:46,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:21:46,134 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2019-09-07 11:21:46,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 11:21:46,135 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2019-09-07 11:21:46,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-07 11:21:46,137 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:21:46,137 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 13, 13, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:21:46,137 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:21:46,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:21:46,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1910106763, now seen corresponding path program 25 times [2019-09-07 11:21:46,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:21:46,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:21:46,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:46,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:21:46,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:46,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:21:46,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1904 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 1783 trivial. 0 not checked. [2019-09-07 11:21:46,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:21:46,301 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:21:46,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:21:46,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:21:46,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 11:21:46,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:21:46,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1904 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 1735 trivial. 0 not checked. [2019-09-07 11:21:46,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:21:46,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 28 [2019-09-07 11:21:46,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-07 11:21:46,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-07 11:21:46,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2019-09-07 11:21:46,613 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand 28 states. [2019-09-07 11:21:46,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:21:46,745 INFO L93 Difference]: Finished difference Result 167 states and 176 transitions. [2019-09-07 11:21:46,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-07 11:21:46,745 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 158 [2019-09-07 11:21:46,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:21:46,746 INFO L225 Difference]: With dead ends: 167 [2019-09-07 11:21:46,746 INFO L226 Difference]: Without dead ends: 103 [2019-09-07 11:21:46,747 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2019-09-07 11:21:46,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-09-07 11:21:46,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2019-09-07 11:21:46,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-09-07 11:21:46,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2019-09-07 11:21:46,758 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 158 [2019-09-07 11:21:46,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:21:46,759 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2019-09-07 11:21:46,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-07 11:21:46,759 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2019-09-07 11:21:46,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-07 11:21:46,760 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:21:46,760 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 14, 14, 12, 12, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:21:46,760 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:21:46,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:21:46,760 INFO L82 PathProgramCache]: Analyzing trace with hash -351678763, now seen corresponding path program 26 times [2019-09-07 11:21:46,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:21:46,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:21:46,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:46,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:21:46,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:46,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:21:46,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1954 backedges. 0 proven. 905 refuted. 0 times theorem prover too weak. 1049 trivial. 0 not checked. [2019-09-07 11:21:46,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:21:46,945 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:21:46,956 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:21:47,031 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:21:47,032 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:21:47,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 11:21:47,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:21:47,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1954 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 1758 trivial. 0 not checked. [2019-09-07 11:21:47,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:21:47,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 31 [2019-09-07 11:21:47,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-07 11:21:47,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-07 11:21:47,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2019-09-07 11:21:47,258 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand 31 states. [2019-09-07 11:21:47,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:21:47,408 INFO L93 Difference]: Finished difference Result 173 states and 185 transitions. [2019-09-07 11:21:47,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-07 11:21:47,409 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 162 [2019-09-07 11:21:47,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:21:47,410 INFO L225 Difference]: With dead ends: 173 [2019-09-07 11:21:47,410 INFO L226 Difference]: Without dead ends: 107 [2019-09-07 11:21:47,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2019-09-07 11:21:47,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-09-07 11:21:47,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2019-09-07 11:21:47,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-09-07 11:21:47,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2019-09-07 11:21:47,417 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 162 [2019-09-07 11:21:47,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:21:47,417 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2019-09-07 11:21:47,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-07 11:21:47,417 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2019-09-07 11:21:47,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-07 11:21:47,418 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:21:47,419 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 15, 15, 12, 12, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:21:47,419 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:21:47,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:21:47,420 INFO L82 PathProgramCache]: Analyzing trace with hash -712964715, now seen corresponding path program 27 times [2019-09-07 11:21:47,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:21:47,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:21:47,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:47,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:21:47,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:47,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:21:47,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2232 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 2088 trivial. 0 not checked. [2019-09-07 11:21:47,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:21:47,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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:21:47,661 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 11:21:48,495 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-09-07 11:21:48,496 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:21:48,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 11:21:48,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:21:48,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2232 backedges. 850 proven. 144 refuted. 0 times theorem prover too weak. 1238 trivial. 0 not checked. [2019-09-07 11:21:48,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:21:48,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-07 11:21:48,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 11:21:48,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 11:21:48,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 11:21:48,531 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 16 states. [2019-09-07 11:21:48,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:21:48,589 INFO L93 Difference]: Finished difference Result 147 states and 152 transitions. [2019-09-07 11:21:48,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 11:21:48,590 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 170 [2019-09-07 11:21:48,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:21:48,591 INFO L225 Difference]: With dead ends: 147 [2019-09-07 11:21:48,592 INFO L226 Difference]: Without dead ends: 108 [2019-09-07 11:21:48,593 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 11:21:48,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-09-07 11:21:48,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-09-07 11:21:48,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-09-07 11:21:48,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2019-09-07 11:21:48,599 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 170 [2019-09-07 11:21:48,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:21:48,599 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2019-09-07 11:21:48,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 11:21:48,599 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2019-09-07 11:21:48,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-07 11:21:48,600 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:21:48,601 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 15, 15, 13, 13, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:21:48,601 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:21:48,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:21:48,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1388002669, now seen corresponding path program 28 times [2019-09-07 11:21:48,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:21:48,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:21:48,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:48,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:21:48,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:48,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:21:48,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2257 backedges. 0 proven. 1044 refuted. 0 times theorem prover too weak. 1213 trivial. 0 not checked. [2019-09-07 11:21:48,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:21:48,804 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-07 11:21:48,815 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 11:21:48,898 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:21:48,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:21:48,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 11:21:48,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:21:49,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2257 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 2032 trivial. 0 not checked. [2019-09-07 11:21:49,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:21:49,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 33 [2019-09-07 11:21:49,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-07 11:21:49,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-07 11:21:49,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 11:21:49,185 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 33 states. [2019-09-07 11:21:49,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:21:49,282 INFO L93 Difference]: Finished difference Result 183 states and 195 transitions. [2019-09-07 11:21:49,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-07 11:21:49,283 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 172 [2019-09-07 11:21:49,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:21:49,284 INFO L225 Difference]: With dead ends: 183 [2019-09-07 11:21:49,284 INFO L226 Difference]: Without dead ends: 113 [2019-09-07 11:21:49,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 11:21:49,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-09-07 11:21:49,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2019-09-07 11:21:49,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-09-07 11:21:49,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2019-09-07 11:21:49,295 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 172 [2019-09-07 11:21:49,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:21:49,296 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2019-09-07 11:21:49,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-07 11:21:49,296 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2019-09-07 11:21:49,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-07 11:21:49,297 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:21:49,298 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 16, 16, 13, 13, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:21:49,298 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:21:49,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:21:49,298 INFO L82 PathProgramCache]: Analyzing trace with hash 476938067, now seen corresponding path program 29 times [2019-09-07 11:21:49,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:21:49,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:21:49,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:49,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:21:49,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:49,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:21:49,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2555 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 2386 trivial. 0 not checked. [2019-09-07 11:21:49,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:21:49,528 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:21:49,545 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 11:21:53,655 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2019-09-07 11:21:53,655 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:21:53,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 11:21:53,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:21:53,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2555 backedges. 964 proven. 225 refuted. 0 times theorem prover too weak. 1366 trivial. 0 not checked. [2019-09-07 11:21:53,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:21:53,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 32 [2019-09-07 11:21:53,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-07 11:21:53,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-07 11:21:53,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=720, Unknown=0, NotChecked=0, Total=992 [2019-09-07 11:21:53,900 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand 32 states. [2019-09-07 11:21:54,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:21:54,050 INFO L93 Difference]: Finished difference Result 188 states and 199 transitions. [2019-09-07 11:21:54,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-07 11:21:54,053 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 180 [2019-09-07 11:21:54,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:21:54,055 INFO L225 Difference]: With dead ends: 188 [2019-09-07 11:21:54,055 INFO L226 Difference]: Without dead ends: 117 [2019-09-07 11:21:54,056 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=272, Invalid=720, Unknown=0, NotChecked=0, Total=992 [2019-09-07 11:21:54,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-09-07 11:21:54,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2019-09-07 11:21:54,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-09-07 11:21:54,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 119 transitions. [2019-09-07 11:21:54,063 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 119 transitions. Word has length 180 [2019-09-07 11:21:54,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:21:54,064 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 119 transitions. [2019-09-07 11:21:54,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-07 11:21:54,064 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2019-09-07 11:21:54,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-07 11:21:54,065 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:21:54,065 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 16, 16, 14, 14, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:21:54,066 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:21:54,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:21:54,066 INFO L82 PathProgramCache]: Analyzing trace with hash 416291375, now seen corresponding path program 30 times [2019-09-07 11:21:54,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:21:54,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:21:54,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:54,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:21:54,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:54,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:21:54,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2867 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 2671 trivial. 0 not checked. [2019-09-07 11:21:54,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:21:54,293 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-07 11:21:54,310 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:21:55,513 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-09-07 11:21:55,513 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:21:55,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-07 11:21:55,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:21:55,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2867 backedges. 1098 proven. 196 refuted. 0 times theorem prover too weak. 1573 trivial. 0 not checked. [2019-09-07 11:21:55,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:21:55,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-09-07 11:21:55,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-07 11:21:55,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-07 11:21:55,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-07 11:21:55,554 INFO L87 Difference]: Start difference. First operand 115 states and 119 transitions. Second operand 18 states. [2019-09-07 11:21:55,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:21:55,613 INFO L93 Difference]: Finished difference Result 161 states and 166 transitions. [2019-09-07 11:21:55,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 11:21:55,613 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 188 [2019-09-07 11:21:55,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:21:55,614 INFO L225 Difference]: With dead ends: 161 [2019-09-07 11:21:55,614 INFO L226 Difference]: Without dead ends: 118 [2019-09-07 11:21:55,614 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-07 11:21:55,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-07 11:21:55,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-09-07 11:21:55,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-09-07 11:21:55,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 121 transitions. [2019-09-07 11:21:55,618 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 121 transitions. Word has length 188 [2019-09-07 11:21:55,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:21:55,619 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 121 transitions. [2019-09-07 11:21:55,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-07 11:21:55,619 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2019-09-07 11:21:55,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-07 11:21:55,620 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:21:55,620 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 16, 16, 15, 15, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:21:55,620 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:21:55,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:21:55,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1920587603, now seen corresponding path program 31 times [2019-09-07 11:21:55,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:21:55,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:21:55,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:55,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:21:55,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:55,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:21:55,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2896 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2019-09-07 11:21:55,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:21:55,872 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) [2019-09-07 11:21:55,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:21:55,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:21:55,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 11:21:55,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:21:56,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2896 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2019-09-07 11:21:56,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:21:56,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-09-07 11:21:56,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 11:21:56,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 11:21:56,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-07 11:21:56,009 INFO L87 Difference]: Start difference. First operand 117 states and 121 transitions. Second operand 20 states. [2019-09-07 11:21:56,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:21:56,081 INFO L93 Difference]: Finished difference Result 198 states and 206 transitions. [2019-09-07 11:21:56,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 11:21:56,081 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 190 [2019-09-07 11:21:56,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:21:56,082 INFO L225 Difference]: With dead ends: 198 [2019-09-07 11:21:56,082 INFO L226 Difference]: Without dead ends: 120 [2019-09-07 11:21:56,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-07 11:21:56,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-09-07 11:21:56,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2019-09-07 11:21:56,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-09-07 11:21:56,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2019-09-07 11:21:56,089 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 190 [2019-09-07 11:21:56,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:21:56,089 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2019-09-07 11:21:56,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 11:21:56,089 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2019-09-07 11:21:56,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-07 11:21:56,090 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:21:56,091 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 17, 17, 15, 15, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:21:56,091 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:21:56,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:21:56,091 INFO L82 PathProgramCache]: Analyzing trace with hash 419155343, now seen corresponding path program 32 times [2019-09-07 11:21:56,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:21:56,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:21:56,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:56,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:21:56,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:56,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:21:56,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2929 backedges. 0 proven. 1352 refuted. 0 times theorem prover too weak. 1577 trivial. 0 not checked. [2019-09-07 11:21:56,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:21:56,322 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:21:56,335 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:21:56,423 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:21:56,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:21:56,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 11:21:56,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:21:56,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2929 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2019-09-07 11:21:56,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:21:56,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 37 [2019-09-07 11:21:56,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-07 11:21:56,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-07 11:21:56,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 11:21:56,778 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand 37 states. [2019-09-07 11:21:56,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:21:56,942 INFO L93 Difference]: Finished difference Result 203 states and 215 transitions. [2019-09-07 11:21:56,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-07 11:21:56,945 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 192 [2019-09-07 11:21:56,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:21:56,946 INFO L225 Difference]: With dead ends: 203 [2019-09-07 11:21:56,947 INFO L226 Difference]: Without dead ends: 125 [2019-09-07 11:21:56,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 11:21:56,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-09-07 11:21:56,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2019-09-07 11:21:56,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-09-07 11:21:56,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 127 transitions. [2019-09-07 11:21:56,952 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 127 transitions. Word has length 192 [2019-09-07 11:21:56,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:21:56,953 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 127 transitions. [2019-09-07 11:21:56,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-07 11:21:56,953 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2019-09-07 11:21:56,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-07 11:21:56,960 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:21:56,960 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 18, 18, 15, 15, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:21:56,960 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:21:56,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:21:56,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1598450097, now seen corresponding path program 33 times [2019-09-07 11:21:56,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:21:56,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:21:56,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:56,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:21:56,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:56,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:21:57,188 INFO L134 CoverageAnalysis]: Checked inductivity of 3267 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 3042 trivial. 0 not checked. [2019-09-07 11:21:57,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:21:57,188 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) [2019-09-07 11:21:57,209 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:21:59,049 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-09-07 11:21:59,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:21:59,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 11:21:59,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:21:59,087 INFO L134 CoverageAnalysis]: Checked inductivity of 3267 backedges. 1234 proven. 225 refuted. 0 times theorem prover too weak. 1808 trivial. 0 not checked. [2019-09-07 11:21:59,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:21:59,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-09-07 11:21:59,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 11:21:59,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 11:21:59,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-07 11:21:59,096 INFO L87 Difference]: Start difference. First operand 123 states and 127 transitions. Second operand 19 states. [2019-09-07 11:21:59,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:21:59,153 INFO L93 Difference]: Finished difference Result 171 states and 176 transitions. [2019-09-07 11:21:59,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 11:21:59,154 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 200 [2019-09-07 11:21:59,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:21:59,155 INFO L225 Difference]: With dead ends: 171 [2019-09-07 11:21:59,155 INFO L226 Difference]: Without dead ends: 126 [2019-09-07 11:21:59,155 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-07 11:21:59,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-09-07 11:21:59,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2019-09-07 11:21:59,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-09-07 11:21:59,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2019-09-07 11:21:59,160 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 200 [2019-09-07 11:21:59,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:21:59,162 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2019-09-07 11:21:59,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 11:21:59,163 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2019-09-07 11:21:59,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-07 11:21:59,167 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:21:59,168 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 18, 18, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:21:59,168 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:21:59,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:21:59,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1636869325, now seen corresponding path program 34 times [2019-09-07 11:21:59,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:21:59,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:21:59,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:59,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:21:59,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:21:59,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:21:59,406 INFO L134 CoverageAnalysis]: Checked inductivity of 3298 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 1777 trivial. 0 not checked. [2019-09-07 11:21:59,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:21:59,407 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) [2019-09-07 11:21:59,425 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:21:59,519 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:21:59,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:21:59,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 11:21:59,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:22:00,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3298 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 2974 trivial. 0 not checked. [2019-09-07 11:22:00,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:22:00,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 39 [2019-09-07 11:22:00,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-07 11:22:00,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-07 11:22:00,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 11:22:00,163 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand 39 states. [2019-09-07 11:22:00,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:22:00,289 INFO L93 Difference]: Finished difference Result 213 states and 225 transitions. [2019-09-07 11:22:00,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-07 11:22:00,290 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 202 [2019-09-07 11:22:00,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:22:00,291 INFO L225 Difference]: With dead ends: 213 [2019-09-07 11:22:00,292 INFO L226 Difference]: Without dead ends: 131 [2019-09-07 11:22:00,293 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 11:22:00,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-09-07 11:22:00,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2019-09-07 11:22:00,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-09-07 11:22:00,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 133 transitions. [2019-09-07 11:22:00,300 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 133 transitions. Word has length 202 [2019-09-07 11:22:00,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:22:00,300 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 133 transitions. [2019-09-07 11:22:00,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-07 11:22:00,300 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 133 transitions. [2019-09-07 11:22:00,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-07 11:22:00,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:22:00,302 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 19, 19, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:22:00,302 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:22:00,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:22:00,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1825442931, now seen corresponding path program 35 times [2019-09-07 11:22:00,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:22:00,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:22:00,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:22:00,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:22:00,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:22:00,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:22:00,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3656 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 3400 trivial. 0 not checked. [2019-09-07 11:22:00,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:22:00,546 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:22:00,557 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 11:22:18,219 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 38 check-sat command(s) [2019-09-07 11:22:18,219 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:22:18,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 11:22:18,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:22:18,570 INFO L134 CoverageAnalysis]: Checked inductivity of 3656 backedges. 1372 proven. 324 refuted. 0 times theorem prover too weak. 1960 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (37)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:22:18,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:22:18,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 38 [2019-09-07 11:22:18,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-07 11:22:18,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-07 11:22:18,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=1026, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 11:22:18,585 INFO L87 Difference]: Start difference. First operand 129 states and 133 transitions. Second operand 38 states. [2019-09-07 11:22:18,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:22:18,718 INFO L93 Difference]: Finished difference Result 218 states and 229 transitions. [2019-09-07 11:22:18,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-07 11:22:18,719 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 210 [2019-09-07 11:22:18,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:22:18,720 INFO L225 Difference]: With dead ends: 218 [2019-09-07 11:22:18,720 INFO L226 Difference]: Without dead ends: 135 [2019-09-07 11:22:18,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=380, Invalid=1026, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 11:22:18,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-09-07 11:22:18,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2019-09-07 11:22:18,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-09-07 11:22:18,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 137 transitions. [2019-09-07 11:22:18,730 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 137 transitions. Word has length 210 [2019-09-07 11:22:18,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:22:18,732 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 137 transitions. [2019-09-07 11:22:18,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-07 11:22:18,733 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2019-09-07 11:22:18,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-07 11:22:18,734 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:22:18,734 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 19, 19, 17, 17, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:22:18,734 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:22:18,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:22:18,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1061136745, now seen corresponding path program 36 times [2019-09-07 11:22:18,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:22:18,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:22:18,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:22:18,738 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:22:18,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:22:18,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:22:19,031 INFO L134 CoverageAnalysis]: Checked inductivity of 4028 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 3739 trivial. 0 not checked. [2019-09-07 11:22:19,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:22:19,032 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:22:19,047 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:22:21,908 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2019-09-07 11:22:21,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:22:21,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-07 11:22:21,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:22:21,991 INFO L134 CoverageAnalysis]: Checked inductivity of 4028 backedges. 1567 proven. 289 refuted. 0 times theorem prover too weak. 2172 trivial. 0 not checked. [2019-09-07 11:22:22,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:22:22,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 23 [2019-09-07 11:22:22,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-07 11:22:22,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-07 11:22:22,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=291, Unknown=0, NotChecked=0, Total=506 [2019-09-07 11:22:22,002 INFO L87 Difference]: Start difference. First operand 133 states and 137 transitions. Second operand 23 states. [2019-09-07 11:22:22,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:22:22,312 INFO L93 Difference]: Finished difference Result 185 states and 190 transitions. [2019-09-07 11:22:22,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 11:22:22,313 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 218 [2019-09-07 11:22:22,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:22:22,314 INFO L225 Difference]: With dead ends: 185 [2019-09-07 11:22:22,314 INFO L226 Difference]: Without dead ends: 136 [2019-09-07 11:22:22,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=594, Invalid=1046, Unknown=0, NotChecked=0, Total=1640 [2019-09-07 11:22:22,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-09-07 11:22:22,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2019-09-07 11:22:22,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-09-07 11:22:22,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2019-09-07 11:22:22,322 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 139 transitions. Word has length 218 [2019-09-07 11:22:22,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:22:22,322 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 139 transitions. [2019-09-07 11:22:22,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-07 11:22:22,322 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2019-09-07 11:22:22,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-09-07 11:22:22,324 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:22:22,324 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 19, 19, 18, 18, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:22:22,324 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:22:22,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:22:22,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1865902439, now seen corresponding path program 37 times [2019-09-07 11:22:22,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:22:22,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:22:22,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:22:22,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:22:22,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:22:22,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:22:22,624 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 3702 trivial. 0 not checked. [2019-09-07 11:22:22,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:22:22,624 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:22:22,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:22:22,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:22:22,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-07 11:22:22,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:22:22,770 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 3702 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (39)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:22:22,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:22:22,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-09-07 11:22:22,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-07 11:22:22,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-07 11:22:22,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-07 11:22:22,775 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. Second operand 23 states. [2019-09-07 11:22:22,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:22:22,829 INFO L93 Difference]: Finished difference Result 227 states and 235 transitions. [2019-09-07 11:22:22,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 11:22:22,830 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 220 [2019-09-07 11:22:22,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:22:22,831 INFO L225 Difference]: With dead ends: 227 [2019-09-07 11:22:22,831 INFO L226 Difference]: Without dead ends: 137 [2019-09-07 11:22:22,832 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-07 11:22:22,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-09-07 11:22:22,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-09-07 11:22:22,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-09-07 11:22:22,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 141 transitions. [2019-09-07 11:22:22,838 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 141 transitions. Word has length 220 [2019-09-07 11:22:22,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:22:22,842 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 141 transitions. [2019-09-07 11:22:22,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-07 11:22:22,843 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2019-09-07 11:22:22,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-07 11:22:22,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:22:22,845 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 20, 20, 18, 18, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:22:22,845 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:22:22,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:22:22,846 INFO L82 PathProgramCache]: Analyzing trace with hash -709437751, now seen corresponding path program 38 times [2019-09-07 11:22:22,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:22:22,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:22:22,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:22:22,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:22:22,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:22:22,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:22:23,132 INFO L134 CoverageAnalysis]: Checked inductivity of 4102 backedges. 0 proven. 1889 refuted. 0 times theorem prover too weak. 2213 trivial. 0 not checked. [2019-09-07 11:22:23,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:22:23,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 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:22:23,142 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:22:23,249 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:22:23,249 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:22:23,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-07 11:22:23,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:22:23,293 INFO L134 CoverageAnalysis]: Checked inductivity of 4102 backedges. 1524 proven. 361 refuted. 0 times theorem prover too weak. 2217 trivial. 0 not checked. [2019-09-07 11:22:23,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:22:23,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-09-07 11:22:23,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-07 11:22:23,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-07 11:22:23,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-07 11:22:23,299 INFO L87 Difference]: Start difference. First operand 137 states and 141 transitions. Second operand 23 states. [2019-09-07 11:22:23,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:22:23,372 INFO L93 Difference]: Finished difference Result 228 states and 238 transitions. [2019-09-07 11:22:23,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 11:22:23,372 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 222 [2019-09-07 11:22:23,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:22:23,373 INFO L225 Difference]: With dead ends: 228 [2019-09-07 11:22:23,374 INFO L226 Difference]: Without dead ends: 139 [2019-09-07 11:22:23,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-07 11:22:23,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-09-07 11:22:23,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-09-07 11:22:23,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-09-07 11:22:23,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 143 transitions. [2019-09-07 11:22:23,380 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 143 transitions. Word has length 222 [2019-09-07 11:22:23,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:22:23,380 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 143 transitions. [2019-09-07 11:22:23,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-07 11:22:23,381 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 143 transitions. [2019-09-07 11:22:23,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-07 11:22:23,382 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:22:23,382 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 20, 20, 18, 18, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:22:23,382 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:22:23,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:22:23,383 INFO L82 PathProgramCache]: Analyzing trace with hash 945571367, now seen corresponding path program 39 times [2019-09-07 11:22:23,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:22:23,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:22:23,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:22:23,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:22:23,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:22:23,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:22:23,690 INFO L134 CoverageAnalysis]: Checked inductivity of 4459 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 4135 trivial. 0 not checked. [2019-09-07 11:22:23,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:22:23,690 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:22:23,705 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:22:27,051 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-09-07 11:22:27,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:22:27,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 11:22:27,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:22:27,101 INFO L134 CoverageAnalysis]: Checked inductivity of 4459 backedges. 1690 proven. 324 refuted. 0 times theorem prover too weak. 2445 trivial. 0 not checked. [2019-09-07 11:22:27,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:22:27,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-09-07 11:22:27,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-07 11:22:27,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-07 11:22:27,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-07 11:22:27,109 INFO L87 Difference]: Start difference. First operand 139 states and 143 transitions. Second operand 22 states. [2019-09-07 11:22:27,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:22:27,190 INFO L93 Difference]: Finished difference Result 192 states and 197 transitions. [2019-09-07 11:22:27,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 11:22:27,191 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 228 [2019-09-07 11:22:27,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:22:27,192 INFO L225 Difference]: With dead ends: 192 [2019-09-07 11:22:27,192 INFO L226 Difference]: Without dead ends: 141 [2019-09-07 11:22:27,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-07 11:22:27,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-09-07 11:22:27,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2019-09-07 11:22:27,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-09-07 11:22:27,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 145 transitions. [2019-09-07 11:22:27,201 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 145 transitions. Word has length 228 [2019-09-07 11:22:27,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:22:27,201 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 145 transitions. [2019-09-07 11:22:27,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-07 11:22:27,201 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 145 transitions. [2019-09-07 11:22:27,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-07 11:22:27,203 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:22:27,203 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 20, 20, 19, 19, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:22:27,203 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:22:27,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:22:27,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1670818139, now seen corresponding path program 40 times [2019-09-07 11:22:27,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:22:27,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:22:27,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:22:27,206 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:22:27,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:22:28,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat