java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/sanfoundry_27_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 09:19:39,866 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 09:19:39,869 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 09:19:39,881 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 09:19:39,882 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 09:19:39,883 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 09:19:39,884 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 09:19:39,886 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 09:19:39,888 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 09:19:39,889 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 09:19:39,890 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 09:19:39,891 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 09:19:39,891 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 09:19:39,892 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 09:19:39,893 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 09:19:39,894 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 09:19:39,895 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 09:19:39,896 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 09:19:39,898 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 09:19:39,899 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 09:19:39,901 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 09:19:39,902 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 09:19:39,903 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 09:19:39,904 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 09:19:39,906 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 09:19:39,906 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 09:19:39,906 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 09:19:39,907 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 09:19:39,908 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 09:19:39,909 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 09:19:39,909 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 09:19:39,910 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 09:19:39,910 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 09:19:39,911 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 09:19:39,912 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 09:19:39,912 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 09:19:39,913 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 09:19:39,913 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 09:19:39,913 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 09:19:39,914 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 09:19:39,915 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 09:19:39,916 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 09:19:39,931 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 09:19:39,931 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 09:19:39,932 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 09:19:39,933 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 09:19:39,933 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 09:19:39,933 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 09:19:39,933 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 09:19:39,933 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 09:19:39,934 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 09:19:39,934 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 09:19:39,934 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 09:19:39,934 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 09:19:39,934 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 09:19:39,935 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 09:19:39,935 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 09:19:39,935 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 09:19:39,935 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 09:19:39,935 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 09:19:39,936 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 09:19:39,936 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 09:19:39,936 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 09:19:39,936 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 09:19:39,936 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 09:19:39,937 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 09:19:39,937 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 09:19:39,937 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 09:19:39,937 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 09:19:39,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 09:19:39,937 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 09:19:39,969 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 09:19:39,984 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 09:19:39,988 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 09:19:39,990 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 09:19:39,990 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 09:19:39,991 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sanfoundry_27_ground.i [2019-09-07 09:19:40,070 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/707e465a0/3a2b8754b26040a2a7b8111000c7b9d4/FLAG5cda190fa [2019-09-07 09:19:40,565 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 09:19:40,566 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sanfoundry_27_ground.i [2019-09-07 09:19:40,572 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/707e465a0/3a2b8754b26040a2a7b8111000c7b9d4/FLAG5cda190fa [2019-09-07 09:19:40,977 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/707e465a0/3a2b8754b26040a2a7b8111000c7b9d4 [2019-09-07 09:19:40,986 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 09:19:40,988 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 09:19:40,989 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 09:19:40,989 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 09:19:40,994 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 09:19:40,995 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 09:19:40" (1/1) ... [2019-09-07 09:19:40,998 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3189af52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:19:40, skipping insertion in model container [2019-09-07 09:19:40,998 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 09:19:40" (1/1) ... [2019-09-07 09:19:41,006 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 09:19:41,023 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 09:19:41,250 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 09:19:41,262 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 09:19:41,296 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 09:19:41,325 INFO L192 MainTranslator]: Completed translation [2019-09-07 09:19:41,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:19:41 WrapperNode [2019-09-07 09:19:41,327 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 09:19:41,328 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 09:19:41,328 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 09:19:41,328 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 09:19:41,485 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:19:41" (1/1) ... [2019-09-07 09:19:41,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:19:41" (1/1) ... [2019-09-07 09:19:41,495 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:19:41" (1/1) ... [2019-09-07 09:19:41,497 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:19:41" (1/1) ... [2019-09-07 09:19:41,518 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:19:41" (1/1) ... [2019-09-07 09:19:41,525 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:19:41" (1/1) ... [2019-09-07 09:19:41,536 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:19:41" (1/1) ... [2019-09-07 09:19:41,538 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 09:19:41,539 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 09:19:41,542 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 09:19:41,542 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 09:19:41,543 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:19:41" (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 09:19:41,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 09:19:41,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 09:19:41,608 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-07 09:19:41,608 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 09:19:41,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 09:19:41,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-07 09:19:41,609 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 09:19:41,609 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 09:19:41,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-07 09:19:41,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-07 09:19:41,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-07 09:19:41,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-07 09:19:41,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 09:19:41,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 09:19:41,906 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 09:19:41,906 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-07 09:19:41,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 09:19:41 BoogieIcfgContainer [2019-09-07 09:19:41,908 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 09:19:41,909 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 09:19:41,909 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 09:19:41,917 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 09:19:41,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 09:19:40" (1/3) ... [2019-09-07 09:19:41,919 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e330367 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 09:19:41, skipping insertion in model container [2019-09-07 09:19:41,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:19:41" (2/3) ... [2019-09-07 09:19:41,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e330367 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 09:19:41, skipping insertion in model container [2019-09-07 09:19:41,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 09:19:41" (3/3) ... [2019-09-07 09:19:41,922 INFO L109 eAbstractionObserver]: Analyzing ICFG sanfoundry_27_ground.i [2019-09-07 09:19:41,934 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 09:19:41,942 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 09:19:41,958 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 09:19:41,985 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 09:19:41,986 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 09:19:41,986 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 09:19:41,986 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 09:19:41,986 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 09:19:41,986 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 09:19:41,987 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 09:19:41,987 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 09:19:41,987 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 09:19:42,004 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-09-07 09:19:42,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-07 09:19:42,010 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:19:42,011 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:19:42,014 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:19:42,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:19:42,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1998025284, now seen corresponding path program 1 times [2019-09-07 09:19:42,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:19:42,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:19:42,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:42,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:19:42,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:42,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:19:42,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 09:19:42,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 09:19:42,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-07 09:19:42,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-07 09:19:42,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-07 09:19:42,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 09:19:42,178 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2019-09-07 09:19:42,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:19:42,199 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2019-09-07 09:19:42,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-07 09:19:42,201 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-09-07 09:19:42,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:19:42,208 INFO L225 Difference]: With dead ends: 48 [2019-09-07 09:19:42,208 INFO L226 Difference]: Without dead ends: 23 [2019-09-07 09:19:42,211 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 09:19:42,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-07 09:19:42,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-07 09:19:42,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-07 09:19:42,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-09-07 09:19:42,245 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 15 [2019-09-07 09:19:42,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:19:42,245 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-09-07 09:19:42,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-07 09:19:42,246 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2019-09-07 09:19:42,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-07 09:19:42,247 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:19:42,247 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:19:42,247 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:19:42,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:19:42,248 INFO L82 PathProgramCache]: Analyzing trace with hash -915838997, now seen corresponding path program 1 times [2019-09-07 09:19:42,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:19:42,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:19:42,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:42,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:19:42,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:42,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:19:42,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 09:19:42,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 09:19:42,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 09:19:42,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 09:19:42,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 09:19:42,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 09:19:42,301 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 3 states. [2019-09-07 09:19:42,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:19:42,357 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2019-09-07 09:19:42,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 09:19:42,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-09-07 09:19:42,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:19:42,359 INFO L225 Difference]: With dead ends: 40 [2019-09-07 09:19:42,359 INFO L226 Difference]: Without dead ends: 25 [2019-09-07 09:19:42,361 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 09:19:42,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-07 09:19:42,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-09-07 09:19:42,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-07 09:19:42,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2019-09-07 09:19:42,367 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 15 [2019-09-07 09:19:42,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:19:42,368 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-09-07 09:19:42,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 09:19:42,368 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2019-09-07 09:19:42,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-07 09:19:42,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:19:42,369 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:19:42,369 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:19:42,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:19:42,370 INFO L82 PathProgramCache]: Analyzing trace with hash 203688137, now seen corresponding path program 1 times [2019-09-07 09:19:42,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:19:42,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:19:42,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:42,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:19:42,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:42,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:19:42,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 09:19:42,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 09:19:42,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 09:19:42,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 09:19:42,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 09:19:42,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 09:19:42,426 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 3 states. [2019-09-07 09:19:42,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:19:42,481 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2019-09-07 09:19:42,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 09:19:42,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-07 09:19:42,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:19:42,483 INFO L225 Difference]: With dead ends: 38 [2019-09-07 09:19:42,483 INFO L226 Difference]: Without dead ends: 27 [2019-09-07 09:19:42,484 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 09:19:42,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-07 09:19:42,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-09-07 09:19:42,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-07 09:19:42,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-09-07 09:19:42,492 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 17 [2019-09-07 09:19:42,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:19:42,493 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-09-07 09:19:42,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 09:19:42,493 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-09-07 09:19:42,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-07 09:19:42,494 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:19:42,494 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:19:42,495 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:19:42,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:19:42,495 INFO L82 PathProgramCache]: Analyzing trace with hash -990062782, now seen corresponding path program 1 times [2019-09-07 09:19:42,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:19:42,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:19:42,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:42,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:19:42,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:42,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:19:42,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 09:19:42,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:19:42,559 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 09:19:42,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:19:42,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:19:42,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 09:19:42,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:19:42,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 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 09:19:42,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:19:42,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-07 09:19:42,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 09:19:42,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 09:19:42,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 09:19:42,660 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 5 states. [2019-09-07 09:19:42,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:19:42,739 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2019-09-07 09:19:42,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 09:19:42,740 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-09-07 09:19:42,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:19:42,741 INFO L225 Difference]: With dead ends: 46 [2019-09-07 09:19:42,741 INFO L226 Difference]: Without dead ends: 30 [2019-09-07 09:19:42,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 09:19:42,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-07 09:19:42,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2019-09-07 09:19:42,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-07 09:19:42,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-09-07 09:19:42,748 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 20 [2019-09-07 09:19:42,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:19:42,748 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-09-07 09:19:42,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 09:19:42,749 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-09-07 09:19:42,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-07 09:19:42,750 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:19:42,750 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:19:42,750 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:19:42,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:19:42,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1464200924, now seen corresponding path program 2 times [2019-09-07 09:19:42,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:19:42,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:19:42,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:42,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:19:42,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:42,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:19:42,821 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 09:19:42,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:19:42,822 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 09:19:42,839 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 09:19:42,863 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-09-07 09:19:42,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:19:42,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 09:19:42,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:19:42,961 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-07 09:19:42,962 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:19:42,968 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:19:42,968 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:19:42,969 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-07 09:19:42,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:19:43,032 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-07 09:19:43,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 09:19:43,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [4] total 10 [2019-09-07 09:19:43,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 09:19:43,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 09:19:43,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-07 09:19:43,039 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 10 states. [2019-09-07 09:19:43,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:19:43,352 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2019-09-07 09:19:43,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 09:19:43,353 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-09-07 09:19:43,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:19:43,356 INFO L225 Difference]: With dead ends: 63 [2019-09-07 09:19:43,356 INFO L226 Difference]: Without dead ends: 52 [2019-09-07 09:19:43,357 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2019-09-07 09:19:43,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-07 09:19:43,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 42. [2019-09-07 09:19:43,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-07 09:19:43,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2019-09-07 09:19:43,371 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 22 [2019-09-07 09:19:43,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:19:43,372 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2019-09-07 09:19:43,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 09:19:43,372 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2019-09-07 09:19:43,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-07 09:19:43,373 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:19:43,373 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:19:43,374 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:19:43,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:19:43,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1276489979, now seen corresponding path program 1 times [2019-09-07 09:19:43,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:19:43,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:19:43,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:43,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:19:43,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:43,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:19:43,433 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-07 09:19:43,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:19:43,434 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 09:19:43,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:19:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:19:43,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 09:19:43,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:19:43,487 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 09:19:43,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:19:43,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-07 09:19:43,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 09:19:43,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 09:19:43,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 09:19:43,493 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 6 states. [2019-09-07 09:19:43,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:19:43,554 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2019-09-07 09:19:43,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 09:19:43,554 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-09-07 09:19:43,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:19:43,557 INFO L225 Difference]: With dead ends: 80 [2019-09-07 09:19:43,557 INFO L226 Difference]: Without dead ends: 49 [2019-09-07 09:19:43,558 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 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 09:19:43,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-07 09:19:43,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2019-09-07 09:19:43,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-07 09:19:43,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2019-09-07 09:19:43,566 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 25 [2019-09-07 09:19:43,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:19:43,567 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2019-09-07 09:19:43,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 09:19:43,567 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2019-09-07 09:19:43,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-07 09:19:43,568 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:19:43,568 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:19:43,569 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:19:43,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:19:43,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1680863843, now seen corresponding path program 2 times [2019-09-07 09:19:43,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:19:43,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:19:43,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:43,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:19:43,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:43,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:19:43,668 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-07 09:19:43,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:19:43,669 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 09:19:43,682 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 09:19:43,708 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:19:43,708 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:19:43,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 09:19:43,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:19:43,728 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-07 09:19:43,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:19:43,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-07 09:19:43,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 09:19:43,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 09:19:43,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 09:19:43,735 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand 6 states. [2019-09-07 09:19:43,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:19:43,802 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2019-09-07 09:19:43,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 09:19:43,802 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-09-07 09:19:43,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:19:43,804 INFO L225 Difference]: With dead ends: 73 [2019-09-07 09:19:43,804 INFO L226 Difference]: Without dead ends: 55 [2019-09-07 09:19:43,804 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 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 09:19:43,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-07 09:19:43,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2019-09-07 09:19:43,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-07 09:19:43,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2019-09-07 09:19:43,813 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 27 [2019-09-07 09:19:43,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:19:43,813 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2019-09-07 09:19:43,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 09:19:43,814 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2019-09-07 09:19:43,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-07 09:19:43,815 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:19:43,815 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:19:43,815 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:19:43,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:19:43,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1105413084, now seen corresponding path program 3 times [2019-09-07 09:19:43,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:19:43,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:19:43,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:43,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:19:43,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:43,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:19:43,917 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-07 09:19:43,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:19:43,918 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 09:19:43,944 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:19:43,968 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-07 09:19:43,968 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:19:43,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 09:19:43,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:19:44,125 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:19:44,126 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 22 [2019-09-07 09:19:44,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:19:44,128 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:19:44,134 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:19:44,135 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:19:44,136 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:5 [2019-09-07 09:19:44,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:19:44,190 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-07 09:19:44,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 09:19:44,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2019-09-07 09:19:44,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 09:19:44,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 09:19:44,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-09-07 09:19:44,199 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand 14 states. [2019-09-07 09:19:44,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:19:44,890 INFO L93 Difference]: Finished difference Result 106 states and 126 transitions. [2019-09-07 09:19:44,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-07 09:19:44,892 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2019-09-07 09:19:44,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:19:44,893 INFO L225 Difference]: With dead ends: 106 [2019-09-07 09:19:44,893 INFO L226 Difference]: Without dead ends: 69 [2019-09-07 09:19:44,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=213, Invalid=779, Unknown=0, NotChecked=0, Total=992 [2019-09-07 09:19:44,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-07 09:19:44,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 43. [2019-09-07 09:19:44,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-07 09:19:44,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2019-09-07 09:19:44,917 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 30 [2019-09-07 09:19:44,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:19:44,920 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2019-09-07 09:19:44,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 09:19:44,920 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2019-09-07 09:19:44,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-07 09:19:44,926 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:19:44,926 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:19:44,927 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:19:44,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:19:44,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1837097665, now seen corresponding path program 1 times [2019-09-07 09:19:44,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:19:44,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:19:44,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:44,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:19:44,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:44,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:19:45,039 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-07 09:19:45,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:19:45,039 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 09:19:45,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:19:45,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:19:45,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 09:19:45,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:19:45,117 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-07 09:19:45,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:19:45,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-09-07 09:19:45,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 09:19:45,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 09:19:45,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-09-07 09:19:45,125 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 8 states. [2019-09-07 09:19:45,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:19:45,186 INFO L93 Difference]: Finished difference Result 79 states and 92 transitions. [2019-09-07 09:19:45,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 09:19:45,187 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2019-09-07 09:19:45,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:19:45,188 INFO L225 Difference]: With dead ends: 79 [2019-09-07 09:19:45,188 INFO L226 Difference]: Without dead ends: 51 [2019-09-07 09:19:45,189 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-09-07 09:19:45,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-07 09:19:45,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2019-09-07 09:19:45,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-07 09:19:45,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2019-09-07 09:19:45,197 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 40 [2019-09-07 09:19:45,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:19:45,197 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2019-09-07 09:19:45,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 09:19:45,197 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2019-09-07 09:19:45,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-07 09:19:45,199 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:19:45,199 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:19:45,199 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:19:45,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:19:45,200 INFO L82 PathProgramCache]: Analyzing trace with hash -587199816, now seen corresponding path program 2 times [2019-09-07 09:19:45,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:19:45,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:19:45,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:45,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:19:45,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:19:45,333 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-07 09:19:45,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:19:45,334 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:19:45,360 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:19:45,385 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:19:45,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:19:45,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 09:19:45,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:19:45,414 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-07 09:19:45,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:19:45,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 9 [2019-09-07 09:19:45,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 09:19:45,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 09:19:45,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=37, Unknown=0, NotChecked=0, Total=72 [2019-09-07 09:19:45,421 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 9 states. [2019-09-07 09:19:45,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:19:45,484 INFO L93 Difference]: Finished difference Result 87 states and 102 transitions. [2019-09-07 09:19:45,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 09:19:45,485 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2019-09-07 09:19:45,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:19:45,486 INFO L225 Difference]: With dead ends: 87 [2019-09-07 09:19:45,486 INFO L226 Difference]: Without dead ends: 56 [2019-09-07 09:19:45,486 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=37, Unknown=0, NotChecked=0, Total=72 [2019-09-07 09:19:45,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-07 09:19:45,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2019-09-07 09:19:45,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-07 09:19:45,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2019-09-07 09:19:45,495 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 45 [2019-09-07 09:19:45,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:19:45,495 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2019-09-07 09:19:45,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 09:19:45,495 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2019-09-07 09:19:45,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-07 09:19:45,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:19:45,496 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:19:45,497 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:19:45,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:19:45,497 INFO L82 PathProgramCache]: Analyzing trace with hash -924407389, now seen corresponding path program 3 times [2019-09-07 09:19:45,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:19:45,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:19:45,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:45,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:19:45,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:45,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:19:45,613 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 2 proven. 35 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-07 09:19:45,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:19:45,614 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 09:19:45,624 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:19:45,648 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-07 09:19:45,649 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:19:45,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-07 09:19:45,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:19:45,783 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-07 09:19:45,785 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:19:45,799 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:19:45,799 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:19:45,800 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-07 09:19:45,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:19:45,862 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-09-07 09:19:45,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:19:45,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13] total 19 [2019-09-07 09:19:45,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 09:19:45,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 09:19:45,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-09-07 09:19:45,867 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 19 states. [2019-09-07 09:19:46,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:19:46,409 INFO L93 Difference]: Finished difference Result 108 states and 128 transitions. [2019-09-07 09:19:46,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 09:19:46,409 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 50 [2019-09-07 09:19:46,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:19:46,410 INFO L225 Difference]: With dead ends: 108 [2019-09-07 09:19:46,410 INFO L226 Difference]: Without dead ends: 91 [2019-09-07 09:19:46,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=243, Invalid=1089, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 09:19:46,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-09-07 09:19:46,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 81. [2019-09-07 09:19:46,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-07 09:19:46,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 95 transitions. [2019-09-07 09:19:46,427 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 95 transitions. Word has length 50 [2019-09-07 09:19:46,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:19:46,428 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 95 transitions. [2019-09-07 09:19:46,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 09:19:46,428 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 95 transitions. [2019-09-07 09:19:46,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-07 09:19:46,434 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:19:46,435 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:19:46,435 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:19:46,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:19:46,435 INFO L82 PathProgramCache]: Analyzing trace with hash -645599244, now seen corresponding path program 1 times [2019-09-07 09:19:46,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:19:46,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:19:46,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:46,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:19:46,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:46,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:19:46,535 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-09-07 09:19:46,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:19:46,536 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:19:46,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:19:46,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:19:46,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 09:19:46,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:19:46,599 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-09-07 09:19:46,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:19:46,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-07 09:19:46,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 09:19:46,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 09:19:46,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-07 09:19:46,611 INFO L87 Difference]: Start difference. First operand 81 states and 95 transitions. Second operand 10 states. [2019-09-07 09:19:46,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:19:46,675 INFO L93 Difference]: Finished difference Result 150 states and 180 transitions. [2019-09-07 09:19:46,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 09:19:46,676 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2019-09-07 09:19:46,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:19:46,677 INFO L225 Difference]: With dead ends: 150 [2019-09-07 09:19:46,677 INFO L226 Difference]: Without dead ends: 88 [2019-09-07 09:19:46,678 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 53 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 09:19:46,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-09-07 09:19:46,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 83. [2019-09-07 09:19:46,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-07 09:19:46,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 97 transitions. [2019-09-07 09:19:46,688 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 97 transitions. Word has length 53 [2019-09-07 09:19:46,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:19:46,688 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 97 transitions. [2019-09-07 09:19:46,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 09:19:46,688 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2019-09-07 09:19:46,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-07 09:19:46,690 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:19:46,690 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:19:46,690 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:19:46,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:19:46,690 INFO L82 PathProgramCache]: Analyzing trace with hash 706607698, now seen corresponding path program 2 times [2019-09-07 09:19:46,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:19:46,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:19:46,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:46,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:19:46,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:46,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:19:46,826 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 2 proven. 51 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-07 09:19:46,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:19:46,827 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:19:46,845 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 09:19:46,870 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:19:46,870 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:19:46,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 09:19:46,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:19:46,900 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 09:19:46,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:19:46,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 11 [2019-09-07 09:19:46,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 09:19:46,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 09:19:46,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=56, Unknown=0, NotChecked=0, Total=110 [2019-09-07 09:19:46,909 INFO L87 Difference]: Start difference. First operand 83 states and 97 transitions. Second operand 11 states. [2019-09-07 09:19:46,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:19:46,978 INFO L93 Difference]: Finished difference Result 158 states and 192 transitions. [2019-09-07 09:19:46,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 09:19:46,979 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-09-07 09:19:46,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:19:46,980 INFO L225 Difference]: With dead ends: 158 [2019-09-07 09:19:46,980 INFO L226 Difference]: Without dead ends: 96 [2019-09-07 09:19:46,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=56, Unknown=0, NotChecked=0, Total=110 [2019-09-07 09:19:46,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-07 09:19:46,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2019-09-07 09:19:46,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-07 09:19:46,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 107 transitions. [2019-09-07 09:19:46,991 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 107 transitions. Word has length 55 [2019-09-07 09:19:46,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:19:46,991 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 107 transitions. [2019-09-07 09:19:46,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 09:19:46,991 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 107 transitions. [2019-09-07 09:19:46,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-07 09:19:46,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:19:46,993 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:19:46,993 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:19:46,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:19:46,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1530684923, now seen corresponding path program 3 times [2019-09-07 09:19:46,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:19:46,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:19:46,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:46,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:19:46,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:47,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:19:47,080 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 2 proven. 70 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-07 09:19:47,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:19:47,081 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) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:19:47,098 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:19:47,119 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-07 09:19:47,119 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:19:47,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-07 09:19:47,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:19:47,437 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:19:47,438 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 22 [2019-09-07 09:19:47,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:19:47,440 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:19:47,454 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:19:47,455 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:19:47,456 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:5 [2019-09-07 09:19:47,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:19:47,520 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 17 proven. 17 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-07 09:19:47,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:19:47,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 16] total 24 [2019-09-07 09:19:47,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-07 09:19:47,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-07 09:19:47,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2019-09-07 09:19:47,533 INFO L87 Difference]: Start difference. First operand 91 states and 107 transitions. Second operand 24 states. [2019-09-07 09:19:49,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:19:49,085 INFO L93 Difference]: Finished difference Result 153 states and 176 transitions. [2019-09-07 09:19:49,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-07 09:19:49,085 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 60 [2019-09-07 09:19:49,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:19:49,087 INFO L225 Difference]: With dead ends: 153 [2019-09-07 09:19:49,087 INFO L226 Difference]: Without dead ends: 125 [2019-09-07 09:19:49,089 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1171 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=817, Invalid=3343, Unknown=0, NotChecked=0, Total=4160 [2019-09-07 09:19:49,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-09-07 09:19:49,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 74. [2019-09-07 09:19:49,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-09-07 09:19:49,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2019-09-07 09:19:49,098 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 60 [2019-09-07 09:19:49,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:19:49,098 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2019-09-07 09:19:49,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-07 09:19:49,098 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2019-09-07 09:19:49,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-07 09:19:49,099 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:19:49,100 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:19:49,100 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:19:49,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:19:49,100 INFO L82 PathProgramCache]: Analyzing trace with hash 961644233, now seen corresponding path program 4 times [2019-09-07 09:19:49,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:19:49,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:19:49,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:49,102 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:19:49,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:49,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:19:49,214 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 4 proven. 64 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-07 09:19:49,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:19:49,214 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 09:19:49,224 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:19:49,260 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:19:49,260 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:19:49,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 09:19:49,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:19:49,285 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-09-07 09:19:49,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:19:49,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-09-07 09:19:49,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 09:19:49,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 09:19:49,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-07 09:19:49,290 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand 12 states. [2019-09-07 09:19:49,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:19:49,362 INFO L93 Difference]: Finished difference Result 130 states and 151 transitions. [2019-09-07 09:19:49,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 09:19:49,365 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2019-09-07 09:19:49,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:19:49,366 INFO L225 Difference]: With dead ends: 130 [2019-09-07 09:19:49,367 INFO L226 Difference]: Without dead ends: 79 [2019-09-07 09:19:49,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 71 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 09:19:49,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-09-07 09:19:49,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2019-09-07 09:19:49,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-07 09:19:49,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2019-09-07 09:19:49,375 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 71 [2019-09-07 09:19:49,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:19:49,375 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2019-09-07 09:19:49,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 09:19:49,375 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2019-09-07 09:19:49,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-07 09:19:49,376 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:19:49,376 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:19:49,376 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:19:49,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:19:49,377 INFO L82 PathProgramCache]: Analyzing trace with hash 571209127, now seen corresponding path program 5 times [2019-09-07 09:19:49,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:19:49,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:19:49,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:49,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:19:49,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:19:49,464 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 4 proven. 92 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-09-07 09:19:49,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:19:49,464 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 09:19:49,482 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:19:49,576 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-09-07 09:19:49,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:19:49,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 09:19:49,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:19:49,598 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-09-07 09:19:49,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:19:49,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-09-07 09:19:49,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 09:19:49,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 09:19:49,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-07 09:19:49,604 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand 12 states. [2019-09-07 09:19:49,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:19:49,693 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2019-09-07 09:19:49,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 09:19:49,695 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2019-09-07 09:19:49,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:19:49,696 INFO L225 Difference]: With dead ends: 107 [2019-09-07 09:19:49,696 INFO L226 Difference]: Without dead ends: 82 [2019-09-07 09:19:49,696 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 73 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 09:19:49,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-07 09:19:49,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2019-09-07 09:19:49,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-07 09:19:49,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2019-09-07 09:19:49,704 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 73 [2019-09-07 09:19:49,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:19:49,704 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2019-09-07 09:19:49,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 09:19:49,705 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2019-09-07 09:19:49,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-07 09:19:49,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:19:49,706 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:19:49,706 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:19:49,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:19:49,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1650941760, now seen corresponding path program 6 times [2019-09-07 09:19:49,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:19:49,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:19:49,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:49,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:19:49,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:49,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:19:49,807 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 4 proven. 81 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-09-07 09:19:49,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:19:49,808 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 09:19:49,835 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:19:49,901 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-09-07 09:19:49,901 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:19:49,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 09:19:49,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:19:49,929 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-09-07 09:19:49,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:19:49,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-07 09:19:49,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 09:19:49,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 09:19:49,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-07 09:19:49,941 INFO L87 Difference]: Start difference. First operand 79 states and 90 transitions. Second operand 13 states. [2019-09-07 09:19:50,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:19:50,029 INFO L93 Difference]: Finished difference Result 138 states and 161 transitions. [2019-09-07 09:19:50,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 09:19:50,030 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 76 [2019-09-07 09:19:50,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:19:50,031 INFO L225 Difference]: With dead ends: 138 [2019-09-07 09:19:50,031 INFO L226 Difference]: Without dead ends: 84 [2019-09-07 09:19:50,031 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-07 09:19:50,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-09-07 09:19:50,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2019-09-07 09:19:50,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-07 09:19:50,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2019-09-07 09:19:50,038 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 76 [2019-09-07 09:19:50,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:19:50,038 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2019-09-07 09:19:50,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 09:19:50,039 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2019-09-07 09:19:50,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-07 09:19:50,039 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:19:50,040 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:19:50,040 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:19:50,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:19:50,040 INFO L82 PathProgramCache]: Analyzing trace with hash 232098594, now seen corresponding path program 7 times [2019-09-07 09:19:50,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:19:50,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:19:50,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:50,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:19:50,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:50,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:19:50,138 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 4 proven. 117 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-07 09:19:50,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:19:50,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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:19:50,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:19:50,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:19:50,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 09:19:50,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:19:50,244 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-09-07 09:19:50,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:19:50,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 14 [2019-09-07 09:19:50,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 09:19:50,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 09:19:50,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=92, Unknown=0, NotChecked=0, Total=182 [2019-09-07 09:19:50,257 INFO L87 Difference]: Start difference. First operand 81 states and 92 transitions. Second operand 14 states. [2019-09-07 09:19:50,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:19:50,352 INFO L93 Difference]: Finished difference Result 143 states and 168 transitions. [2019-09-07 09:19:50,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 09:19:50,352 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 78 [2019-09-07 09:19:50,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:19:50,353 INFO L225 Difference]: With dead ends: 143 [2019-09-07 09:19:50,354 INFO L226 Difference]: Without dead ends: 89 [2019-09-07 09:19:50,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=92, Unknown=0, NotChecked=0, Total=182 [2019-09-07 09:19:50,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-09-07 09:19:50,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2019-09-07 09:19:50,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-09-07 09:19:50,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2019-09-07 09:19:50,363 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 78 [2019-09-07 09:19:50,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:19:50,363 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2019-09-07 09:19:50,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 09:19:50,363 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2019-09-07 09:19:50,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-07 09:19:50,364 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:19:50,364 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:19:50,365 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:19:50,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:19:50,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1699579203, now seen corresponding path program 8 times [2019-09-07 09:19:50,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:19:50,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:19:50,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:50,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:19:50,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:50,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:19:50,490 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 4 proven. 145 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-09-07 09:19:50,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:19:50,491 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 09:19:50,506 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:19:50,541 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:19:50,541 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:19:50,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 09:19:50,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:19:50,568 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2019-09-07 09:19:50,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:19:50,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 15 [2019-09-07 09:19:50,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 09:19:50,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 09:19:50,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=106, Unknown=0, NotChecked=0, Total=210 [2019-09-07 09:19:50,573 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand 15 states. [2019-09-07 09:19:50,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:19:50,682 INFO L93 Difference]: Finished difference Result 151 states and 178 transitions. [2019-09-07 09:19:50,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 09:19:50,683 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 83 [2019-09-07 09:19:50,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:19:50,684 INFO L225 Difference]: With dead ends: 151 [2019-09-07 09:19:50,684 INFO L226 Difference]: Without dead ends: 94 [2019-09-07 09:19:50,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=104, Invalid=106, Unknown=0, NotChecked=0, Total=210 [2019-09-07 09:19:50,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-09-07 09:19:50,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2019-09-07 09:19:50,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-07 09:19:50,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2019-09-07 09:19:50,691 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 83 [2019-09-07 09:19:50,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:19:50,692 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2019-09-07 09:19:50,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 09:19:50,692 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2019-09-07 09:19:50,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-07 09:19:50,693 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:19:50,693 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:19:50,693 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:19:50,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:19:50,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1566010490, now seen corresponding path program 9 times [2019-09-07 09:19:50,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:19:50,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:19:50,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:50,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:19:50,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:19:50,817 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 4 proven. 176 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-09-07 09:19:50,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:19:50,817 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:19:50,844 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:19:50,876 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-07 09:19:50,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:19:50,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-07 09:19:50,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:19:51,037 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-07 09:19:51,037 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:19:51,039 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:19:51,040 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:19:51,040 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-07 09:19:51,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:19:51,117 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 6 proven. 59 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (18)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 09:19:51,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:19:51,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2019-09-07 09:19:51,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-07 09:19:51,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-07 09:19:51,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=551, Unknown=0, NotChecked=0, Total=702 [2019-09-07 09:19:51,122 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand 27 states. [2019-09-07 09:19:52,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:19:52,181 INFO L93 Difference]: Finished difference Result 173 states and 205 transitions. [2019-09-07 09:19:52,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-07 09:19:52,182 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 88 [2019-09-07 09:19:52,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:19:52,184 INFO L225 Difference]: With dead ends: 173 [2019-09-07 09:19:52,184 INFO L226 Difference]: Without dead ends: 148 [2019-09-07 09:19:52,186 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=631, Invalid=2561, Unknown=0, NotChecked=0, Total=3192 [2019-09-07 09:19:52,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-09-07 09:19:52,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 138. [2019-09-07 09:19:52,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-09-07 09:19:52,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 164 transitions. [2019-09-07 09:19:52,198 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 164 transitions. Word has length 88 [2019-09-07 09:19:52,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:19:52,198 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 164 transitions. [2019-09-07 09:19:52,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-07 09:19:52,199 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 164 transitions. [2019-09-07 09:19:52,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-07 09:19:52,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:19:52,200 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:19:52,200 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:19:52,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:19:52,201 INFO L82 PathProgramCache]: Analyzing trace with hash 195979007, now seen corresponding path program 4 times [2019-09-07 09:19:52,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:19:52,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:19:52,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:52,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:19:52,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:19:52,331 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 4 proven. 144 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-09-07 09:19:52,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:19:52,331 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:19:52,351 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:19:52,391 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:19:52,391 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:19:52,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 09:19:52,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:19:52,420 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2019-09-07 09:19:52,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:19:52,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-07 09:19:52,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 09:19:52,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 09:19:52,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 09:19:52,425 INFO L87 Difference]: Start difference. First operand 138 states and 164 transitions. Second operand 16 states. [2019-09-07 09:19:52,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:19:52,562 INFO L93 Difference]: Finished difference Result 252 states and 306 transitions. [2019-09-07 09:19:52,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 09:19:52,562 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 91 [2019-09-07 09:19:52,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:19:52,563 INFO L225 Difference]: With dead ends: 252 [2019-09-07 09:19:52,563 INFO L226 Difference]: Without dead ends: 145 [2019-09-07 09:19:52,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 09:19:52,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-09-07 09:19:52,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 140. [2019-09-07 09:19:52,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-07 09:19:52,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 166 transitions. [2019-09-07 09:19:52,575 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 166 transitions. Word has length 91 [2019-09-07 09:19:52,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:19:52,576 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 166 transitions. [2019-09-07 09:19:52,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 09:19:52,576 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 166 transitions. [2019-09-07 09:19:52,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-07 09:19:52,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:19:52,577 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:19:52,578 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:19:52,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:19:52,578 INFO L82 PathProgramCache]: Analyzing trace with hash -108348707, now seen corresponding path program 5 times [2019-09-07 09:19:52,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:19:52,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:19:52,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:52,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:19:52,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:52,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:19:52,730 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 4 proven. 210 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-09-07 09:19:52,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:19:52,731 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 09:19:52,747 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 09:19:52,881 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2019-09-07 09:19:52,882 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:19:52,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 09:19:52,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:19:52,925 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 185 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 09:19:52,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:19:52,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-07 09:19:52,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 09:19:52,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 09:19:52,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 09:19:52,941 INFO L87 Difference]: Start difference. First operand 140 states and 166 transitions. Second operand 16 states. [2019-09-07 09:19:53,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:19:53,057 INFO L93 Difference]: Finished difference Result 191 states and 225 transitions. [2019-09-07 09:19:53,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 09:19:53,059 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 93 [2019-09-07 09:19:53,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:19:53,060 INFO L225 Difference]: With dead ends: 191 [2019-09-07 09:19:53,060 INFO L226 Difference]: Without dead ends: 151 [2019-09-07 09:19:53,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 93 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 09:19:53,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-09-07 09:19:53,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 146. [2019-09-07 09:19:53,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-09-07 09:19:53,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 174 transitions. [2019-09-07 09:19:53,071 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 174 transitions. Word has length 93 [2019-09-07 09:19:53,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:19:53,072 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 174 transitions. [2019-09-07 09:19:53,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 09:19:53,072 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 174 transitions. [2019-09-07 09:19:53,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-07 09:19:53,073 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:19:53,073 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:19:53,073 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:19:53,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:19:53,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1525646586, now seen corresponding path program 6 times [2019-09-07 09:19:53,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:19:53,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:19:53,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:53,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:19:53,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:53,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:19:53,270 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 4 proven. 169 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2019-09-07 09:19:53,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:19:53,271 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) [2019-09-07 09:19:53,305 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:19:53,407 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-09-07 09:19:53,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:19:53,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-07 09:19:53,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:19:53,855 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:19:53,856 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 22 [2019-09-07 09:19:53,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:19:53,858 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:19:53,870 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:19:53,870 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:19:53,870 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:5 [2019-09-07 09:19:53,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:19:53,939 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 35 proven. 72 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-09-07 09:19:53,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:19:53,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 32 [2019-09-07 09:19:53,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-07 09:19:53,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-07 09:19:53,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=792, Unknown=0, NotChecked=0, Total=992 [2019-09-07 09:19:53,945 INFO L87 Difference]: Start difference. First operand 146 states and 174 transitions. Second operand 32 states. [2019-09-07 09:19:57,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:19:57,121 INFO L93 Difference]: Finished difference Result 294 states and 351 transitions. [2019-09-07 09:19:57,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-07 09:19:57,122 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 96 [2019-09-07 09:19:57,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:19:57,124 INFO L225 Difference]: With dead ends: 294 [2019-09-07 09:19:57,124 INFO L226 Difference]: Without dead ends: 181 [2019-09-07 09:19:57,127 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2733 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1763, Invalid=6979, Unknown=0, NotChecked=0, Total=8742 [2019-09-07 09:19:57,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-09-07 09:19:57,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 109. [2019-09-07 09:19:57,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-09-07 09:19:57,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 124 transitions. [2019-09-07 09:19:57,137 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 124 transitions. Word has length 96 [2019-09-07 09:19:57,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:19:57,137 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 124 transitions. [2019-09-07 09:19:57,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-07 09:19:57,137 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 124 transitions. [2019-09-07 09:19:57,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-07 09:19:57,138 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:19:57,139 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:19:57,139 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:19:57,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:19:57,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1330099617, now seen corresponding path program 10 times [2019-09-07 09:19:57,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:19:57,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:19:57,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:57,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:19:57,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:57,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:19:57,291 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 6 proven. 247 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2019-09-07 09:19:57,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:19:57,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 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 09:19:57,302 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:19:57,354 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:19:57,355 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:19:57,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 09:19:57,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:19:57,378 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2019-09-07 09:19:57,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:19:57,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 18 [2019-09-07 09:19:57,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-07 09:19:57,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-07 09:19:57,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=154, Unknown=0, NotChecked=0, Total=306 [2019-09-07 09:19:57,383 INFO L87 Difference]: Start difference. First operand 109 states and 124 transitions. Second operand 18 states. [2019-09-07 09:19:57,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:19:57,502 INFO L93 Difference]: Finished difference Result 191 states and 224 transitions. [2019-09-07 09:19:57,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 09:19:57,503 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 106 [2019-09-07 09:19:57,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:19:57,504 INFO L225 Difference]: With dead ends: 191 [2019-09-07 09:19:57,504 INFO L226 Difference]: Without dead ends: 117 [2019-09-07 09:19:57,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=152, Invalid=154, Unknown=0, NotChecked=0, Total=306 [2019-09-07 09:19:57,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-09-07 09:19:57,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2019-09-07 09:19:57,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-09-07 09:19:57,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 130 transitions. [2019-09-07 09:19:57,514 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 130 transitions. Word has length 106 [2019-09-07 09:19:57,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:19:57,514 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 130 transitions. [2019-09-07 09:19:57,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-07 09:19:57,514 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 130 transitions. [2019-09-07 09:19:57,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-07 09:19:57,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:19:57,516 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:19:57,516 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:19:57,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:19:57,516 INFO L82 PathProgramCache]: Analyzing trace with hash -365347534, now seen corresponding path program 11 times [2019-09-07 09:19:57,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:19:57,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:19:57,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:57,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:19:57,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:57,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:19:57,695 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 6 proven. 287 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-09-07 09:19:57,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:19:57,695 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:19:57,706 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 09:19:57,958 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2019-09-07 09:19:57,959 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:19:57,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 09:19:57,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:19:57,985 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 323 trivial. 0 not checked. [2019-09-07 09:19:57,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:19:57,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 19 [2019-09-07 09:19:57,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 09:19:57,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 09:19:57,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=172, Unknown=0, NotChecked=0, Total=342 [2019-09-07 09:19:57,991 INFO L87 Difference]: Start difference. First operand 114 states and 130 transitions. Second operand 19 states. [2019-09-07 09:19:58,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:19:58,128 INFO L93 Difference]: Finished difference Result 199 states and 234 transitions. [2019-09-07 09:19:58,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 09:19:58,129 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 111 [2019-09-07 09:19:58,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:19:58,130 INFO L225 Difference]: With dead ends: 199 [2019-09-07 09:19:58,130 INFO L226 Difference]: Without dead ends: 122 [2019-09-07 09:19:58,130 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=170, Invalid=172, Unknown=0, NotChecked=0, Total=342 [2019-09-07 09:19:58,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-09-07 09:19:58,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 119. [2019-09-07 09:19:58,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-09-07 09:19:58,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 136 transitions. [2019-09-07 09:19:58,139 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 136 transitions. Word has length 111 [2019-09-07 09:19:58,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:19:58,140 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 136 transitions. [2019-09-07 09:19:58,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 09:19:58,140 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 136 transitions. [2019-09-07 09:19:58,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-07 09:19:58,141 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:19:58,141 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:19:58,141 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:19:58,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:19:58,142 INFO L82 PathProgramCache]: Analyzing trace with hash -632677883, now seen corresponding path program 12 times [2019-09-07 09:19:58,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:19:58,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:19:58,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:58,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:19:58,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:58,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:19:58,326 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 6 proven. 330 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-09-07 09:19:58,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:19:58,327 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 09:19:58,345 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 09:19:58,676 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2019-09-07 09:19:58,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:19:58,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 09:19:58,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:19:58,709 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (24)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 09:19:58,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:19:58,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-09-07 09:19:58,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 09:19:58,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 09:19:58,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-07 09:19:58,716 INFO L87 Difference]: Start difference. First operand 119 states and 136 transitions. Second operand 19 states. [2019-09-07 09:19:58,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:19:58,888 INFO L93 Difference]: Finished difference Result 158 states and 178 transitions. [2019-09-07 09:19:58,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 09:19:58,889 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 116 [2019-09-07 09:19:58,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:19:58,890 INFO L225 Difference]: With dead ends: 158 [2019-09-07 09:19:58,890 INFO L226 Difference]: Without dead ends: 125 [2019-09-07 09:19:58,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 116 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 09:19:58,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-09-07 09:19:58,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2019-09-07 09:19:58,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-09-07 09:19:58,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 140 transitions. [2019-09-07 09:19:58,903 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 140 transitions. Word has length 116 [2019-09-07 09:19:58,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:19:58,903 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 140 transitions. [2019-09-07 09:19:58,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 09:19:58,903 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 140 transitions. [2019-09-07 09:19:58,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-07 09:19:58,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:19:58,905 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:19:58,905 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:19:58,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:19:58,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1330345456, now seen corresponding path program 13 times [2019-09-07 09:19:58,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:19:58,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:19:58,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:58,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:19:58,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:58,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:19:59,203 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 6 proven. 256 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-09-07 09:19:59,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:19:59,204 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 09:19:59,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:19:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:19:59,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 09:19:59,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:19:59,328 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2019-09-07 09:19:59,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:19:59,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-09-07 09:19:59,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 09:19:59,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 09:19:59,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-07 09:19:59,343 INFO L87 Difference]: Start difference. First operand 122 states and 140 transitions. Second operand 20 states. [2019-09-07 09:19:59,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:19:59,534 INFO L93 Difference]: Finished difference Result 210 states and 247 transitions. [2019-09-07 09:19:59,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 09:19:59,535 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 119 [2019-09-07 09:19:59,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:19:59,536 INFO L225 Difference]: With dead ends: 210 [2019-09-07 09:19:59,536 INFO L226 Difference]: Without dead ends: 127 [2019-09-07 09:19:59,538 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-07 09:19:59,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-09-07 09:19:59,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2019-09-07 09:19:59,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-09-07 09:19:59,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 142 transitions. [2019-09-07 09:19:59,546 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 142 transitions. Word has length 119 [2019-09-07 09:19:59,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:19:59,547 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 142 transitions. [2019-09-07 09:19:59,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 09:19:59,547 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 142 transitions. [2019-09-07 09:19:59,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-07 09:19:59,548 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:19:59,548 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:19:59,548 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:19:59,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:19:59,550 INFO L82 PathProgramCache]: Analyzing trace with hash -712675122, now seen corresponding path program 14 times [2019-09-07 09:19:59,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:19:59,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:19:59,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:59,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:19:59,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:59,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:19:59,759 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 6 proven. 376 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2019-09-07 09:19:59,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:19:59,759 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:19:59,770 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 09:19:59,820 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:19:59,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:19:59,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 09:19:59,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:19:59,854 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (26)] Exception during sending of exit command (exit): Stream closed [2019-09-07 09:19:59,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:19:59,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 21 [2019-09-07 09:19:59,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 09:19:59,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 09:19:59,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=211, Unknown=0, NotChecked=0, Total=420 [2019-09-07 09:19:59,859 INFO L87 Difference]: Start difference. First operand 124 states and 142 transitions. Second operand 21 states. [2019-09-07 09:20:00,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:20:00,074 INFO L93 Difference]: Finished difference Result 215 states and 254 transitions. [2019-09-07 09:20:00,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 09:20:00,074 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 121 [2019-09-07 09:20:00,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:20:00,076 INFO L225 Difference]: With dead ends: 215 [2019-09-07 09:20:00,076 INFO L226 Difference]: Without dead ends: 132 [2019-09-07 09:20:00,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=209, Invalid=211, Unknown=0, NotChecked=0, Total=420 [2019-09-07 09:20:00,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-09-07 09:20:00,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 129. [2019-09-07 09:20:00,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-09-07 09:20:00,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 148 transitions. [2019-09-07 09:20:00,091 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 148 transitions. Word has length 121 [2019-09-07 09:20:00,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:20:00,091 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 148 transitions. [2019-09-07 09:20:00,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 09:20:00,092 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 148 transitions. [2019-09-07 09:20:00,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-07 09:20:00,093 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:20:00,093 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:20:00,093 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:20:00,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:20:00,093 INFO L82 PathProgramCache]: Analyzing trace with hash -110502295, now seen corresponding path program 15 times [2019-09-07 09:20:00,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:20:00,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:20:00,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:20:00,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:20:00,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:20:00,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:20:00,343 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 6 proven. 425 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2019-09-07 09:20:00,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:20:00,344 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) [2019-09-07 09:20:00,370 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:20:00,431 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-07 09:20:00,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:20:00,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-07 09:20:00,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:20:00,634 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-07 09:20:00,635 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:20:00,640 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:20:00,641 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:20:00,641 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-07 09:20:00,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:20:00,732 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 11 proven. 143 refuted. 0 times theorem prover too weak. 631 trivial. 0 not checked. [2019-09-07 09:20:00,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:20:00,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 35 [2019-09-07 09:20:00,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-07 09:20:00,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-07 09:20:00,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=905, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 09:20:00,737 INFO L87 Difference]: Start difference. First operand 129 states and 148 transitions. Second operand 35 states. [2019-09-07 09:20:02,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:20:02,416 INFO L93 Difference]: Finished difference Result 238 states and 282 transitions. [2019-09-07 09:20:02,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-07 09:20:02,416 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 126 [2019-09-07 09:20:02,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:20:02,417 INFO L225 Difference]: With dead ends: 238 [2019-09-07 09:20:02,417 INFO L226 Difference]: Without dead ends: 205 [2019-09-07 09:20:02,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1425 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1222, Invalid=4630, Unknown=0, NotChecked=0, Total=5852 [2019-09-07 09:20:02,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-09-07 09:20:02,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 195. [2019-09-07 09:20:02,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-07 09:20:02,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 233 transitions. [2019-09-07 09:20:02,441 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 233 transitions. Word has length 126 [2019-09-07 09:20:02,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:20:02,442 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 233 transitions. [2019-09-07 09:20:02,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-07 09:20:02,442 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 233 transitions. [2019-09-07 09:20:02,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-07 09:20:02,444 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:20:02,444 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:20:02,444 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:20:02,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:20:02,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1164128010, now seen corresponding path program 7 times [2019-09-07 09:20:02,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:20:02,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:20:02,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:20:02,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:20:02,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:20:02,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:20:02,793 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 6 proven. 324 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked. [2019-09-07 09:20:02,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:20:02,794 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 09:20:02,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:20:02,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:20:02,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 09:20:02,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:20:02,929 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (28)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 09:20:02,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:20:02,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-09-07 09:20:02,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-07 09:20:02,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-07 09:20:02,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-07 09:20:02,936 INFO L87 Difference]: Start difference. First operand 195 states and 233 transitions. Second operand 22 states. [2019-09-07 09:20:03,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:20:03,223 INFO L93 Difference]: Finished difference Result 354 states and 432 transitions. [2019-09-07 09:20:03,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 09:20:03,224 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 129 [2019-09-07 09:20:03,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:20:03,226 INFO L225 Difference]: With dead ends: 354 [2019-09-07 09:20:03,226 INFO L226 Difference]: Without dead ends: 202 [2019-09-07 09:20:03,228 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 129 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 09:20:03,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-09-07 09:20:03,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 197. [2019-09-07 09:20:03,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-07 09:20:03,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 235 transitions. [2019-09-07 09:20:03,252 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 235 transitions. Word has length 129 [2019-09-07 09:20:03,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:20:03,252 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 235 transitions. [2019-09-07 09:20:03,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-07 09:20:03,253 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 235 transitions. [2019-09-07 09:20:03,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-07 09:20:03,255 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:20:03,256 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 17, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:20:03,256 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:20:03,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:20:03,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1925206936, now seen corresponding path program 8 times [2019-09-07 09:20:03,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:20:03,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:20:03,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:20:03,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:20:03,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:20:03,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:20:03,561 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 6 proven. 477 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2019-09-07 09:20:03,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:20:03,562 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) [2019-09-07 09:20:03,574 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:20:03,624 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:20:03,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:20:03,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-07 09:20:03,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:20:03,652 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2019-09-07 09:20:03,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:20:03,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 23 [2019-09-07 09:20:03,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-07 09:20:03,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-07 09:20:03,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=254, Unknown=0, NotChecked=0, Total=506 [2019-09-07 09:20:03,657 INFO L87 Difference]: Start difference. First operand 197 states and 235 transitions. Second operand 23 states. [2019-09-07 09:20:03,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:20:03,846 INFO L93 Difference]: Finished difference Result 362 states and 444 transitions. [2019-09-07 09:20:03,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 09:20:03,847 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 131 [2019-09-07 09:20:03,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:20:03,848 INFO L225 Difference]: With dead ends: 362 [2019-09-07 09:20:03,848 INFO L226 Difference]: Without dead ends: 210 [2019-09-07 09:20:03,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=252, Invalid=254, Unknown=0, NotChecked=0, Total=506 [2019-09-07 09:20:03,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-09-07 09:20:03,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 205. [2019-09-07 09:20:03,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-09-07 09:20:03,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 245 transitions. [2019-09-07 09:20:03,864 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 245 transitions. Word has length 131 [2019-09-07 09:20:03,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:20:03,865 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 245 transitions. [2019-09-07 09:20:03,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-07 09:20:03,865 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 245 transitions. [2019-09-07 09:20:03,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-07 09:20:03,866 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:20:03,866 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 18, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:20:03,866 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:20:03,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:20:03,867 INFO L82 PathProgramCache]: Analyzing trace with hash 459393739, now seen corresponding path program 9 times [2019-09-07 09:20:03,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:20:03,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:20:03,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:20:03,868 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:20:03,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:20:03,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:20:04,159 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 6 proven. 532 refuted. 0 times theorem prover too weak. 430 trivial. 0 not checked. [2019-09-07 09:20:04,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:20:04,159 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:20:04,177 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:20:04,249 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-07 09:20:04,249 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:20:04,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-07 09:20:04,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:20:04,911 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:20:04,912 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 22 [2019-09-07 09:20:04,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:20:04,913 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:20:04,917 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:20:04,918 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:20:04,918 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:5 [2019-09-07 09:20:04,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:20:05,026 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 53 proven. 164 refuted. 0 times theorem prover too weak. 751 trivial. 0 not checked. [2019-09-07 09:20:05,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:20:05,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 40 [2019-09-07 09:20:05,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-07 09:20:05,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-07 09:20:05,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=352, Invalid=1208, Unknown=0, NotChecked=0, Total=1560 [2019-09-07 09:20:05,031 INFO L87 Difference]: Start difference. First operand 205 states and 245 transitions. Second operand 40 states. [2019-09-07 09:20:14,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:20:14,720 INFO L93 Difference]: Finished difference Result 299 states and 346 transitions. [2019-09-07 09:20:14,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-09-07 09:20:14,721 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 136 [2019-09-07 09:20:14,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:20:14,723 INFO L225 Difference]: With dead ends: 299 [2019-09-07 09:20:14,723 INFO L226 Difference]: Without dead ends: 247 [2019-09-07 09:20:14,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 121 SyntacticMatches, 5 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6027 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=3774, Invalid=13782, Unknown=0, NotChecked=0, Total=17556 [2019-09-07 09:20:14,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-09-07 09:20:14,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 150. [2019-09-07 09:20:14,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-07 09:20:14,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 172 transitions. [2019-09-07 09:20:14,741 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 172 transitions. Word has length 136 [2019-09-07 09:20:14,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:20:14,741 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 172 transitions. [2019-09-07 09:20:14,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-07 09:20:14,741 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 172 transitions. [2019-09-07 09:20:14,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-07 09:20:14,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:20:14,743 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:20:14,743 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:20:14,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:20:14,743 INFO L82 PathProgramCache]: Analyzing trace with hash -706194465, now seen corresponding path program 16 times [2019-09-07 09:20:14,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:20:14,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:20:14,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:20:14,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:20:14,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:20:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:20:14,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1054 backedges. 8 proven. 400 refuted. 0 times theorem prover too weak. 646 trivial. 0 not checked. [2019-09-07 09:20:14,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:20:14,995 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 09:20:15,005 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:20:15,062 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:20:15,062 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:20:15,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-07 09:20:15,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:20:15,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1054 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 654 trivial. 0 not checked. [2019-09-07 09:20:15,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:20:15,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-09-07 09:20:15,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-07 09:20:15,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-07 09:20:15,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-07 09:20:15,098 INFO L87 Difference]: Start difference. First operand 150 states and 172 transitions. Second operand 24 states. [2019-09-07 09:20:15,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:20:15,297 INFO L93 Difference]: Finished difference Result 258 states and 303 transitions. [2019-09-07 09:20:15,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 09:20:15,298 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 147 [2019-09-07 09:20:15,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:20:15,299 INFO L225 Difference]: With dead ends: 258 [2019-09-07 09:20:15,299 INFO L226 Difference]: Without dead ends: 155 [2019-09-07 09:20:15,300 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-07 09:20:15,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-09-07 09:20:15,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2019-09-07 09:20:15,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-07 09:20:15,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 174 transitions. [2019-09-07 09:20:15,313 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 174 transitions. Word has length 147 [2019-09-07 09:20:15,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:20:15,313 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 174 transitions. [2019-09-07 09:20:15,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-07 09:20:15,314 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 174 transitions. [2019-09-07 09:20:15,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-07 09:20:15,327 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:20:15,327 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:20:15,328 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:20:15,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:20:15,328 INFO L82 PathProgramCache]: Analyzing trace with hash 353334717, now seen corresponding path program 17 times [2019-09-07 09:20:15,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:20:15,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:20:15,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:20:15,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:20:15,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:20:15,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:20:15,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1095 backedges. 8 proven. 590 refuted. 0 times theorem prover too weak. 497 trivial. 0 not checked. [2019-09-07 09:20:15,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:20:15,628 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:20:15,648 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 09:20:16,459 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2019-09-07 09:20:16,460 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:20:16,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-07 09:20:16,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:20:16,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1095 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 505 trivial. 0 not checked. [2019-09-07 09:20:16,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:20:16,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-09-07 09:20:16,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-07 09:20:16,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-07 09:20:16,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-07 09:20:16,506 INFO L87 Difference]: Start difference. First operand 152 states and 174 transitions. Second operand 24 states. [2019-09-07 09:20:16,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:20:16,702 INFO L93 Difference]: Finished difference Result 199 states and 224 transitions. [2019-09-07 09:20:16,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-07 09:20:16,703 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 149 [2019-09-07 09:20:16,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:20:16,705 INFO L225 Difference]: With dead ends: 199 [2019-09-07 09:20:16,705 INFO L226 Difference]: Without dead ends: 158 [2019-09-07 09:20:16,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-07 09:20:16,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-09-07 09:20:16,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 155. [2019-09-07 09:20:16,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-09-07 09:20:16,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 178 transitions. [2019-09-07 09:20:16,717 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 178 transitions. Word has length 149 [2019-09-07 09:20:16,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:20:16,717 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 178 transitions. [2019-09-07 09:20:16,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-07 09:20:16,717 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 178 transitions. [2019-09-07 09:20:16,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-07 09:20:16,718 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:20:16,719 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:20:16,719 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:20:16,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:20:16,719 INFO L82 PathProgramCache]: Analyzing trace with hash 34877702, now seen corresponding path program 18 times [2019-09-07 09:20:16,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:20:16,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:20:16,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:20:16,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:20:16,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:20:16,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:20:17,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 8 proven. 441 refuted. 0 times theorem prover too weak. 707 trivial. 0 not checked. [2019-09-07 09:20:17,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:20:17,029 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:20:17,040 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 09:20:19,052 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2019-09-07 09:20:19,053 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:20:19,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 09:20:19,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:20:19,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2019-09-07 09:20:19,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:20:19,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-09-07 09:20:19,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-07 09:20:19,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-07 09:20:19,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-07 09:20:19,092 INFO L87 Difference]: Start difference. First operand 155 states and 178 transitions. Second operand 25 states. [2019-09-07 09:20:19,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:20:19,286 INFO L93 Difference]: Finished difference Result 266 states and 313 transitions. [2019-09-07 09:20:19,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-07 09:20:19,287 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 152 [2019-09-07 09:20:19,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:20:19,288 INFO L225 Difference]: With dead ends: 266 [2019-09-07 09:20:19,289 INFO L226 Difference]: Without dead ends: 160 [2019-09-07 09:20:19,290 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-07 09:20:19,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-09-07 09:20:19,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 157. [2019-09-07 09:20:19,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-09-07 09:20:19,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 180 transitions. [2019-09-07 09:20:19,306 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 180 transitions. Word has length 152 [2019-09-07 09:20:19,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:20:19,307 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 180 transitions. [2019-09-07 09:20:19,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-07 09:20:19,307 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 180 transitions. [2019-09-07 09:20:19,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-07 09:20:19,308 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:20:19,308 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:20:19,309 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:20:19,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:20:19,309 INFO L82 PathProgramCache]: Analyzing trace with hash -301102616, now seen corresponding path program 19 times [2019-09-07 09:20:19,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:20:19,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:20:19,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:20:19,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:20:19,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:20:19,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:20:19,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 8 proven. 651 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2019-09-07 09:20:19,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:20:19,588 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 09:20:19,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:20:19,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:20:19,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-07 09:20:19,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:20:19,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (34)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 09:20:19,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:20:19,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 26 [2019-09-07 09:20:19,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-07 09:20:19,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-07 09:20:19,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=326, Unknown=0, NotChecked=0, Total=650 [2019-09-07 09:20:19,708 INFO L87 Difference]: Start difference. First operand 157 states and 180 transitions. Second operand 26 states. [2019-09-07 09:20:19,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:20:19,892 INFO L93 Difference]: Finished difference Result 271 states and 320 transitions. [2019-09-07 09:20:19,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-07 09:20:19,893 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 154 [2019-09-07 09:20:19,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:20:19,894 INFO L225 Difference]: With dead ends: 271 [2019-09-07 09:20:19,894 INFO L226 Difference]: Without dead ends: 165 [2019-09-07 09:20:19,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=324, Invalid=326, Unknown=0, NotChecked=0, Total=650 [2019-09-07 09:20:19,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-09-07 09:20:19,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 162. [2019-09-07 09:20:19,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-09-07 09:20:19,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 186 transitions. [2019-09-07 09:20:19,908 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 186 transitions. Word has length 154 [2019-09-07 09:20:19,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:20:19,908 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 186 transitions. [2019-09-07 09:20:19,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-07 09:20:19,909 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 186 transitions. [2019-09-07 09:20:19,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-07 09:20:19,910 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:20:19,910 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:20:19,910 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:20:19,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:20:19,911 INFO L82 PathProgramCache]: Analyzing trace with hash -45740711, now seen corresponding path program 20 times [2019-09-07 09:20:19,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:20:19,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:20:19,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:20:19,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:20:19,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:20:19,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:20:20,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1308 backedges. 8 proven. 715 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2019-09-07 09:20:20,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:20:20,340 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:20:20,382 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 09:20:20,466 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:20:20,466 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:20:20,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-07 09:20:20,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:20:20,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1308 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 779 trivial. 0 not checked. [2019-09-07 09:20:20,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:20:20,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 27 [2019-09-07 09:20:20,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-07 09:20:20,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-07 09:20:20,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=350, Invalid=352, Unknown=0, NotChecked=0, Total=702 [2019-09-07 09:20:20,527 INFO L87 Difference]: Start difference. First operand 162 states and 186 transitions. Second operand 27 states. [2019-09-07 09:20:20,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:20:20,822 INFO L93 Difference]: Finished difference Result 279 states and 330 transitions. [2019-09-07 09:20:20,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 09:20:20,822 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 159 [2019-09-07 09:20:20,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:20:20,824 INFO L225 Difference]: With dead ends: 279 [2019-09-07 09:20:20,824 INFO L226 Difference]: Without dead ends: 170 [2019-09-07 09:20:20,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=350, Invalid=352, Unknown=0, NotChecked=0, Total=702 [2019-09-07 09:20:20,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-09-07 09:20:20,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 167. [2019-09-07 09:20:20,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-07 09:20:20,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 192 transitions. [2019-09-07 09:20:20,839 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 192 transitions. Word has length 159 [2019-09-07 09:20:20,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:20:20,840 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 192 transitions. [2019-09-07 09:20:20,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-07 09:20:20,841 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 192 transitions. [2019-09-07 09:20:20,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-07 09:20:20,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:20:20,842 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:20:20,842 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:20:20,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:20:20,843 INFO L82 PathProgramCache]: Analyzing trace with hash 52054604, now seen corresponding path program 21 times [2019-09-07 09:20:20,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:20:20,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:20:20,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:20:20,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:20:20,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:20:20,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:20:21,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1422 backedges. 8 proven. 782 refuted. 0 times theorem prover too weak. 632 trivial. 0 not checked. [2019-09-07 09:20:21,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:20:21,231 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 09:20:21,244 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:20:21,338 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-07 09:20:21,338 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:20:21,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-07 09:20:21,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:20:21,773 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-07 09:20:21,773 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:20:21,775 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:20:21,776 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:20:21,776 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-07 09:20:21,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:20:22,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1422 backedges. 16 proven. 264 refuted. 0 times theorem prover too weak. 1142 trivial. 0 not checked. [2019-09-07 09:20:22,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:20:22,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 19] total 43 [2019-09-07 09:20:22,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-07 09:20:22,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-07 09:20:22,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=466, Invalid=1340, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 09:20:22,016 INFO L87 Difference]: Start difference. First operand 167 states and 192 transitions. Second operand 43 states. [2019-09-07 09:20:24,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:20:24,472 INFO L93 Difference]: Finished difference Result 303 states and 359 transitions. [2019-09-07 09:20:24,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-07 09:20:24,473 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 164 [2019-09-07 09:20:24,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:20:24,475 INFO L225 Difference]: With dead ends: 303 [2019-09-07 09:20:24,475 INFO L226 Difference]: Without dead ends: 262 [2019-09-07 09:20:24,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2327 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2018, Invalid=7294, Unknown=0, NotChecked=0, Total=9312 [2019-09-07 09:20:24,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-09-07 09:20:24,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 252. [2019-09-07 09:20:24,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-09-07 09:20:24,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 302 transitions. [2019-09-07 09:20:24,495 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 302 transitions. Word has length 164 [2019-09-07 09:20:24,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:20:24,495 INFO L475 AbstractCegarLoop]: Abstraction has 252 states and 302 transitions. [2019-09-07 09:20:24,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-07 09:20:24,495 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 302 transitions. [2019-09-07 09:20:24,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-07 09:20:24,497 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:20:24,497 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:20:24,497 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:20:24,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:20:24,497 INFO L82 PathProgramCache]: Analyzing trace with hash 657033237, now seen corresponding path program 10 times [2019-09-07 09:20:24,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:20:24,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:20:24,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:20:24,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:20:24,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:20:24,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:20:24,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1492 backedges. 8 proven. 576 refuted. 0 times theorem prover too weak. 908 trivial. 0 not checked. [2019-09-07 09:20:24,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:20:24,901 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) [2019-09-07 09:20:24,915 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:20:24,980 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:20:24,981 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:20:24,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-07 09:20:24,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:20:25,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1492 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 916 trivial. 0 not checked. [2019-09-07 09:20:25,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:20:25,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-09-07 09:20:25,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-07 09:20:25,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-07 09:20:25,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-07 09:20:25,023 INFO L87 Difference]: Start difference. First operand 252 states and 302 transitions. Second operand 28 states. [2019-09-07 09:20:25,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:20:25,256 INFO L93 Difference]: Finished difference Result 456 states and 558 transitions. [2019-09-07 09:20:25,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 09:20:25,256 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 167 [2019-09-07 09:20:25,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:20:25,258 INFO L225 Difference]: With dead ends: 456 [2019-09-07 09:20:25,258 INFO L226 Difference]: Without dead ends: 259 [2019-09-07 09:20:25,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-07 09:20:25,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-09-07 09:20:25,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 254. [2019-09-07 09:20:25,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-09-07 09:20:25,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 304 transitions. [2019-09-07 09:20:25,279 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 304 transitions. Word has length 167 [2019-09-07 09:20:25,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:20:25,279 INFO L475 AbstractCegarLoop]: Abstraction has 254 states and 304 transitions. [2019-09-07 09:20:25,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-07 09:20:25,279 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 304 transitions. [2019-09-07 09:20:25,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-07 09:20:25,281 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:20:25,281 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 23, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:20:25,281 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:20:25,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:20:25,281 INFO L82 PathProgramCache]: Analyzing trace with hash -249884941, now seen corresponding path program 11 times [2019-09-07 09:20:25,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:20:25,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:20:25,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:20:25,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:20:25,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:20:25,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:20:25,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1541 backedges. 8 proven. 852 refuted. 0 times theorem prover too weak. 681 trivial. 0 not checked. [2019-09-07 09:20:25,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:20:25,750 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 09:20:25,766 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:20:29,526 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2019-09-07 09:20:29,527 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:20:29,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-07 09:20:29,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:20:29,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1541 backedges. 0 proven. 852 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-09-07 09:20:29,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:20:29,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-09-07 09:20:29,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-07 09:20:29,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-07 09:20:29,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-07 09:20:29,605 INFO L87 Difference]: Start difference. First operand 254 states and 304 transitions. Second operand 28 states. [2019-09-07 09:20:29,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:20:29,863 INFO L93 Difference]: Finished difference Result 329 states and 389 transitions. [2019-09-07 09:20:29,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-07 09:20:29,864 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 169 [2019-09-07 09:20:29,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:20:29,866 INFO L225 Difference]: With dead ends: 329 [2019-09-07 09:20:29,866 INFO L226 Difference]: Without dead ends: 265 [2019-09-07 09:20:29,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-07 09:20:29,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-09-07 09:20:29,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 260. [2019-09-07 09:20:29,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-07 09:20:29,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 312 transitions. [2019-09-07 09:20:29,889 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 312 transitions. Word has length 169 [2019-09-07 09:20:29,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:20:29,890 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 312 transitions. [2019-09-07 09:20:29,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-07 09:20:29,890 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 312 transitions. [2019-09-07 09:20:29,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-07 09:20:29,892 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:20:29,892 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:20:29,892 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:20:29,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:20:29,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1483145420, now seen corresponding path program 12 times [2019-09-07 09:20:29,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:20:29,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:20:29,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:20:29,894 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:20:29,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:20:29,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:20:30,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1614 backedges. 8 proven. 625 refuted. 0 times theorem prover too weak. 981 trivial. 0 not checked. [2019-09-07 09:20:30,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:20:30,382 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 09:20:30,408 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 09:20:33,016 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2019-09-07 09:20:33,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:20:33,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-07 09:20:33,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:20:33,822 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:20:33,823 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 22 [2019-09-07 09:20:33,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:20:33,824 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:20:33,828 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:20:33,829 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:20:33,829 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:5 [2019-09-07 09:20:33,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:20:33,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1614 backedges. 71 proven. 293 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2019-09-07 09:20:33,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:20:33,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 22] total 48 [2019-09-07 09:20:33,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-07 09:20:33,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-07 09:20:33,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=545, Invalid=1711, Unknown=0, NotChecked=0, Total=2256 [2019-09-07 09:20:33,969 INFO L87 Difference]: Start difference. First operand 260 states and 312 transitions. Second operand 48 states. [2019-09-07 09:20:40,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:20:40,103 INFO L93 Difference]: Finished difference Result 506 states and 609 transitions. [2019-09-07 09:20:40,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2019-09-07 09:20:40,104 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 172 [2019-09-07 09:20:40,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:20:40,106 INFO L225 Difference]: With dead ends: 506 [2019-09-07 09:20:40,106 INFO L226 Difference]: Without dead ends: 303 [2019-09-07 09:20:40,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 146 SyntacticMatches, 7 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8919 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=5527, Invalid=19913, Unknown=0, NotChecked=0, Total=25440 [2019-09-07 09:20:40,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-09-07 09:20:40,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 185. [2019-09-07 09:20:40,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-09-07 09:20:40,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 212 transitions. [2019-09-07 09:20:40,124 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 212 transitions. Word has length 172 [2019-09-07 09:20:40,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:20:40,124 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 212 transitions. [2019-09-07 09:20:40,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-07 09:20:40,124 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 212 transitions. [2019-09-07 09:20:40,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-07 09:20:40,125 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:20:40,126 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:20:40,126 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:20:40,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:20:40,126 INFO L82 PathProgramCache]: Analyzing trace with hash -405766553, now seen corresponding path program 22 times [2019-09-07 09:20:40,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:20:40,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:20:40,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:20:40,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:20:40,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:20:40,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:20:40,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1701 backedges. 10 proven. 925 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2019-09-07 09:20:40,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:20:40,505 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 09:20:40,516 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:20:40,583 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:20:40,584 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:20:40,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-07 09:20:40,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:20:40,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1701 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 1025 trivial. 0 not checked. [2019-09-07 09:20:40,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:20:40,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 30 [2019-09-07 09:20:40,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-07 09:20:40,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-07 09:20:40,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=434, Invalid=436, Unknown=0, NotChecked=0, Total=870 [2019-09-07 09:20:40,634 INFO L87 Difference]: Start difference. First operand 185 states and 212 transitions. Second operand 30 states. [2019-09-07 09:20:40,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:20:40,876 INFO L93 Difference]: Finished difference Result 319 states and 376 transitions. [2019-09-07 09:20:40,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-07 09:20:40,876 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 182 [2019-09-07 09:20:40,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:20:40,878 INFO L225 Difference]: With dead ends: 319 [2019-09-07 09:20:40,878 INFO L226 Difference]: Without dead ends: 193 [2019-09-07 09:20:40,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=434, Invalid=436, Unknown=0, NotChecked=0, Total=870 [2019-09-07 09:20:40,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-09-07 09:20:40,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 190. [2019-09-07 09:20:40,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-07 09:20:40,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 218 transitions. [2019-09-07 09:20:40,893 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 218 transitions. Word has length 182 [2019-09-07 09:20:40,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:20:40,893 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 218 transitions. [2019-09-07 09:20:40,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-07 09:20:40,893 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 218 transitions. [2019-09-07 09:20:40,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-07 09:20:40,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:20:40,894 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:20:40,895 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:20:40,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:20:40,895 INFO L82 PathProgramCache]: Analyzing trace with hash 2020400968, now seen corresponding path program 23 times [2019-09-07 09:20:40,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:20:40,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:20:40,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:20:40,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:20:40,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:20:40,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:20:41,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 10 proven. 1001 refuted. 0 times theorem prover too weak. 819 trivial. 0 not checked. [2019-09-07 09:20:41,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:20:41,256 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:20:41,271 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 09:20:43,020 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 28 check-sat command(s) [2019-09-07 09:20:43,020 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:20:43,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-07 09:20:43,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:20:43,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 829 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (41)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 09:20:43,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:20:43,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-09-07 09:20:43,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-07 09:20:43,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-07 09:20:43,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-07 09:20:43,095 INFO L87 Difference]: Start difference. First operand 190 states and 218 transitions. Second operand 30 states. [2019-09-07 09:20:43,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:20:43,350 INFO L93 Difference]: Finished difference Result 245 states and 276 transitions. [2019-09-07 09:20:43,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-07 09:20:43,351 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 187 [2019-09-07 09:20:43,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:20:43,353 INFO L225 Difference]: With dead ends: 245 [2019-09-07 09:20:43,353 INFO L226 Difference]: Without dead ends: 196 [2019-09-07 09:20:43,354 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-07 09:20:43,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-09-07 09:20:43,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 193. [2019-09-07 09:20:43,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-09-07 09:20:43,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 222 transitions. [2019-09-07 09:20:43,370 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 222 transitions. Word has length 187 [2019-09-07 09:20:43,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:20:43,370 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 222 transitions. [2019-09-07 09:20:43,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-07 09:20:43,371 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 222 transitions. [2019-09-07 09:20:43,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-07 09:20:43,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:20:43,372 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:20:43,372 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:20:43,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:20:43,373 INFO L82 PathProgramCache]: Analyzing trace with hash -440534167, now seen corresponding path program 24 times [2019-09-07 09:20:43,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:20:43,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:20:43,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:20:43,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:20:43,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:20:43,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:20:43,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1909 backedges. 10 proven. 729 refuted. 0 times theorem prover too weak. 1170 trivial. 0 not checked. [2019-09-07 09:20:43,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:20:43,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 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:20:43,804 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 09:20:46,195 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2019-09-07 09:20:46,195 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:20:46,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-07 09:20:46,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:20:46,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1909 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (42)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 09:20:46,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:20:46,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-09-07 09:20:46,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-07 09:20:46,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-07 09:20:46,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-07 09:20:46,256 INFO L87 Difference]: Start difference. First operand 193 states and 222 transitions. Second operand 31 states. [2019-09-07 09:20:46,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:20:46,579 INFO L93 Difference]: Finished difference Result 330 states and 389 transitions. [2019-09-07 09:20:46,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-07 09:20:46,580 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 190 [2019-09-07 09:20:46,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:20:46,582 INFO L225 Difference]: With dead ends: 330 [2019-09-07 09:20:46,582 INFO L226 Difference]: Without dead ends: 198 [2019-09-07 09:20:46,583 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-07 09:20:46,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-09-07 09:20:46,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 195. [2019-09-07 09:20:46,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-07 09:20:46,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 224 transitions. [2019-09-07 09:20:46,603 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 224 transitions. Word has length 190 [2019-09-07 09:20:46,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:20:46,603 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 224 transitions. [2019-09-07 09:20:46,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-07 09:20:46,604 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 224 transitions. [2019-09-07 09:20:46,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-07 09:20:46,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:20:46,606 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 27, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:20:46,607 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:20:46,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:20:46,607 INFO L82 PathProgramCache]: Analyzing trace with hash -691037493, now seen corresponding path program 25 times [2019-09-07 09:20:46,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:20:46,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:20:46,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:20:46,609 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:20:46,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:20:46,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:20:47,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1964 backedges. 10 proven. 1080 refuted. 0 times theorem prover too weak. 874 trivial. 0 not checked. [2019-09-07 09:20:47,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:20:47,159 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:20:47,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:20:47,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:20:47,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-07 09:20:47,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:20:47,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1964 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2019-09-07 09:20:47,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:20:47,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31] total 32 [2019-09-07 09:20:47,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-07 09:20:47,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-07 09:20:47,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=495, Invalid=497, Unknown=0, NotChecked=0, Total=992 [2019-09-07 09:20:47,290 INFO L87 Difference]: Start difference. First operand 195 states and 224 transitions. Second operand 32 states. [2019-09-07 09:20:47,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:20:47,532 INFO L93 Difference]: Finished difference Result 335 states and 396 transitions. [2019-09-07 09:20:47,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-07 09:20:47,533 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 192 [2019-09-07 09:20:47,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:20:47,535 INFO L225 Difference]: With dead ends: 335 [2019-09-07 09:20:47,535 INFO L226 Difference]: Without dead ends: 203 [2019-09-07 09:20:47,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=495, Invalid=497, Unknown=0, NotChecked=0, Total=992 [2019-09-07 09:20:47,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-09-07 09:20:47,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 200. [2019-09-07 09:20:47,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-07 09:20:47,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 230 transitions. [2019-09-07 09:20:47,555 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 230 transitions. Word has length 192 [2019-09-07 09:20:47,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:20:47,555 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 230 transitions. [2019-09-07 09:20:47,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-07 09:20:47,556 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 230 transitions. [2019-09-07 09:20:47,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-07 09:20:47,557 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:20:47,557 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 28, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:20:47,557 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:20:47,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:20:47,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1263691036, now seen corresponding path program 26 times [2019-09-07 09:20:47,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:20:47,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:20:47,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:20:47,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:20:47,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:20:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:20:48,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2103 backedges. 10 proven. 1162 refuted. 0 times theorem prover too weak. 931 trivial. 0 not checked. [2019-09-07 09:20:48,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:20:48,067 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:20:48,088 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:20:48,158 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:20:48,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:20:48,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-07 09:20:48,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:20:48,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2103 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 1262 trivial. 0 not checked. [2019-09-07 09:20:48,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:20:48,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32] total 33 [2019-09-07 09:20:48,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-07 09:20:48,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-07 09:20:48,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=527, Invalid=529, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 09:20:48,220 INFO L87 Difference]: Start difference. First operand 200 states and 230 transitions. Second operand 33 states. [2019-09-07 09:20:48,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:20:48,481 INFO L93 Difference]: Finished difference Result 343 states and 406 transitions. [2019-09-07 09:20:48,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-07 09:20:48,482 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 197 [2019-09-07 09:20:48,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:20:48,484 INFO L225 Difference]: With dead ends: 343 [2019-09-07 09:20:48,484 INFO L226 Difference]: Without dead ends: 208 [2019-09-07 09:20:48,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=527, Invalid=529, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 09:20:48,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-09-07 09:20:48,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 205. [2019-09-07 09:20:48,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-09-07 09:20:48,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 236 transitions. [2019-09-07 09:20:48,500 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 236 transitions. Word has length 197 [2019-09-07 09:20:48,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:20:48,500 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 236 transitions. [2019-09-07 09:20:48,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-07 09:20:48,501 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 236 transitions. [2019-09-07 09:20:48,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-07 09:20:48,502 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:20:48,502 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 29, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:20:48,502 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:20:48,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:20:48,503 INFO L82 PathProgramCache]: Analyzing trace with hash 824809263, now seen corresponding path program 27 times [2019-09-07 09:20:48,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:20:48,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:20:48,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:20:48,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:20:48,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:20:48,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:20:48,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2247 backedges. 10 proven. 1247 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-09-07 09:20:48,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:20:48,955 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:20:48,966 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:20:49,167 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-07 09:20:49,167 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:20:49,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-07 09:20:49,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:20:49,616 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-07 09:20:49,617 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:20:49,618 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:20:49,618 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:20:49,618 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-07 09:20:49,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:20:49,759 INFO L134 CoverageAnalysis]: Checked inductivity of 2247 backedges. 21 proven. 422 refuted. 0 times theorem prover too weak. 1804 trivial. 0 not checked. [2019-09-07 09:20:49,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:20:49,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 21] total 51 [2019-09-07 09:20:49,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-07 09:20:49,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-07 09:20:49,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=694, Invalid=1856, Unknown=0, NotChecked=0, Total=2550 [2019-09-07 09:20:49,765 INFO L87 Difference]: Start difference. First operand 205 states and 236 transitions. Second operand 51 states. [2019-09-07 09:20:52,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:20:52,991 INFO L93 Difference]: Finished difference Result 368 states and 436 transitions. [2019-09-07 09:20:52,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-07 09:20:52,991 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 202 [2019-09-07 09:20:52,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:20:52,994 INFO L225 Difference]: With dead ends: 368 [2019-09-07 09:20:52,995 INFO L226 Difference]: Without dead ends: 319 [2019-09-07 09:20:52,996 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3445 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3019, Invalid=10553, Unknown=0, NotChecked=0, Total=13572 [2019-09-07 09:20:52,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-09-07 09:20:53,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 309. [2019-09-07 09:20:53,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-09-07 09:20:53,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 371 transitions. [2019-09-07 09:20:53,022 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 371 transitions. Word has length 202 [2019-09-07 09:20:53,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:20:53,023 INFO L475 AbstractCegarLoop]: Abstraction has 309 states and 371 transitions. [2019-09-07 09:20:53,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-07 09:20:53,023 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 371 transitions. [2019-09-07 09:20:53,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-07 09:20:53,024 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:20:53,025 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 29, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:20:53,025 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:20:53,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:20:53,025 INFO L82 PathProgramCache]: Analyzing trace with hash -133713376, now seen corresponding path program 13 times [2019-09-07 09:20:53,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:20:53,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:20:53,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:20:53,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:20:53,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:20:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:20:53,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2335 backedges. 10 proven. 900 refuted. 0 times theorem prover too weak. 1425 trivial. 0 not checked. [2019-09-07 09:20:53,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:20:53,482 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:20:53,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:20:53,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:20:53,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-07 09:20:53,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:20:53,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2335 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 1435 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (46)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 09:20:53,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:20:53,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-09-07 09:20:53,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-07 09:20:53,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-07 09:20:53,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 09:20:53,632 INFO L87 Difference]: Start difference. First operand 309 states and 371 transitions. Second operand 34 states. [2019-09-07 09:20:53,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:20:53,914 INFO L93 Difference]: Finished difference Result 558 states and 684 transitions. [2019-09-07 09:20:53,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-07 09:20:53,914 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 205 [2019-09-07 09:20:53,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:20:53,915 INFO L225 Difference]: With dead ends: 558 [2019-09-07 09:20:53,916 INFO L226 Difference]: Without dead ends: 316 [2019-09-07 09:20:53,916 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 09:20:53,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-09-07 09:20:53,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 311. [2019-09-07 09:20:53,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-09-07 09:20:53,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 373 transitions. [2019-09-07 09:20:53,942 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 373 transitions. Word has length 205 [2019-09-07 09:20:53,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:20:53,943 INFO L475 AbstractCegarLoop]: Abstraction has 311 states and 373 transitions. [2019-09-07 09:20:53,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-07 09:20:53,943 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 373 transitions. [2019-09-07 09:20:53,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-07 09:20:53,945 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:20:53,945 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 29, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:20:53,945 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:20:53,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:20:53,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1787092354, now seen corresponding path program 14 times [2019-09-07 09:20:53,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:20:53,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:20:53,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:20:53,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:20:53,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:20:53,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:20:54,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2396 backedges. 10 proven. 1335 refuted. 0 times theorem prover too weak. 1051 trivial. 0 not checked. [2019-09-07 09:20:54,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:20:54,447 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:20:54,457 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 09:20:54,545 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:20:54,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:20:54,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-07 09:20:54,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:20:54,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2396 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1435 trivial. 0 not checked. [2019-09-07 09:20:54,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:20:54,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 34] total 35 [2019-09-07 09:20:54,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-07 09:20:54,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-07 09:20:54,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=594, Invalid=596, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 09:20:54,642 INFO L87 Difference]: Start difference. First operand 311 states and 373 transitions. Second operand 35 states. [2019-09-07 09:20:54,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:20:54,934 INFO L93 Difference]: Finished difference Result 566 states and 696 transitions. [2019-09-07 09:20:54,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-07 09:20:54,935 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 207 [2019-09-07 09:20:54,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:20:54,937 INFO L225 Difference]: With dead ends: 566 [2019-09-07 09:20:54,937 INFO L226 Difference]: Without dead ends: 324 [2019-09-07 09:20:54,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=594, Invalid=596, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 09:20:54,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-09-07 09:20:54,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 319. [2019-09-07 09:20:54,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-09-07 09:20:54,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 383 transitions. [2019-09-07 09:20:54,969 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 383 transitions. Word has length 207 [2019-09-07 09:20:54,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:20:54,970 INFO L475 AbstractCegarLoop]: Abstraction has 319 states and 383 transitions. [2019-09-07 09:20:54,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-07 09:20:54,970 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 383 transitions. [2019-09-07 09:20:54,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-07 09:20:54,972 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:20:54,972 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 30, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:20:54,973 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:20:54,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:20:54,973 INFO L82 PathProgramCache]: Analyzing trace with hash 313884561, now seen corresponding path program 15 times [2019-09-07 09:20:54,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:20:54,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:20:54,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:20:54,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:20:54,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:20:55,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:20:55,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 10 proven. 1426 refuted. 0 times theorem prover too weak. 1114 trivial. 0 not checked. [2019-09-07 09:20:55,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:20:55,521 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:20:55,533 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:20:55,706 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-07 09:20:55,707 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:20:55,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-07 09:20:55,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:20:56,693 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:20:56,694 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 22 [2019-09-07 09:20:56,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:20:56,695 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:20:56,699 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:20:56,700 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:20:56,700 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:5 [2019-09-07 09:20:56,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:20:56,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 89 proven. 459 refuted. 0 times theorem prover too weak. 2002 trivial. 0 not checked. [2019-09-07 09:20:56,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:20:56,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 24] total 56 [2019-09-07 09:20:56,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-07 09:20:56,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-07 09:20:56,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=793, Invalid=2287, Unknown=0, NotChecked=0, Total=3080 [2019-09-07 09:20:56,887 INFO L87 Difference]: Start difference. First operand 319 states and 383 transitions. Second operand 56 states. [2019-09-07 09:21:14,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:21:14,179 INFO L93 Difference]: Finished difference Result 445 states and 516 transitions. [2019-09-07 09:21:14,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2019-09-07 09:21:14,179 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 212 [2019-09-07 09:21:14,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:21:14,182 INFO L225 Difference]: With dead ends: 445 [2019-09-07 09:21:14,182 INFO L226 Difference]: Without dead ends: 369 [2019-09-07 09:21:14,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 205 SyntacticMatches, 9 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14693 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=8949, Invalid=31251, Unknown=0, NotChecked=0, Total=40200 [2019-09-07 09:21:14,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-09-07 09:21:14,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 226. [2019-09-07 09:21:14,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-09-07 09:21:14,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 260 transitions. [2019-09-07 09:21:14,205 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 260 transitions. Word has length 212 [2019-09-07 09:21:14,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:21:14,205 INFO L475 AbstractCegarLoop]: Abstraction has 226 states and 260 transitions. [2019-09-07 09:21:14,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-07 09:21:14,206 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 260 transitions. [2019-09-07 09:21:14,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-09-07 09:21:14,207 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:21:14,207 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:21:14,207 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:21:14,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:21:14,221 INFO L82 PathProgramCache]: Analyzing trace with hash -727161611, now seen corresponding path program 28 times [2019-09-07 09:21:14,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:21:14,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:21:14,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:21:14,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:21:14,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:21:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:21:14,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2688 backedges. 12 proven. 1024 refuted. 0 times theorem prover too weak. 1652 trivial. 0 not checked. [2019-09-07 09:21:14,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:21:14,906 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:21:14,916 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:21:14,999 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:21:14,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:21:15,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-07 09:21:15,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:21:15,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2688 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1664 trivial. 0 not checked. [2019-09-07 09:21:15,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:21:15,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-09-07 09:21:15,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-07 09:21:15,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-07 09:21:15,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 09:21:15,062 INFO L87 Difference]: Start difference. First operand 226 states and 260 transitions. Second operand 36 states. [2019-09-07 09:21:15,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:21:15,422 INFO L93 Difference]: Finished difference Result 386 states and 455 transitions. [2019-09-07 09:21:15,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-07 09:21:15,423 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 223 [2019-09-07 09:21:15,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:21:15,425 INFO L225 Difference]: With dead ends: 386 [2019-09-07 09:21:15,425 INFO L226 Difference]: Without dead ends: 231 [2019-09-07 09:21:15,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 09:21:15,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-09-07 09:21:15,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 228. [2019-09-07 09:21:15,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-09-07 09:21:15,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 262 transitions. [2019-09-07 09:21:15,443 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 262 transitions. Word has length 223 [2019-09-07 09:21:15,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:21:15,443 INFO L475 AbstractCegarLoop]: Abstraction has 228 states and 262 transitions. [2019-09-07 09:21:15,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-07 09:21:15,444 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 262 transitions. [2019-09-07 09:21:15,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-07 09:21:15,445 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:21:15,445 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 32, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:21:15,446 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:21:15,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:21:15,446 INFO L82 PathProgramCache]: Analyzing trace with hash 716159443, now seen corresponding path program 29 times [2019-09-07 09:21:15,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:21:15,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:21:15,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:21:15,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:21:15,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:21:15,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:21:16,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2753 backedges. 12 proven. 1520 refuted. 0 times theorem prover too weak. 1221 trivial. 0 not checked. [2019-09-07 09:21:16,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:21:16,126 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:21:16,145 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:21:20,063 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 34 check-sat command(s) [2019-09-07 09:21:20,064 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:21:20,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-07 09:21:20,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:21:20,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2753 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 1664 trivial. 0 not checked. [2019-09-07 09:21:20,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:21:20,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 36] total 37 [2019-09-07 09:21:20,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-07 09:21:20,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-07 09:21:20,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=665, Invalid=667, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 09:21:20,137 INFO L87 Difference]: Start difference. First operand 228 states and 262 transitions. Second operand 37 states. [2019-09-07 09:21:20,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:21:20,431 INFO L93 Difference]: Finished difference Result 391 states and 462 transitions. [2019-09-07 09:21:20,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-07 09:21:20,431 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 225 [2019-09-07 09:21:20,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:21:20,433 INFO L225 Difference]: With dead ends: 391 [2019-09-07 09:21:20,433 INFO L226 Difference]: Without dead ends: 236 [2019-09-07 09:21:20,434 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=665, Invalid=667, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 09:21:20,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-09-07 09:21:20,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 233. [2019-09-07 09:21:20,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-09-07 09:21:20,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 268 transitions. [2019-09-07 09:21:20,451 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 268 transitions. Word has length 225 [2019-09-07 09:21:20,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:21:20,451 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 268 transitions. [2019-09-07 09:21:20,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-07 09:21:20,451 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 268 transitions. [2019-09-07 09:21:20,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-07 09:21:20,453 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:21:20,453 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 33, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:21:20,453 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:21:20,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:21:20,454 INFO L82 PathProgramCache]: Analyzing trace with hash 633343150, now seen corresponding path program 30 times [2019-09-07 09:21:20,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:21:20,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:21:20,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:21:20,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:21:20,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:21:20,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:21:21,131 INFO L134 CoverageAnalysis]: Checked inductivity of 2917 backedges. 12 proven. 1617 refuted. 0 times theorem prover too weak. 1288 trivial. 0 not checked. [2019-09-07 09:21:21,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:21:21,132 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:21:21,149 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:21:41,946 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 35 check-sat command(s) [2019-09-07 09:21:41,947 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:21:41,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-07 09:21:41,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:21:42,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2917 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 1761 trivial. 0 not checked. [2019-09-07 09:21:42,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:21:42,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 37] total 38 [2019-09-07 09:21:42,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-07 09:21:42,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-07 09:21:42,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=702, Invalid=704, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 09:21:42,034 INFO L87 Difference]: Start difference. First operand 233 states and 268 transitions. Second operand 38 states. [2019-09-07 09:21:42,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:21:42,354 INFO L93 Difference]: Finished difference Result 399 states and 472 transitions. [2019-09-07 09:21:42,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-07 09:21:42,355 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 230 [2019-09-07 09:21:42,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:21:42,356 INFO L225 Difference]: With dead ends: 399 [2019-09-07 09:21:42,356 INFO L226 Difference]: Without dead ends: 241 [2019-09-07 09:21:42,356 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=702, Invalid=704, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 09:21:42,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-09-07 09:21:42,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 238. [2019-09-07 09:21:42,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-09-07 09:21:42,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 274 transitions. [2019-09-07 09:21:42,369 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 274 transitions. Word has length 230 [2019-09-07 09:21:42,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:21:42,370 INFO L475 AbstractCegarLoop]: Abstraction has 238 states and 274 transitions. [2019-09-07 09:21:42,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-07 09:21:42,370 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 274 transitions. [2019-09-07 09:21:42,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-09-07 09:21:42,371 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:21:42,372 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 34, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:21:42,372 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:21:42,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:21:42,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1884969327, now seen corresponding path program 31 times [2019-09-07 09:21:42,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:21:42,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:21:42,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:21:42,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:21:42,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:21:42,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:21:43,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3086 backedges. 12 proven. 1717 refuted. 0 times theorem prover too weak. 1357 trivial. 0 not checked. [2019-09-07 09:21:43,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:21:43,024 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:21:43,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:21:43,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:21:43,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-07 09:21:43,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:21:43,177 INFO L134 CoverageAnalysis]: Checked inductivity of 3086 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1861 trivial. 0 not checked. [2019-09-07 09:21:43,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:21:43,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 38] total 39 [2019-09-07 09:21:43,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-07 09:21:43,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-07 09:21:43,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=740, Invalid=742, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 09:21:43,182 INFO L87 Difference]: Start difference. First operand 238 states and 274 transitions. Second operand 39 states. [2019-09-07 09:21:43,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:21:43,529 INFO L93 Difference]: Finished difference Result 407 states and 482 transitions. [2019-09-07 09:21:43,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-07 09:21:43,529 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 235 [2019-09-07 09:21:43,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:21:43,531 INFO L225 Difference]: With dead ends: 407 [2019-09-07 09:21:43,531 INFO L226 Difference]: Without dead ends: 246 [2019-09-07 09:21:43,532 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=740, Invalid=742, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 09:21:43,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-09-07 09:21:43,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 243. [2019-09-07 09:21:43,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-09-07 09:21:43,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 280 transitions. [2019-09-07 09:21:43,550 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 280 transitions. Word has length 235 [2019-09-07 09:21:43,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:21:43,550 INFO L475 AbstractCegarLoop]: Abstraction has 243 states and 280 transitions. [2019-09-07 09:21:43,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-07 09:21:43,551 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 280 transitions. [2019-09-07 09:21:43,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-07 09:21:43,552 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:21:43,552 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 35, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:21:43,553 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:21:43,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:21:43,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1668840174, now seen corresponding path program 32 times [2019-09-07 09:21:43,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:21:43,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:21:43,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:21:43,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:21:43,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:21:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:21:44,177 INFO L134 CoverageAnalysis]: Checked inductivity of 3260 backedges. 12 proven. 1820 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2019-09-07 09:21:44,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:21:44,177 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:21:44,189 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 09:21:44,274 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:21:44,274 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:21:44,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-07 09:21:44,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:21:44,330 INFO L134 CoverageAnalysis]: Checked inductivity of 3260 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 1964 trivial. 0 not checked. [2019-09-07 09:21:44,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:21:44,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 39] total 40 [2019-09-07 09:21:44,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-07 09:21:44,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-07 09:21:44,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=779, Invalid=781, Unknown=0, NotChecked=0, Total=1560 [2019-09-07 09:21:44,336 INFO L87 Difference]: Start difference. First operand 243 states and 280 transitions. Second operand 40 states. [2019-09-07 09:21:44,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:21:44,704 INFO L93 Difference]: Finished difference Result 415 states and 492 transitions. [2019-09-07 09:21:44,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-07 09:21:44,705 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 240 [2019-09-07 09:21:44,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:21:44,706 INFO L225 Difference]: With dead ends: 415 [2019-09-07 09:21:44,706 INFO L226 Difference]: Without dead ends: 251 [2019-09-07 09:21:44,707 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=779, Invalid=781, Unknown=0, NotChecked=0, Total=1560 [2019-09-07 09:21:44,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-09-07 09:21:44,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 248. [2019-09-07 09:21:44,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-09-07 09:21:44,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 286 transitions. [2019-09-07 09:21:44,725 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 286 transitions. Word has length 240 [2019-09-07 09:21:44,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:21:44,725 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 286 transitions. [2019-09-07 09:21:44,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-07 09:21:44,725 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 286 transitions. [2019-09-07 09:21:44,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-07 09:21:44,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:21:44,727 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 36, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:21:44,727 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:21:44,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:21:44,728 INFO L82 PathProgramCache]: Analyzing trace with hash 778451211, now seen corresponding path program 33 times [2019-09-07 09:21:44,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:21:44,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:21:44,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:21:44,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:21:44,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:21:44,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:21:45,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3439 backedges. 12 proven. 1926 refuted. 0 times theorem prover too weak. 1501 trivial. 0 not checked. [2019-09-07 09:21:45,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:21:45,363 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:21:45,373 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:21:45,737 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-07 09:21:45,737 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:21:45,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-07 09:21:45,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:21:46,204 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-07 09:21:46,204 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:21:46,206 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:21:46,207 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:21:46,207 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-07 09:21:46,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:21:46,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3439 backedges. 26 proven. 634 refuted. 0 times theorem prover too weak. 2779 trivial. 0 not checked. [2019-09-07 09:21:46,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:21:46,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 23] total 60 [2019-09-07 09:21:46,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-07 09:21:46,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-07 09:21:46,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1013, Invalid=2527, Unknown=0, NotChecked=0, Total=3540 [2019-09-07 09:21:46,395 INFO L87 Difference]: Start difference. First operand 248 states and 286 transitions. Second operand 60 states. [2019-09-07 09:21:50,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:21:50,470 INFO L93 Difference]: Finished difference Result 441 states and 523 transitions. [2019-09-07 09:21:50,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-09-07 09:21:50,470 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 245 [2019-09-07 09:21:50,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:21:50,472 INFO L225 Difference]: With dead ends: 441 [2019-09-07 09:21:50,473 INFO L226 Difference]: Without dead ends: 384 [2019-09-07 09:21:50,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4982 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4450, Invalid=15010, Unknown=0, NotChecked=0, Total=19460 [2019-09-07 09:21:50,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-09-07 09:21:50,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 374. [2019-09-07 09:21:50,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-09-07 09:21:50,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 450 transitions. [2019-09-07 09:21:50,508 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 450 transitions. Word has length 245 [2019-09-07 09:21:50,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:21:50,508 INFO L475 AbstractCegarLoop]: Abstraction has 374 states and 450 transitions. [2019-09-07 09:21:50,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-07 09:21:50,509 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 450 transitions. [2019-09-07 09:21:50,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-07 09:21:50,510 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:21:50,511 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 36, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:21:50,511 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:21:50,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:21:50,511 INFO L82 PathProgramCache]: Analyzing trace with hash -994735470, now seen corresponding path program 16 times [2019-09-07 09:21:50,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:21:50,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:21:50,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:21:50,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:21:50,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:21:50,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:21:51,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3548 backedges. 12 proven. 1369 refuted. 0 times theorem prover too weak. 2167 trivial. 0 not checked. [2019-09-07 09:21:51,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:21:51,166 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:21:51,176 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:21:51,268 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:21:51,268 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:21:51,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-07 09:21:51,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:21:51,305 INFO L134 CoverageAnalysis]: Checked inductivity of 3548 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 2179 trivial. 0 not checked. [2019-09-07 09:21:51,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:21:51,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-09-07 09:21:51,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-07 09:21:51,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-07 09:21:51,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-07 09:21:51,309 INFO L87 Difference]: Start difference. First operand 374 states and 450 transitions. Second operand 41 states. [2019-09-07 09:21:51,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:21:51,708 INFO L93 Difference]: Finished difference Result 674 states and 828 transitions. [2019-09-07 09:21:51,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-07 09:21:51,709 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 248 [2019-09-07 09:21:51,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:21:51,710 INFO L225 Difference]: With dead ends: 674 [2019-09-07 09:21:51,710 INFO L226 Difference]: Without dead ends: 381 [2019-09-07 09:21:51,711 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-07 09:21:51,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-09-07 09:21:51,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 376. [2019-09-07 09:21:51,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-09-07 09:21:51,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 452 transitions. [2019-09-07 09:21:51,737 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 452 transitions. Word has length 248 [2019-09-07 09:21:51,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:21:51,738 INFO L475 AbstractCegarLoop]: Abstraction has 376 states and 452 transitions. [2019-09-07 09:21:51,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-07 09:21:51,738 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 452 transitions. [2019-09-07 09:21:51,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-07 09:21:51,740 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:21:51,740 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 36, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:21:51,740 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:21:51,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:21:51,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1581960052, now seen corresponding path program 17 times [2019-09-07 09:21:51,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:21:51,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:21:51,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:21:51,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:21:51,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:21:51,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:21:52,439 INFO L134 CoverageAnalysis]: Checked inductivity of 3623 backedges. 12 proven. 2035 refuted. 0 times theorem prover too weak. 1576 trivial. 0 not checked. [2019-09-07 09:21:52,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:21:52,439 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:21:52,450 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 09:22:20,571 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 39 check-sat command(s) [2019-09-07 09:22:20,572 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:22:20,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-07 09:22:20,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:22:20,680 INFO L134 CoverageAnalysis]: Checked inductivity of 3623 backedges. 0 proven. 2035 refuted. 0 times theorem prover too weak. 1588 trivial. 0 not checked. [2019-09-07 09:22:20,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:22:20,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-09-07 09:22:20,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-07 09:22:20,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-07 09:22:20,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-07 09:22:20,703 INFO L87 Difference]: Start difference. First operand 376 states and 452 transitions. Second operand 41 states. [2019-09-07 09:22:21,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:22:21,299 INFO L93 Difference]: Finished difference Result 475 states and 563 transitions. [2019-09-07 09:22:21,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-07 09:22:21,300 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 250 [2019-09-07 09:22:21,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:22:21,302 INFO L225 Difference]: With dead ends: 475 [2019-09-07 09:22:21,303 INFO L226 Difference]: Without dead ends: 387 [2019-09-07 09:22:21,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-07 09:22:21,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-09-07 09:22:21,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 382. [2019-09-07 09:22:21,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-09-07 09:22:21,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 460 transitions. [2019-09-07 09:22:21,342 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 460 transitions. Word has length 250 [2019-09-07 09:22:21,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:22:21,342 INFO L475 AbstractCegarLoop]: Abstraction has 382 states and 460 transitions. [2019-09-07 09:22:21,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-07 09:22:21,342 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 460 transitions. [2019-09-07 09:22:21,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-07 09:22:21,344 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:22:21,345 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:22:21,345 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:22:21,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:22:21,345 INFO L82 PathProgramCache]: Analyzing trace with hash 686230087, now seen corresponding path program 18 times [2019-09-07 09:22:21,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:22:21,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:22:21,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:22:21,346 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:22:21,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:22:21,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:22:22,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3735 backedges. 12 proven. 1444 refuted. 0 times theorem prover too weak. 2279 trivial. 0 not checked. [2019-09-07 09:22:22,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:22:22,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 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:22:22,041 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 09:22:41,697 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 35 check-sat command(s) [2019-09-07 09:22:41,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:22:41,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-07 09:22:41,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:22:42,953 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:22:42,954 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 22 [2019-09-07 09:22:42,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:22:42,955 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:22:42,975 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:22:42,976 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:22:42,976 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:5 [2019-09-07 09:22:43,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:22:43,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3735 backedges. 110 proven. 679 refuted. 0 times theorem prover too weak. 2946 trivial. 0 not checked. [2019-09-07 09:22:43,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:22:43,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 26] total 65 [2019-09-07 09:22:43,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-07 09:22:43,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-07 09:22:43,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1124, Invalid=3036, Unknown=0, NotChecked=0, Total=4160 [2019-09-07 09:22:43,214 INFO L87 Difference]: Start difference. First operand 382 states and 460 transitions. Second operand 65 states. [2019-09-07 09:23:01,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:23:01,194 INFO L93 Difference]: Finished difference Result 732 states and 885 transitions. [2019-09-07 09:23:01,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2019-09-07 09:23:01,194 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 253 [2019-09-07 09:23:01,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:23:01,196 INFO L225 Difference]: With dead ends: 732 [2019-09-07 09:23:01,196 INFO L226 Difference]: Without dead ends: 433 [2019-09-07 09:23:01,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 228 SyntacticMatches, 11 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19758 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=12101, Invalid=41491, Unknown=0, NotChecked=0, Total=53592 [2019-09-07 09:23:01,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2019-09-07 09:23:01,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 266. [2019-09-07 09:23:01,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-07 09:23:01,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 306 transitions. [2019-09-07 09:23:01,222 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 306 transitions. Word has length 253 [2019-09-07 09:23:01,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:23:01,222 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 306 transitions. [2019-09-07 09:23:01,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-07 09:23:01,222 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 306 transitions. [2019-09-07 09:23:01,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-09-07 09:23:01,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:23:01,224 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 38, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:23:01,224 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:23:01,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:23:01,225 INFO L82 PathProgramCache]: Analyzing trace with hash 381044062, now seen corresponding path program 34 times [2019-09-07 09:23:01,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:23:01,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:23:01,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:23:01,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:23:01,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:23:01,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:23:01,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3864 backedges. 14 proven. 2147 refuted. 0 times theorem prover too weak. 1703 trivial. 0 not checked. [2019-09-07 09:23:01,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:23:01,950 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:23:01,960 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:23:02,056 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:23:02,056 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:23:02,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-07 09:23:02,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:23:02,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3864 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 2343 trivial. 0 not checked. [2019-09-07 09:23:02,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:23:02,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 42] total 43 [2019-09-07 09:23:02,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-07 09:23:02,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-07 09:23:02,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=902, Invalid=904, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 09:23:02,126 INFO L87 Difference]: Start difference. First operand 266 states and 306 transitions. Second operand 43 states. [2019-09-07 09:23:02,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:23:02,464 INFO L93 Difference]: Finished difference Result 455 states and 538 transitions. [2019-09-07 09:23:02,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-07 09:23:02,464 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 263 [2019-09-07 09:23:02,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:23:02,465 INFO L225 Difference]: With dead ends: 455 [2019-09-07 09:23:02,466 INFO L226 Difference]: Without dead ends: 274 [2019-09-07 09:23:02,466 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=902, Invalid=904, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 09:23:02,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-09-07 09:23:02,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 271. [2019-09-07 09:23:02,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-07 09:23:02,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 312 transitions. [2019-09-07 09:23:02,487 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 312 transitions. Word has length 263 [2019-09-07 09:23:02,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:23:02,488 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 312 transitions. [2019-09-07 09:23:02,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-07 09:23:02,488 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 312 transitions. [2019-09-07 09:23:02,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-09-07 09:23:02,490 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:23:02,490 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 39, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:23:02,490 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:23:02,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:23:02,490 INFO L82 PathProgramCache]: Analyzing trace with hash -611410031, now seen corresponding path program 35 times [2019-09-07 09:23:02,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:23:02,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:23:02,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:23:02,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:23:02,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:23:02,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:23:03,224 INFO L134 CoverageAnalysis]: Checked inductivity of 4058 backedges. 14 proven. 2262 refuted. 0 times theorem prover too weak. 1782 trivial. 0 not checked. [2019-09-07 09:23:03,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:23:03,224 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:23:03,235 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 09:23:10,615 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 41 check-sat command(s) [2019-09-07 09:23:10,615 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:23:10,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-07 09:23:10,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:23:10,668 INFO L134 CoverageAnalysis]: Checked inductivity of 4058 backedges. 0 proven. 2262 refuted. 0 times theorem prover too weak. 1796 trivial. 0 not checked. [2019-09-07 09:23:10,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:23:10,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2019-09-07 09:23:10,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-07 09:23:10,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-07 09:23:10,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 09:23:10,679 INFO L87 Difference]: Start difference. First operand 271 states and 312 transitions. Second operand 43 states. [2019-09-07 09:23:11,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:23:11,105 INFO L93 Difference]: Finished difference Result 342 states and 386 transitions. [2019-09-07 09:23:11,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-07 09:23:11,105 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 268 [2019-09-07 09:23:11,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:23:11,107 INFO L225 Difference]: With dead ends: 342 [2019-09-07 09:23:11,107 INFO L226 Difference]: Without dead ends: 277 [2019-09-07 09:23:11,107 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 09:23:11,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-09-07 09:23:11,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 274. [2019-09-07 09:23:11,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-09-07 09:23:11,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 316 transitions. [2019-09-07 09:23:11,128 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 316 transitions. Word has length 268 [2019-09-07 09:23:11,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:23:11,129 INFO L475 AbstractCegarLoop]: Abstraction has 274 states and 316 transitions. [2019-09-07 09:23:11,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-07 09:23:11,129 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 316 transitions. [2019-09-07 09:23:11,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-09-07 09:23:11,131 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:23:11,131 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 40, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:23:11,131 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:23:11,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:23:11,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1987598308, now seen corresponding path program 36 times [2019-09-07 09:23:11,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:23:11,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:23:11,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:23:11,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:23:11,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:23:11,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:23:11,901 INFO L134 CoverageAnalysis]: Checked inductivity of 4176 backedges. 14 proven. 1600 refuted. 0 times theorem prover too weak. 2562 trivial. 0 not checked. [2019-09-07 09:23:11,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:23:11,901 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:23:11,912 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 09:24:10,061 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 41 check-sat command(s) [2019-09-07 09:24:10,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:24:10,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-07 09:24:10,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:24:10,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4176 backedges. 0 proven. 2380 refuted. 0 times theorem prover too weak. 1796 trivial. 0 not checked. [2019-09-07 09:24:10,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:24:10,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2019-09-07 09:24:10,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-07 09:24:10,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-07 09:24:10,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-07 09:24:10,190 INFO L87 Difference]: Start difference. First operand 274 states and 316 transitions. Second operand 44 states. [2019-09-07 09:24:10,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:24:10,625 INFO L93 Difference]: Finished difference Result 471 states and 559 transitions. [2019-09-07 09:24:10,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-07 09:24:10,625 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 271 [2019-09-07 09:24:10,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:24:10,627 INFO L225 Difference]: With dead ends: 471 [2019-09-07 09:24:10,627 INFO L226 Difference]: Without dead ends: 284 [2019-09-07 09:24:10,627 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-07 09:24:10,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-09-07 09:24:10,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 281. [2019-09-07 09:24:10,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-09-07 09:24:10,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 324 transitions. [2019-09-07 09:24:10,644 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 324 transitions. Word has length 271 [2019-09-07 09:24:10,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:24:10,644 INFO L475 AbstractCegarLoop]: Abstraction has 281 states and 324 transitions. [2019-09-07 09:24:10,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-07 09:24:10,644 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 324 transitions. [2019-09-07 09:24:10,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-09-07 09:24:10,646 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:24:10,646 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 41, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:24:10,646 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:24:10,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:24:10,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1906562037, now seen corresponding path program 37 times [2019-09-07 09:24:10,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:24:10,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:24:10,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:24:10,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:24:10,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:24:10,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:24:11,640 INFO L134 CoverageAnalysis]: Checked inductivity of 4461 backedges. 14 proven. 2501 refuted. 0 times theorem prover too weak. 1946 trivial. 0 not checked. [2019-09-07 09:24:11,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:24:11,641 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:24:11,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:24:11,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:24:11,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-07 09:24:11,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:24:11,804 INFO L134 CoverageAnalysis]: Checked inductivity of 4461 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 2697 trivial. 0 not checked. [2019-09-07 09:24:11,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:24:11,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 45] total 46 [2019-09-07 09:24:11,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-07 09:24:11,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-07 09:24:11,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1034, Invalid=1036, Unknown=0, NotChecked=0, Total=2070 [2019-09-07 09:24:11,809 INFO L87 Difference]: Start difference. First operand 281 states and 324 transitions. Second operand 46 states. [2019-09-07 09:24:12,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:24:12,197 INFO L93 Difference]: Finished difference Result 479 states and 568 transitions. [2019-09-07 09:24:12,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-07 09:24:12,197 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 278 [2019-09-07 09:24:12,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:24:12,198 INFO L225 Difference]: With dead ends: 479 [2019-09-07 09:24:12,198 INFO L226 Difference]: Without dead ends: 289 [2019-09-07 09:24:12,199 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1034, Invalid=1036, Unknown=0, NotChecked=0, Total=2070 [2019-09-07 09:24:12,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-09-07 09:24:12,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 286. [2019-09-07 09:24:12,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-09-07 09:24:12,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 330 transitions. [2019-09-07 09:24:12,221 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 330 transitions. Word has length 278 [2019-09-07 09:24:12,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:24:12,222 INFO L475 AbstractCegarLoop]: Abstraction has 286 states and 330 transitions. [2019-09-07 09:24:12,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-07 09:24:12,222 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 330 transitions. [2019-09-07 09:24:12,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-09-07 09:24:12,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:24:12,224 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 42, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:24:12,224 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:24:12,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:24:12,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1799441558, now seen corresponding path program 38 times [2019-09-07 09:24:12,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:24:12,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:24:12,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:24:12,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:24:12,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:24:12,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:24:13,353 INFO L134 CoverageAnalysis]: Checked inductivity of 4670 backedges. 14 proven. 2625 refuted. 0 times theorem prover too weak. 2031 trivial. 0 not checked. [2019-09-07 09:24:13,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:24:13,353 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:24:13,364 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 09:24:13,469 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:24:13,470 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:24:13,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-07 09:24:13,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:24:13,536 INFO L134 CoverageAnalysis]: Checked inductivity of 4670 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 2821 trivial. 0 not checked. [2019-09-07 09:24:13,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:24:13,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 46] total 47 [2019-09-07 09:24:13,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-07 09:24:13,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-07 09:24:13,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1080, Invalid=1082, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 09:24:13,541 INFO L87 Difference]: Start difference. First operand 286 states and 330 transitions. Second operand 47 states. [2019-09-07 09:24:13,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:24:13,875 INFO L93 Difference]: Finished difference Result 487 states and 578 transitions. [2019-09-07 09:24:13,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-07 09:24:13,875 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 283 [2019-09-07 09:24:13,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:24:13,876 INFO L225 Difference]: With dead ends: 487 [2019-09-07 09:24:13,876 INFO L226 Difference]: Without dead ends: 294 [2019-09-07 09:24:13,877 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1080, Invalid=1082, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 09:24:13,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-09-07 09:24:13,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 291. [2019-09-07 09:24:13,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-09-07 09:24:13,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 336 transitions. [2019-09-07 09:24:13,900 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 336 transitions. Word has length 283 [2019-09-07 09:24:13,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:24:13,900 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 336 transitions. [2019-09-07 09:24:13,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-07 09:24:13,900 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 336 transitions. [2019-09-07 09:24:13,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-09-07 09:24:13,902 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:24:13,902 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 43, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:24:13,902 INFO L418 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:24:13,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:24:13,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1169926233, now seen corresponding path program 39 times [2019-09-07 09:24:13,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:24:13,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:24:13,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:24:13,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:24:13,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:24:13,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:24:14,877 INFO L134 CoverageAnalysis]: Checked inductivity of 4884 backedges. 14 proven. 2752 refuted. 0 times theorem prover too weak. 2118 trivial. 0 not checked. [2019-09-07 09:24:14,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:24:14,877 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:24:14,889 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:24:15,778 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-09-07 09:24:15,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:24:15,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-07 09:24:15,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:24:16,333 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-07 09:24:16,333 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:24:16,335 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:24:16,336 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:24:16,336 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-07 09:24:16,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:24:16,569 INFO L134 CoverageAnalysis]: Checked inductivity of 4884 backedges. 31 proven. 889 refuted. 0 times theorem prover too weak. 3964 trivial. 0 not checked. [2019-09-07 09:24:16,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:24:16,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 25] total 69 [2019-09-07 09:24:16,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-07 09:24:16,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-07 09:24:16,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1394, Invalid=3298, Unknown=0, NotChecked=0, Total=4692 [2019-09-07 09:24:16,575 INFO L87 Difference]: Start difference. First operand 291 states and 336 transitions. Second operand 69 states. [2019-09-07 09:24:21,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:24:21,412 INFO L93 Difference]: Finished difference Result 514 states and 610 transitions. [2019-09-07 09:24:21,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-09-07 09:24:21,412 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 288 [2019-09-07 09:24:21,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:24:21,415 INFO L225 Difference]: With dead ends: 514 [2019-09-07 09:24:21,415 INFO L226 Difference]: Without dead ends: 449 [2019-09-07 09:24:21,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6799 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6162, Invalid=20244, Unknown=0, NotChecked=0, Total=26406 [2019-09-07 09:24:21,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-09-07 09:24:21,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 439. [2019-09-07 09:24:21,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-09-07 09:24:21,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 529 transitions. [2019-09-07 09:24:21,447 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 529 transitions. Word has length 288 [2019-09-07 09:24:21,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:24:21,448 INFO L475 AbstractCegarLoop]: Abstraction has 439 states and 529 transitions. [2019-09-07 09:24:21,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-07 09:24:21,448 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 529 transitions. [2019-09-07 09:24:21,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-09-07 09:24:21,450 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:24:21,450 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 43, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:24:21,450 INFO L418 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:24:21,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:24:21,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1128687022, now seen corresponding path program 19 times [2019-09-07 09:24:21,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:24:21,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:24:21,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:24:21,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:24:21,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:24:21,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:24:22,311 INFO L134 CoverageAnalysis]: Checked inductivity of 5014 backedges. 14 proven. 1936 refuted. 0 times theorem prover too weak. 3064 trivial. 0 not checked. [2019-09-07 09:24:22,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:24:22,311 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:24:22,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:24:22,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:24:22,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 692 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-07 09:24:22,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:24:22,481 INFO L134 CoverageAnalysis]: Checked inductivity of 5014 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 3078 trivial. 0 not checked. [2019-09-07 09:24:22,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:24:22,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 48 [2019-09-07 09:24:22,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-07 09:24:22,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-07 09:24:22,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-07 09:24:22,487 INFO L87 Difference]: Start difference. First operand 439 states and 529 transitions. Second operand 48 states. [2019-09-07 09:24:22,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:24:22,975 INFO L93 Difference]: Finished difference Result 790 states and 972 transitions. [2019-09-07 09:24:22,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-07 09:24:22,976 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 291 [2019-09-07 09:24:22,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:24:22,977 INFO L225 Difference]: With dead ends: 790 [2019-09-07 09:24:22,977 INFO L226 Difference]: Without dead ends: 446 [2019-09-07 09:24:22,979 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-07 09:24:22,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-09-07 09:24:23,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 441. [2019-09-07 09:24:23,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-09-07 09:24:23,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 531 transitions. [2019-09-07 09:24:23,018 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 531 transitions. Word has length 291 [2019-09-07 09:24:23,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:24:23,018 INFO L475 AbstractCegarLoop]: Abstraction has 441 states and 531 transitions. [2019-09-07 09:24:23,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-07 09:24:23,018 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 531 transitions. [2019-09-07 09:24:23,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-09-07 09:24:23,020 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:24:23,021 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 43, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:24:23,021 INFO L418 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:24:23,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:24:23,021 INFO L82 PathProgramCache]: Analyzing trace with hash 118579248, now seen corresponding path program 20 times [2019-09-07 09:24:23,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:24:23,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:24:23,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:24:23,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:24:23,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:24:23,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:24:23,906 INFO L134 CoverageAnalysis]: Checked inductivity of 5103 backedges. 14 proven. 2882 refuted. 0 times theorem prover too weak. 2207 trivial. 0 not checked. [2019-09-07 09:24:23,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:24:23,907 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:24:23,916 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 09:24:24,024 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:24:24,024 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:24:24,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-07 09:24:24,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:24:24,086 INFO L134 CoverageAnalysis]: Checked inductivity of 5103 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 3078 trivial. 0 not checked. [2019-09-07 09:24:24,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:24:24,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 48] total 49 [2019-09-07 09:24:24,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-07 09:24:24,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-07 09:24:24,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1175, Invalid=1177, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 09:24:24,091 INFO L87 Difference]: Start difference. First operand 441 states and 531 transitions. Second operand 49 states. [2019-09-07 09:24:24,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:24:24,533 INFO L93 Difference]: Finished difference Result 798 states and 984 transitions. [2019-09-07 09:24:24,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-07 09:24:24,533 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 293 [2019-09-07 09:24:24,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:24:24,535 INFO L225 Difference]: With dead ends: 798 [2019-09-07 09:24:24,535 INFO L226 Difference]: Without dead ends: 454 [2019-09-07 09:24:24,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1175, Invalid=1177, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 09:24:24,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-09-07 09:24:24,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 449. [2019-09-07 09:24:24,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-09-07 09:24:24,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 541 transitions. [2019-09-07 09:24:24,569 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 541 transitions. Word has length 293 [2019-09-07 09:24:24,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:24:24,569 INFO L475 AbstractCegarLoop]: Abstraction has 449 states and 541 transitions. [2019-09-07 09:24:24,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-07 09:24:24,570 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 541 transitions. [2019-09-07 09:24:24,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-09-07 09:24:24,572 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:24:24,572 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 44, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:24:24,572 INFO L418 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:24:24,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:24:24,573 INFO L82 PathProgramCache]: Analyzing trace with hash -985568069, now seen corresponding path program 21 times [2019-09-07 09:24:24,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:24:24,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:24:24,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:24:24,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:24:24,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:24:24,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:24:25,487 INFO L134 CoverageAnalysis]: Checked inductivity of 5327 backedges. 14 proven. 3015 refuted. 0 times theorem prover too weak. 2298 trivial. 0 not checked. [2019-09-07 09:24:25,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:24:25,488 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:24:25,502 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:24:26,264 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-09-07 09:24:26,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:24:26,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-07 09:24:26,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:24:26,304 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-07 09:24:26,305 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:24:26,310 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:24:26,311 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:24:26,311 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-09-07 09:24:28,361 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:24:28,362 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 22 [2019-09-07 09:24:28,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:24:28,363 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:24:28,367 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:24:28,367 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:24:28,367 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:5 [2019-09-07 09:24:28,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:24:28,648 INFO L134 CoverageAnalysis]: Checked inductivity of 5327 backedges. 131 proven. 942 refuted. 0 times theorem prover too weak. 4254 trivial. 0 not checked. [2019-09-07 09:24:28,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:24:28,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 28] total 74 [2019-09-07 09:24:28,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-07 09:24:28,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-07 09:24:28,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1529, Invalid=3873, Unknown=0, NotChecked=0, Total=5402 [2019-09-07 09:24:28,655 INFO L87 Difference]: Start difference. First operand 449 states and 541 transitions. Second operand 74 states. [2019-09-07 09:24:41,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:24:41,945 INFO L93 Difference]: Finished difference Result 607 states and 706 transitions. [2019-09-07 09:24:41,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 230 states. [2019-09-07 09:24:41,945 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 298 [2019-09-07 09:24:41,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:24:41,948 INFO L225 Difference]: With dead ends: 607 [2019-09-07 09:24:41,948 INFO L226 Difference]: Without dead ends: 507 [2019-09-07 09:24:41,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 260 SyntacticMatches, 13 SemanticMatches, 279 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29755 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=17992, Invalid=60688, Unknown=0, NotChecked=0, Total=78680 [2019-09-07 09:24:41,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-09-07 09:24:42,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 312. [2019-09-07 09:24:42,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-09-07 09:24:42,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 360 transitions. [2019-09-07 09:24:42,003 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 360 transitions. Word has length 298 [2019-09-07 09:24:42,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:24:42,004 INFO L475 AbstractCegarLoop]: Abstraction has 312 states and 360 transitions. [2019-09-07 09:24:42,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-07 09:24:42,004 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 360 transitions. [2019-09-07 09:24:42,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-09-07 09:24:42,005 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:24:42,005 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 46, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:24:42,005 INFO L418 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:24:42,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:24:42,006 INFO L82 PathProgramCache]: Analyzing trace with hash -739565785, now seen corresponding path program 40 times [2019-09-07 09:24:42,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:24:42,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:24:42,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:24:42,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:24:42,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:24:42,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:24:42,984 INFO L134 CoverageAnalysis]: Checked inductivity of 5523 backedges. 16 proven. 2116 refuted. 0 times theorem prover too weak. 3391 trivial. 0 not checked. [2019-09-07 09:24:42,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:24:42,984 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:24:42,995 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:24:43,112 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:24:43,112 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:24:43,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 729 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-07 09:24:43,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:24:43,186 INFO L134 CoverageAnalysis]: Checked inductivity of 5523 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 3407 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (67)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 09:24:43,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:24:43,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 50 [2019-09-07 09:24:43,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-07 09:24:43,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-07 09:24:43,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-07 09:24:43,194 INFO L87 Difference]: Start difference. First operand 312 states and 360 transitions. Second operand 50 states. [2019-09-07 09:24:43,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:24:43,801 INFO L93 Difference]: Finished difference Result 530 states and 627 transitions. [2019-09-07 09:24:43,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-07 09:24:43,801 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 309 [2019-09-07 09:24:43,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:24:43,803 INFO L225 Difference]: With dead ends: 530 [2019-09-07 09:24:43,803 INFO L226 Difference]: Without dead ends: 317 [2019-09-07 09:24:43,803 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-07 09:24:43,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-09-07 09:24:43,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 314. [2019-09-07 09:24:43,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-09-07 09:24:43,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 362 transitions. [2019-09-07 09:24:43,823 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 362 transitions. Word has length 309 [2019-09-07 09:24:43,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:24:43,823 INFO L475 AbstractCegarLoop]: Abstraction has 314 states and 362 transitions. [2019-09-07 09:24:43,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-07 09:24:43,823 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 362 transitions. [2019-09-07 09:24:43,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-09-07 09:24:43,824 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:24:43,824 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 46, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:24:43,824 INFO L418 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:24:43,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:24:43,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1299999109, now seen corresponding path program 41 times [2019-09-07 09:24:43,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:24:43,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:24:43,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:24:43,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:24:43,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:24:43,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:24:44,767 INFO L134 CoverageAnalysis]: Checked inductivity of 5616 backedges. 16 proven. 3151 refuted. 0 times theorem prover too weak. 2449 trivial. 0 not checked. [2019-09-07 09:24:44,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:24:44,768 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:24:44,778 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 09:25:01,011 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2019-09-07 09:25:01,011 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:25:01,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 735 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-07 09:25:01,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:25:01,125 INFO L134 CoverageAnalysis]: Checked inductivity of 5616 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 3407 trivial. 0 not checked. [2019-09-07 09:25:01,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:25:01,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 51 [2019-09-07 09:25:01,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-07 09:25:01,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-07 09:25:01,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1274, Invalid=1276, Unknown=0, NotChecked=0, Total=2550 [2019-09-07 09:25:01,141 INFO L87 Difference]: Start difference. First operand 314 states and 362 transitions. Second operand 51 states. [2019-09-07 09:25:01,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:25:01,473 INFO L93 Difference]: Finished difference Result 535 states and 634 transitions. [2019-09-07 09:25:01,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-07 09:25:01,473 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 311 [2019-09-07 09:25:01,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:25:01,474 INFO L225 Difference]: With dead ends: 535 [2019-09-07 09:25:01,474 INFO L226 Difference]: Without dead ends: 322 [2019-09-07 09:25:01,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1274, Invalid=1276, Unknown=0, NotChecked=0, Total=2550 [2019-09-07 09:25:01,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-09-07 09:25:01,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 319. [2019-09-07 09:25:01,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-09-07 09:25:01,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 368 transitions. [2019-09-07 09:25:01,493 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 368 transitions. Word has length 311 [2019-09-07 09:25:01,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:25:01,494 INFO L475 AbstractCegarLoop]: Abstraction has 319 states and 368 transitions. [2019-09-07 09:25:01,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-07 09:25:01,494 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 368 transitions. [2019-09-07 09:25:01,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-07 09:25:01,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:25:01,496 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 47, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:25:01,496 INFO L418 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:25:01,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:25:01,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1550730200, now seen corresponding path program 42 times [2019-09-07 09:25:01,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:25:01,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:25:01,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:25:01,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:25:01,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:25:01,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:25:02,452 INFO L134 CoverageAnalysis]: Checked inductivity of 5850 backedges. 16 proven. 3290 refuted. 0 times theorem prover too weak. 2544 trivial. 0 not checked. [2019-09-07 09:25:02,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:25:02,453 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:25:02,465 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 09:25:52,604 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 47 check-sat command(s) [2019-09-07 09:25:52,605 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:25:52,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-07 09:25:52,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:25:53,259 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-07 09:25:53,259 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:25:53,260 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:25:53,260 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:25:53,261 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-07 09:25:53,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:25:53,502 INFO L134 CoverageAnalysis]: Checked inductivity of 5850 backedges. 36 proven. 1118 refuted. 0 times theorem prover too weak. 4696 trivial. 0 not checked. [2019-09-07 09:25:53,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:25:53,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 27] total 75 [2019-09-07 09:25:53,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-09-07 09:25:53,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-09-07 09:25:53,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1660, Invalid=3890, Unknown=0, NotChecked=0, Total=5550 [2019-09-07 09:25:53,517 INFO L87 Difference]: Start difference. First operand 319 states and 368 transitions. Second operand 75 states. [2019-09-07 09:25:59,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:25:59,058 INFO L93 Difference]: Finished difference Result 563 states and 667 transitions. [2019-09-07 09:25:59,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2019-09-07 09:25:59,058 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 316 [2019-09-07 09:25:59,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:25:59,061 INFO L225 Difference]: With dead ends: 563 [2019-09-07 09:25:59,061 INFO L226 Difference]: Without dead ends: 490 [2019-09-07 09:25:59,063 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8101 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7252, Invalid=23900, Unknown=0, NotChecked=0, Total=31152 [2019-09-07 09:25:59,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-09-07 09:25:59,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 480. [2019-09-07 09:25:59,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2019-09-07 09:25:59,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 578 transitions. [2019-09-07 09:25:59,101 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 578 transitions. Word has length 316 [2019-09-07 09:25:59,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:25:59,101 INFO L475 AbstractCegarLoop]: Abstraction has 480 states and 578 transitions. [2019-09-07 09:25:59,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-09-07 09:25:59,101 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 578 transitions. [2019-09-07 09:25:59,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2019-09-07 09:25:59,102 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:25:59,103 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 47, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:25:59,103 INFO L418 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:25:59,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:25:59,103 INFO L82 PathProgramCache]: Analyzing trace with hash 821007937, now seen corresponding path program 22 times [2019-09-07 09:25:59,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:25:59,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:25:59,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:25:59,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:25:59,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:25:59,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:26:00,192 INFO L134 CoverageAnalysis]: Checked inductivity of 5992 backedges. 16 proven. 2304 refuted. 0 times theorem prover too weak. 3672 trivial. 0 not checked. [2019-09-07 09:26:00,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:26:00,193 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:26:00,203 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:26:00,320 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:26:00,320 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:26:00,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 755 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-07 09:26:00,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:26:00,373 INFO L134 CoverageAnalysis]: Checked inductivity of 5992 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 3688 trivial. 0 not checked. [2019-09-07 09:26:00,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:26:00,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 52 [2019-09-07 09:26:00,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-07 09:26:00,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-07 09:26:00,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-07 09:26:00,378 INFO L87 Difference]: Start difference. First operand 480 states and 578 transitions. Second operand 52 states. [2019-09-07 09:26:00,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:26:00,865 INFO L93 Difference]: Finished difference Result 864 states and 1062 transitions. [2019-09-07 09:26:00,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-07 09:26:00,865 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 319 [2019-09-07 09:26:00,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:26:00,867 INFO L225 Difference]: With dead ends: 864 [2019-09-07 09:26:00,867 INFO L226 Difference]: Without dead ends: 487 [2019-09-07 09:26:00,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-07 09:26:00,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-09-07 09:26:00,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 482. [2019-09-07 09:26:00,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2019-09-07 09:26:00,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 580 transitions. [2019-09-07 09:26:00,901 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 580 transitions. Word has length 319 [2019-09-07 09:26:00,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:26:00,902 INFO L475 AbstractCegarLoop]: Abstraction has 482 states and 580 transitions. [2019-09-07 09:26:00,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-07 09:26:00,902 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 580 transitions. [2019-09-07 09:26:00,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-09-07 09:26:00,904 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:26:00,904 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 47, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:26:00,904 INFO L418 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:26:00,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:26:00,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1894122271, now seen corresponding path program 23 times [2019-09-07 09:26:00,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:26:00,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:26:00,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:26:00,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:26:00,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:26:00,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:26:01,926 INFO L134 CoverageAnalysis]: Checked inductivity of 6089 backedges. 16 proven. 3432 refuted. 0 times theorem prover too weak. 2641 trivial. 0 not checked. [2019-09-07 09:26:01,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:26:01,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 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:26:01,937 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 09:26:19,282 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 50 check-sat command(s) [2019-09-07 09:26:19,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:26:19,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 761 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-07 09:26:19,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:26:19,367 INFO L134 CoverageAnalysis]: Checked inductivity of 6089 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 3688 trivial. 0 not checked. [2019-09-07 09:26:19,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:26:19,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 52] total 53 [2019-09-07 09:26:19,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-07 09:26:19,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-07 09:26:19,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1377, Invalid=1379, Unknown=0, NotChecked=0, Total=2756 [2019-09-07 09:26:19,382 INFO L87 Difference]: Start difference. First operand 482 states and 580 transitions. Second operand 53 states. [2019-09-07 09:26:19,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:26:19,905 INFO L93 Difference]: Finished difference Result 872 states and 1074 transitions. [2019-09-07 09:26:19,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-07 09:26:19,905 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 321 [2019-09-07 09:26:19,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:26:19,908 INFO L225 Difference]: With dead ends: 872 [2019-09-07 09:26:19,908 INFO L226 Difference]: Without dead ends: 495 [2019-09-07 09:26:19,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1377, Invalid=1379, Unknown=0, NotChecked=0, Total=2756 [2019-09-07 09:26:19,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-09-07 09:26:19,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 490. [2019-09-07 09:26:19,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-09-07 09:26:19,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 590 transitions. [2019-09-07 09:26:19,952 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 590 transitions. Word has length 321 [2019-09-07 09:26:19,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:26:19,952 INFO L475 AbstractCegarLoop]: Abstraction has 490 states and 590 transitions. [2019-09-07 09:26:19,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-07 09:26:19,952 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 590 transitions. [2019-09-07 09:26:19,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-07 09:26:19,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:26:19,954 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 48, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:26:19,954 INFO L418 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:26:19,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:26:19,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1606744518, now seen corresponding path program 24 times [2019-09-07 09:26:19,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:26:19,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:26:19,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:26:19,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:26:19,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:26:19,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:26:20,968 INFO L134 CoverageAnalysis]: Checked inductivity of 6333 backedges. 16 proven. 3577 refuted. 0 times theorem prover too weak. 2740 trivial. 0 not checked. [2019-09-07 09:26:20,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:26:20,968 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:26:20,979 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 09:27:00,180 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 47 check-sat command(s) [2019-09-07 09:27:00,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:27:00,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-07 09:27:00,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:27:00,225 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-07 09:27:00,226 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:27:00,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:27:00,234 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:27:00,234 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-09-07 09:27:01,987 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:27:01,988 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 22 [2019-09-07 09:27:01,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:27:01,989 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:27:01,993 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:27:01,993 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:27:01,993 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:5 [2019-09-07 09:27:02,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:27:02,340 INFO L134 CoverageAnalysis]: Checked inductivity of 6333 backedges. 143 proven. 1179 refuted. 0 times theorem prover too weak. 5011 trivial. 0 not checked. [2019-09-07 09:27:02,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:27:02,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 30] total 80 [2019-09-07 09:27:02,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-09-07 09:27:02,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-09-07 09:27:02,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1807, Invalid=4513, Unknown=0, NotChecked=0, Total=6320 [2019-09-07 09:27:02,353 INFO L87 Difference]: Start difference. First operand 490 states and 590 transitions. Second operand 80 states. [2019-09-07 09:27:29,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:27:29,245 INFO L93 Difference]: Finished difference Result 664 states and 771 transitions. [2019-09-07 09:27:29,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 248 states. [2019-09-07 09:27:29,245 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 326 [2019-09-07 09:27:29,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:27:29,248 INFO L225 Difference]: With dead ends: 664 [2019-09-07 09:27:29,248 INFO L226 Difference]: Without dead ends: 552 [2019-09-07 09:27:29,251 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 298 SyntacticMatches, 15 SemanticMatches, 301 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34832 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=20874, Invalid=70632, Unknown=0, NotChecked=0, Total=91506 [2019-09-07 09:27:29,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2019-09-07 09:27:29,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 340. [2019-09-07 09:27:29,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-09-07 09:27:29,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 392 transitions. [2019-09-07 09:27:29,284 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 392 transitions. Word has length 326 [2019-09-07 09:27:29,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:27:29,284 INFO L475 AbstractCegarLoop]: Abstraction has 340 states and 392 transitions. [2019-09-07 09:27:29,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-09-07 09:27:29,285 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 392 transitions. [2019-09-07 09:27:29,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-09-07 09:27:29,286 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:27:29,287 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 50, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:27:29,287 INFO L418 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:27:29,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:27:29,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1016282646, now seen corresponding path program 43 times [2019-09-07 09:27:29,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:27:29,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:27:29,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:29,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:27:29,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:29,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:27:30,428 INFO L134 CoverageAnalysis]: Checked inductivity of 6549 backedges. 18 proven. 2500 refuted. 0 times theorem prover too weak. 4031 trivial. 0 not checked. [2019-09-07 09:27:30,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:27:30,428 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:27:30,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:27:30,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:27:30,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-07 09:27:30,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:27:30,637 INFO L134 CoverageAnalysis]: Checked inductivity of 6549 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 4049 trivial. 0 not checked. [2019-09-07 09:27:30,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:27:30,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 54 [2019-09-07 09:27:30,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-07 09:27:30,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-07 09:27:30,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-07 09:27:30,642 INFO L87 Difference]: Start difference. First operand 340 states and 392 transitions. Second operand 54 states. [2019-09-07 09:27:31,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:27:31,216 INFO L93 Difference]: Finished difference Result 578 states and 683 transitions. [2019-09-07 09:27:31,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-07 09:27:31,216 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 337 [2019-09-07 09:27:31,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:27:31,218 INFO L225 Difference]: With dead ends: 578 [2019-09-07 09:27:31,218 INFO L226 Difference]: Without dead ends: 345 [2019-09-07 09:27:31,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-07 09:27:31,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-09-07 09:27:31,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 342. [2019-09-07 09:27:31,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-09-07 09:27:31,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 394 transitions. [2019-09-07 09:27:31,240 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 394 transitions. Word has length 337 [2019-09-07 09:27:31,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:27:31,240 INFO L475 AbstractCegarLoop]: Abstraction has 342 states and 394 transitions. [2019-09-07 09:27:31,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-07 09:27:31,240 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 394 transitions. [2019-09-07 09:27:31,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-09-07 09:27:31,242 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:27:31,242 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 50, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:27:31,242 INFO L418 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:27:31,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:27:31,242 INFO L82 PathProgramCache]: Analyzing trace with hash -435720332, now seen corresponding path program 44 times [2019-09-07 09:27:31,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:27:31,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:27:31,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:31,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:27:31,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:27:32,329 INFO L134 CoverageAnalysis]: Checked inductivity of 6650 backedges. 18 proven. 3725 refuted. 0 times theorem prover too weak. 2907 trivial. 0 not checked. [2019-09-07 09:27:32,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:27:32,329 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:27:32,340 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 09:27:32,463 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:27:32,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:27:32,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-07 09:27:32,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:27:32,547 INFO L134 CoverageAnalysis]: Checked inductivity of 6650 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 4049 trivial. 0 not checked. [2019-09-07 09:27:32,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:27:32,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 54] total 55 [2019-09-07 09:27:32,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-07 09:27:32,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-07 09:27:32,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1484, Invalid=1486, Unknown=0, NotChecked=0, Total=2970 [2019-09-07 09:27:32,552 INFO L87 Difference]: Start difference. First operand 342 states and 394 transitions. Second operand 55 states. [2019-09-07 09:27:33,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:27:33,099 INFO L93 Difference]: Finished difference Result 583 states and 690 transitions. [2019-09-07 09:27:33,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-07 09:27:33,099 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 339 [2019-09-07 09:27:33,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:27:33,100 INFO L225 Difference]: With dead ends: 583 [2019-09-07 09:27:33,100 INFO L226 Difference]: Without dead ends: 350 [2019-09-07 09:27:33,101 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1484, Invalid=1486, Unknown=0, NotChecked=0, Total=2970 [2019-09-07 09:27:33,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-09-07 09:27:33,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 347. [2019-09-07 09:27:33,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-09-07 09:27:33,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 400 transitions. [2019-09-07 09:27:33,123 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 400 transitions. Word has length 339 [2019-09-07 09:27:33,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:27:33,124 INFO L475 AbstractCegarLoop]: Abstraction has 347 states and 400 transitions. [2019-09-07 09:27:33,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-07 09:27:33,124 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 400 transitions. [2019-09-07 09:27:33,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-09-07 09:27:33,125 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:27:33,125 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 51, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:27:33,125 INFO L418 AbstractCegarLoop]: === Iteration 77 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:27:33,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:27:33,126 INFO L82 PathProgramCache]: Analyzing trace with hash 872753239, now seen corresponding path program 45 times [2019-09-07 09:27:33,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:27:33,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:27:33,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:33,126 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:27:33,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:33,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:27:34,246 INFO L134 CoverageAnalysis]: Checked inductivity of 6904 backedges. 18 proven. 3876 refuted. 0 times theorem prover too weak. 3010 trivial. 0 not checked. [2019-09-07 09:27:34,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:27:34,247 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:27:34,256 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:27:37,151 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-09-07 09:27:37,151 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:27:37,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-07 09:27:37,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:27:37,893 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-07 09:27:37,894 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:27:37,896 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:27:37,896 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:27:37,896 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-07 09:27:37,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:27:38,204 INFO L134 CoverageAnalysis]: Checked inductivity of 6904 backedges. 41 proven. 1372 refuted. 0 times theorem prover too weak. 5491 trivial. 0 not checked. [2019-09-07 09:27:38,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:27:38,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 29] total 81 [2019-09-07 09:27:38,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-07 09:27:38,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-07 09:27:38,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1949, Invalid=4531, Unknown=0, NotChecked=0, Total=6480 [2019-09-07 09:27:38,212 INFO L87 Difference]: Start difference. First operand 347 states and 400 transitions. Second operand 81 states. [2019-09-07 09:27:44,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:27:44,631 INFO L93 Difference]: Finished difference Result 612 states and 724 transitions. [2019-09-07 09:27:44,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-09-07 09:27:44,632 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 344 [2019-09-07 09:27:44,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:27:44,635 INFO L225 Difference]: With dead ends: 612 [2019-09-07 09:27:44,635 INFO L226 Difference]: Without dead ends: 531 [2019-09-07 09:27:44,637 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9514 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8431, Invalid=27859, Unknown=0, NotChecked=0, Total=36290 [2019-09-07 09:27:44,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-09-07 09:27:44,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 521. [2019-09-07 09:27:44,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2019-09-07 09:27:44,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 627 transitions. [2019-09-07 09:27:44,685 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 627 transitions. Word has length 344 [2019-09-07 09:27:44,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:27:44,685 INFO L475 AbstractCegarLoop]: Abstraction has 521 states and 627 transitions. [2019-09-07 09:27:44,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-07 09:27:44,685 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 627 transitions. [2019-09-07 09:27:44,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2019-09-07 09:27:44,686 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:27:44,687 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 52, 52, 51, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:27:44,687 INFO L418 AbstractCegarLoop]: === Iteration 78 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:27:44,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:27:44,687 INFO L82 PathProgramCache]: Analyzing trace with hash -15271120, now seen corresponding path program 25 times [2019-09-07 09:27:44,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:27:44,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:27:44,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:44,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:27:44,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:44,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:27:45,838 INFO L134 CoverageAnalysis]: Checked inductivity of 7058 backedges. 18 proven. 2704 refuted. 0 times theorem prover too weak. 4336 trivial. 0 not checked. [2019-09-07 09:27:45,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:27:45,839 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:27:45,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:27:45,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:27:45,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-07 09:27:45,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:27:46,033 INFO L134 CoverageAnalysis]: Checked inductivity of 7058 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 4354 trivial. 0 not checked. [2019-09-07 09:27:46,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:27:46,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 56 [2019-09-07 09:27:46,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-07 09:27:46,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-07 09:27:46,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-07 09:27:46,039 INFO L87 Difference]: Start difference. First operand 521 states and 627 transitions. Second operand 56 states. [2019-09-07 09:27:46,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:27:46,607 INFO L93 Difference]: Finished difference Result 938 states and 1152 transitions. [2019-09-07 09:27:46,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-07 09:27:46,607 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 347 [2019-09-07 09:27:46,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:27:46,609 INFO L225 Difference]: With dead ends: 938 [2019-09-07 09:27:46,609 INFO L226 Difference]: Without dead ends: 528 [2019-09-07 09:27:46,610 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-07 09:27:46,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-09-07 09:27:46,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 523. [2019-09-07 09:27:46,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2019-09-07 09:27:46,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 629 transitions. [2019-09-07 09:27:46,650 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 629 transitions. Word has length 347 [2019-09-07 09:27:46,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:27:46,650 INFO L475 AbstractCegarLoop]: Abstraction has 523 states and 629 transitions. [2019-09-07 09:27:46,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-07 09:27:46,650 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 629 transitions. [2019-09-07 09:27:46,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2019-09-07 09:27:46,652 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:27:46,652 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 51, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:27:46,652 INFO L418 AbstractCegarLoop]: === Iteration 79 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:27:46,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:27:46,652 INFO L82 PathProgramCache]: Analyzing trace with hash -642019570, now seen corresponding path program 26 times [2019-09-07 09:27:46,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:27:46,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:27:46,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:46,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:27:46,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:46,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:27:47,833 INFO L134 CoverageAnalysis]: Checked inductivity of 7163 backedges. 18 proven. 4030 refuted. 0 times theorem prover too weak. 3115 trivial. 0 not checked. [2019-09-07 09:27:47,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:27:47,833 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:27:47,845 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 09:27:47,976 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:27:47,977 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:27:47,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 824 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-07 09:27:47,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:27:48,063 INFO L134 CoverageAnalysis]: Checked inductivity of 7163 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 4354 trivial. 0 not checked. [2019-09-07 09:27:48,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:27:48,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 56] total 57 [2019-09-07 09:27:48,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-07 09:27:48,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-07 09:27:48,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1595, Invalid=1597, Unknown=0, NotChecked=0, Total=3192 [2019-09-07 09:27:48,069 INFO L87 Difference]: Start difference. First operand 523 states and 629 transitions. Second operand 57 states. [2019-09-07 09:27:48,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:27:48,601 INFO L93 Difference]: Finished difference Result 946 states and 1164 transitions. [2019-09-07 09:27:48,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-07 09:27:48,601 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 349 [2019-09-07 09:27:48,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:27:48,603 INFO L225 Difference]: With dead ends: 946 [2019-09-07 09:27:48,603 INFO L226 Difference]: Without dead ends: 536 [2019-09-07 09:27:48,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1595, Invalid=1597, Unknown=0, NotChecked=0, Total=3192 [2019-09-07 09:27:48,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-09-07 09:27:48,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 531. [2019-09-07 09:27:48,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2019-09-07 09:27:48,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 639 transitions. [2019-09-07 09:27:48,646 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 639 transitions. Word has length 349 [2019-09-07 09:27:48,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:27:48,646 INFO L475 AbstractCegarLoop]: Abstraction has 531 states and 639 transitions. [2019-09-07 09:27:48,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-07 09:27:48,646 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 639 transitions. [2019-09-07 09:27:48,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2019-09-07 09:27:48,648 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:27:48,648 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 52, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:27:48,648 INFO L418 AbstractCegarLoop]: === Iteration 80 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:27:48,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:27:48,648 INFO L82 PathProgramCache]: Analyzing trace with hash 862185657, now seen corresponding path program 27 times [2019-09-07 09:27:48,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:27:48,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:27:48,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:48,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:27:48,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:48,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:27:49,860 INFO L134 CoverageAnalysis]: Checked inductivity of 7427 backedges. 18 proven. 4187 refuted. 0 times theorem prover too weak. 3222 trivial. 0 not checked. [2019-09-07 09:27:49,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:27:49,861 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:27:49,871 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:27:52,159 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-09-07 09:27:52,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:27:52,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-07 09:27:52,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:27:54,663 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:27:54,663 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 22 [2019-09-07 09:27:54,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:27:54,665 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:27:54,668 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:27:54,669 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:27:54,669 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:5 [2019-09-07 09:27:54,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:27:55,049 INFO L134 CoverageAnalysis]: Checked inductivity of 7427 backedges. 155 proven. 1441 refuted. 0 times theorem prover too weak. 5831 trivial. 0 not checked. [2019-09-07 09:27:55,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:27:55,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 32] total 86 [2019-09-07 09:27:55,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-09-07 09:27:55,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-09-07 09:27:55,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2108, Invalid=5202, Unknown=0, NotChecked=0, Total=7310 [2019-09-07 09:27:55,073 INFO L87 Difference]: Start difference. First operand 531 states and 639 transitions. Second operand 86 states. [2019-09-07 09:28:12,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:28:12,811 INFO L93 Difference]: Finished difference Result 721 states and 836 transitions. [2019-09-07 09:28:12,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 266 states. [2019-09-07 09:28:12,811 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 354 [2019-09-07 09:28:12,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:28:12,815 INFO L225 Difference]: With dead ends: 721 [2019-09-07 09:28:12,815 INFO L226 Difference]: Without dead ends: 597 [2019-09-07 09:28:12,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 649 GetRequests, 309 SyntacticMatches, 17 SemanticMatches, 323 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40309 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=23971, Invalid=81329, Unknown=0, NotChecked=0, Total=105300 [2019-09-07 09:28:12,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-09-07 09:28:12,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 368. [2019-09-07 09:28:12,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-09-07 09:28:12,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 424 transitions. [2019-09-07 09:28:12,847 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 424 transitions. Word has length 354 [2019-09-07 09:28:12,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:28:12,847 INFO L475 AbstractCegarLoop]: Abstraction has 368 states and 424 transitions. [2019-09-07 09:28:12,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-09-07 09:28:12,847 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 424 transitions. [2019-09-07 09:28:12,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-09-07 09:28:12,849 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:28:12,850 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 54, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:28:12,850 INFO L418 AbstractCegarLoop]: === Iteration 81 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:28:12,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:28:12,850 INFO L82 PathProgramCache]: Analyzing trace with hash -330775035, now seen corresponding path program 46 times [2019-09-07 09:28:12,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:28:12,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:28:12,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:28:12,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:28:12,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:28:12,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:28:14,109 INFO L134 CoverageAnalysis]: Checked inductivity of 7663 backedges. 20 proven. 2916 refuted. 0 times theorem prover too weak. 4727 trivial. 0 not checked. [2019-09-07 09:28:14,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:28:14,110 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:28:14,120 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:28:14,255 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:28:14,255 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:28:14,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 855 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-07 09:28:14,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:28:14,353 INFO L134 CoverageAnalysis]: Checked inductivity of 7663 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 4747 trivial. 0 not checked. [2019-09-07 09:28:14,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:28:14,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 58 [2019-09-07 09:28:14,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-07 09:28:14,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-07 09:28:14,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-09-07 09:28:14,360 INFO L87 Difference]: Start difference. First operand 368 states and 424 transitions. Second operand 58 states. [2019-09-07 09:28:14,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:28:14,997 INFO L93 Difference]: Finished difference Result 626 states and 739 transitions. [2019-09-07 09:28:14,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-07 09:28:14,998 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 365 [2019-09-07 09:28:14,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:28:14,999 INFO L225 Difference]: With dead ends: 626 [2019-09-07 09:28:14,999 INFO L226 Difference]: Without dead ends: 373 [2019-09-07 09:28:15,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-09-07 09:28:15,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-09-07 09:28:15,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 370. [2019-09-07 09:28:15,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-09-07 09:28:15,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 426 transitions. [2019-09-07 09:28:15,025 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 426 transitions. Word has length 365 [2019-09-07 09:28:15,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:28:15,025 INFO L475 AbstractCegarLoop]: Abstraction has 370 states and 426 transitions. [2019-09-07 09:28:15,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-07 09:28:15,025 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 426 transitions. [2019-09-07 09:28:15,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2019-09-07 09:28:15,027 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:28:15,027 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 54, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:28:15,027 INFO L418 AbstractCegarLoop]: === Iteration 82 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:28:15,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:28:15,028 INFO L82 PathProgramCache]: Analyzing trace with hash 365911651, now seen corresponding path program 47 times [2019-09-07 09:28:15,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:28:15,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:28:15,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:28:15,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:28:15,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:28:15,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:28:16,276 INFO L134 CoverageAnalysis]: Checked inductivity of 7772 backedges. 20 proven. 4347 refuted. 0 times theorem prover too weak. 3405 trivial. 0 not checked. [2019-09-07 09:28:16,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:28:16,276 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:28:16,287 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 09:29:12,906 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 56 check-sat command(s) [2019-09-07 09:29:12,907 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:29:12,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 861 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-07 09:29:12,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:29:13,017 INFO L134 CoverageAnalysis]: Checked inductivity of 7772 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 4747 trivial. 0 not checked. [2019-09-07 09:29:13,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:29:13,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 58] total 59 [2019-09-07 09:29:13,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-07 09:29:13,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-07 09:29:13,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1710, Invalid=1712, Unknown=0, NotChecked=0, Total=3422 [2019-09-07 09:29:13,041 INFO L87 Difference]: Start difference. First operand 370 states and 426 transitions. Second operand 59 states. [2019-09-07 09:29:13,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:29:13,495 INFO L93 Difference]: Finished difference Result 631 states and 746 transitions. [2019-09-07 09:29:13,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-07 09:29:13,496 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 367 [2019-09-07 09:29:13,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:29:13,497 INFO L225 Difference]: With dead ends: 631 [2019-09-07 09:29:13,497 INFO L226 Difference]: Without dead ends: 378 [2019-09-07 09:29:13,498 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1710, Invalid=1712, Unknown=0, NotChecked=0, Total=3422 [2019-09-07 09:29:13,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-09-07 09:29:13,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 375. [2019-09-07 09:29:13,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-09-07 09:29:13,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 432 transitions. [2019-09-07 09:29:13,523 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 432 transitions. Word has length 367 [2019-09-07 09:29:13,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:29:13,523 INFO L475 AbstractCegarLoop]: Abstraction has 375 states and 432 transitions. [2019-09-07 09:29:13,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-07 09:29:13,524 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 432 transitions. [2019-09-07 09:29:13,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-07 09:29:13,525 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:29:13,525 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 55, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:29:13,526 INFO L418 AbstractCegarLoop]: === Iteration 83 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:29:13,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:29:13,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1044469206, now seen corresponding path program 48 times [2019-09-07 09:29:13,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:29:13,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:29:13,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:13,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:29:13,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:13,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:29:14,799 INFO L134 CoverageAnalysis]: Checked inductivity of 8046 backedges. 20 proven. 4510 refuted. 0 times theorem prover too weak. 3516 trivial. 0 not checked. [2019-09-07 09:29:14,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:29:14,800 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:29:14,810 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 09:32:21,145 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 57 check-sat command(s) [2019-09-07 09:32:21,145 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:32:21,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 873 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-07 09:32:21,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:32:21,313 INFO L134 CoverageAnalysis]: Checked inductivity of 8046 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 4910 trivial. 0 not checked. [2019-09-07 09:32:21,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:32:21,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 59] total 60 [2019-09-07 09:32:21,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-07 09:32:21,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-07 09:32:21,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1769, Invalid=1771, Unknown=0, NotChecked=0, Total=3540 [2019-09-07 09:32:21,347 INFO L87 Difference]: Start difference. First operand 375 states and 432 transitions. Second operand 60 states. [2019-09-07 09:32:22,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:32:22,039 INFO L93 Difference]: Finished difference Result 639 states and 756 transitions. [2019-09-07 09:32:22,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-07 09:32:22,040 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 372 [2019-09-07 09:32:22,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:32:22,041 INFO L225 Difference]: With dead ends: 639 [2019-09-07 09:32:22,041 INFO L226 Difference]: Without dead ends: 383 [2019-09-07 09:32:22,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 371 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1769, Invalid=1771, Unknown=0, NotChecked=0, Total=3540 [2019-09-07 09:32:22,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-09-07 09:32:22,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 380. [2019-09-07 09:32:22,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-09-07 09:32:22,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 438 transitions. [2019-09-07 09:32:22,067 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 438 transitions. Word has length 372 [2019-09-07 09:32:22,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:32:22,067 INFO L475 AbstractCegarLoop]: Abstraction has 380 states and 438 transitions. [2019-09-07 09:32:22,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-07 09:32:22,067 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 438 transitions. [2019-09-07 09:32:22,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2019-09-07 09:32:22,069 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:32:22,069 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 56, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:32:22,069 INFO L418 AbstractCegarLoop]: === Iteration 84 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:32:22,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:32:22,069 INFO L82 PathProgramCache]: Analyzing trace with hash -108098049, now seen corresponding path program 49 times [2019-09-07 09:32:22,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:32:22,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:32:22,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:32:22,070 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:32:22,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:32:22,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:32:23,401 INFO L134 CoverageAnalysis]: Checked inductivity of 8325 backedges. 20 proven. 4676 refuted. 0 times theorem prover too weak. 3629 trivial. 0 not checked. [2019-09-07 09:32:23,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:32:23,401 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:32:23,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:32:23,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:32:23,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-07 09:32:23,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:32:23,672 INFO L134 CoverageAnalysis]: Checked inductivity of 8325 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 5076 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (82)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 09:32:23,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:32:23,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 60] total 61 [2019-09-07 09:32:23,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-07 09:32:23,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-07 09:32:23,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1829, Invalid=1831, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 09:32:23,680 INFO L87 Difference]: Start difference. First operand 380 states and 438 transitions. Second operand 61 states. [2019-09-07 09:32:24,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:32:24,220 INFO L93 Difference]: Finished difference Result 647 states and 766 transitions. [2019-09-07 09:32:24,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-07 09:32:24,221 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 377 [2019-09-07 09:32:24,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:32:24,222 INFO L225 Difference]: With dead ends: 647 [2019-09-07 09:32:24,222 INFO L226 Difference]: Without dead ends: 388 [2019-09-07 09:32:24,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 376 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1829, Invalid=1831, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 09:32:24,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-09-07 09:32:24,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 385. [2019-09-07 09:32:24,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2019-09-07 09:32:24,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 444 transitions. [2019-09-07 09:32:24,249 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 444 transitions. Word has length 377 [2019-09-07 09:32:24,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:32:24,249 INFO L475 AbstractCegarLoop]: Abstraction has 385 states and 444 transitions. [2019-09-07 09:32:24,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-07 09:32:24,249 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 444 transitions. [2019-09-07 09:32:24,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-09-07 09:32:24,251 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:32:24,251 INFO L399 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 57, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:32:24,251 INFO L418 AbstractCegarLoop]: === Iteration 85 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:32:24,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:32:24,252 INFO L82 PathProgramCache]: Analyzing trace with hash -779313606, now seen corresponding path program 50 times [2019-09-07 09:32:24,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:32:24,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:32:24,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:32:24,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:32:24,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:32:24,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:32:25,706 INFO L134 CoverageAnalysis]: Checked inductivity of 8609 backedges. 20 proven. 4845 refuted. 0 times theorem prover too weak. 3744 trivial. 0 not checked. [2019-09-07 09:32:25,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:32:25,706 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:32:25,716 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 09:32:25,857 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:32:25,857 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:32:25,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 897 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-07 09:32:25,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:32:25,950 INFO L134 CoverageAnalysis]: Checked inductivity of 8609 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 5245 trivial. 0 not checked. [2019-09-07 09:32:25,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:32:25,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 61] total 62 [2019-09-07 09:32:25,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-07 09:32:25,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-07 09:32:25,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1890, Invalid=1892, Unknown=0, NotChecked=0, Total=3782 [2019-09-07 09:32:25,956 INFO L87 Difference]: Start difference. First operand 385 states and 444 transitions. Second operand 62 states. [2019-09-07 09:32:26,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:32:26,594 INFO L93 Difference]: Finished difference Result 655 states and 776 transitions. [2019-09-07 09:32:26,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-07 09:32:26,594 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 382 [2019-09-07 09:32:26,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:32:26,596 INFO L225 Difference]: With dead ends: 655 [2019-09-07 09:32:26,596 INFO L226 Difference]: Without dead ends: 393 [2019-09-07 09:32:26,597 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1890, Invalid=1892, Unknown=0, NotChecked=0, Total=3782 [2019-09-07 09:32:26,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-09-07 09:32:26,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 390. [2019-09-07 09:32:26,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2019-09-07 09:32:26,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 450 transitions. [2019-09-07 09:32:26,625 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 450 transitions. Word has length 382 [2019-09-07 09:32:26,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:32:26,625 INFO L475 AbstractCegarLoop]: Abstraction has 390 states and 450 transitions. [2019-09-07 09:32:26,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-07 09:32:26,625 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 450 transitions. [2019-09-07 09:32:26,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-09-07 09:32:26,627 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:32:26,628 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 58, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:32:26,628 INFO L418 AbstractCegarLoop]: === Iteration 86 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:32:26,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:32:26,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1805532571, now seen corresponding path program 51 times [2019-09-07 09:32:26,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:32:26,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:32:26,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:32:26,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:32:26,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:32:26,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:32:28,024 INFO L134 CoverageAnalysis]: Checked inductivity of 8898 backedges. 20 proven. 5017 refuted. 0 times theorem prover too weak. 3861 trivial. 0 not checked. [2019-09-07 09:32:28,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:32:28,025 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:32:28,036 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:32:32,365 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-09-07 09:32:32,365 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:32:32,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-07 09:32:32,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:32:33,269 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-07 09:32:33,269 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:32:33,271 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:32:33,271 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:32:33,271 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-07 09:32:33,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:32:33,615 INFO L134 CoverageAnalysis]: Checked inductivity of 8898 backedges. 46 proven. 1738 refuted. 0 times theorem prover too weak. 7114 trivial. 0 not checked. [2019-09-07 09:32:33,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:32:33,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 31] total 90 [2019-09-07 09:32:33,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-09-07 09:32:33,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-09-07 09:32:33,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2468, Invalid=5542, Unknown=0, NotChecked=0, Total=8010 [2019-09-07 09:32:33,624 INFO L87 Difference]: Start difference. First operand 390 states and 450 transitions. Second operand 90 states. [2019-09-07 09:32:41,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:32:41,275 INFO L93 Difference]: Finished difference Result 685 states and 811 transitions. [2019-09-07 09:32:41,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2019-09-07 09:32:41,276 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 387 [2019-09-07 09:32:41,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:32:41,279 INFO L225 Difference]: With dead ends: 685 [2019-09-07 09:32:41,279 INFO L226 Difference]: Without dead ends: 596 [2019-09-07 09:32:41,281 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 620 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11971 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=10740, Invalid=34842, Unknown=0, NotChecked=0, Total=45582 [2019-09-07 09:32:41,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-09-07 09:32:41,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 586. [2019-09-07 09:32:41,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-09-07 09:32:41,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 706 transitions. [2019-09-07 09:32:41,331 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 706 transitions. Word has length 387 [2019-09-07 09:32:41,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:32:41,331 INFO L475 AbstractCegarLoop]: Abstraction has 586 states and 706 transitions. [2019-09-07 09:32:41,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-09-07 09:32:41,331 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 706 transitions. [2019-09-07 09:32:41,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-09-07 09:32:41,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:32:41,334 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 59, 59, 58, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:32:41,334 INFO L418 AbstractCegarLoop]: === Iteration 87 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:32:41,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:32:41,335 INFO L82 PathProgramCache]: Analyzing trace with hash 635178810, now seen corresponding path program 28 times [2019-09-07 09:32:41,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:32:41,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:32:41,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:32:41,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:32:41,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:32:41,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:32:42,908 INFO L134 CoverageAnalysis]: Checked inductivity of 9073 backedges. 20 proven. 3481 refuted. 0 times theorem prover too weak. 5572 trivial. 0 not checked. [2019-09-07 09:32:42,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:32:42,909 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:32:42,919 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:32:43,068 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:32:43,069 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:32:43,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 917 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-07 09:32:43,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:32:43,142 INFO L134 CoverageAnalysis]: Checked inductivity of 9073 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 5592 trivial. 0 not checked. [2019-09-07 09:32:43,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:32:43,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 63 [2019-09-07 09:32:43,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-07 09:32:43,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-07 09:32:43,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-09-07 09:32:43,148 INFO L87 Difference]: Start difference. First operand 586 states and 706 transitions. Second operand 63 states. [2019-09-07 09:32:43,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:32:43,881 INFO L93 Difference]: Finished difference Result 1054 states and 1296 transitions. [2019-09-07 09:32:43,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-07 09:32:43,882 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 390 [2019-09-07 09:32:43,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:32:43,884 INFO L225 Difference]: With dead ends: 1054 [2019-09-07 09:32:43,884 INFO L226 Difference]: Without dead ends: 593 [2019-09-07 09:32:43,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-09-07 09:32:43,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2019-09-07 09:32:43,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 588. [2019-09-07 09:32:43,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-09-07 09:32:43,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 708 transitions. [2019-09-07 09:32:43,934 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 708 transitions. Word has length 390 [2019-09-07 09:32:43,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:32:43,934 INFO L475 AbstractCegarLoop]: Abstraction has 588 states and 708 transitions. [2019-09-07 09:32:43,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-07 09:32:43,934 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 708 transitions. [2019-09-07 09:32:43,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-09-07 09:32:43,936 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:32:43,936 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 58, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:32:43,936 INFO L418 AbstractCegarLoop]: === Iteration 88 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:32:43,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:32:43,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1446837404, now seen corresponding path program 29 times [2019-09-07 09:32:43,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:32:43,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:32:43,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:32:43,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:32:43,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:32:43,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:32:45,595 INFO L134 CoverageAnalysis]: Checked inductivity of 9192 backedges. 20 proven. 5192 refuted. 0 times theorem prover too weak. 3980 trivial. 0 not checked. [2019-09-07 09:32:45,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:32:45,596 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:32:45,606 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 09:33:08,116 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 61 check-sat command(s) [2019-09-07 09:33:08,117 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:33:08,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 923 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-07 09:33:08,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:33:08,233 INFO L134 CoverageAnalysis]: Checked inductivity of 9192 backedges. 0 proven. 5192 refuted. 0 times theorem prover too weak. 4000 trivial. 0 not checked. [2019-09-07 09:33:08,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:33:08,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 63 [2019-09-07 09:33:08,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-07 09:33:08,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-07 09:33:08,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-09-07 09:33:08,254 INFO L87 Difference]: Start difference. First operand 588 states and 708 transitions. Second operand 63 states. [2019-09-07 09:33:08,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:33:08,906 INFO L93 Difference]: Finished difference Result 735 states and 871 transitions. [2019-09-07 09:33:08,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-07 09:33:08,906 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 392 [2019-09-07 09:33:08,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:33:08,908 INFO L225 Difference]: With dead ends: 735 [2019-09-07 09:33:08,908 INFO L226 Difference]: Without dead ends: 599 [2019-09-07 09:33:08,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-09-07 09:33:08,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-09-07 09:33:08,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 594. [2019-09-07 09:33:08,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2019-09-07 09:33:08,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 716 transitions. [2019-09-07 09:33:08,956 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 716 transitions. Word has length 392 [2019-09-07 09:33:08,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:33:08,957 INFO L475 AbstractCegarLoop]: Abstraction has 594 states and 716 transitions. [2019-09-07 09:33:08,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-07 09:33:08,957 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 716 transitions. [2019-09-07 09:33:08,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2019-09-07 09:33:08,959 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:33:08,959 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 60, 60, 59, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:33:08,959 INFO L418 AbstractCegarLoop]: === Iteration 89 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:33:08,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:33:08,959 INFO L82 PathProgramCache]: Analyzing trace with hash 597590871, now seen corresponding path program 30 times [2019-09-07 09:33:08,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:33:08,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:33:08,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:33:08,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:33:08,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:33:08,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:33:10,481 INFO L134 CoverageAnalysis]: Checked inductivity of 9370 backedges. 20 proven. 3600 refuted. 0 times theorem prover too weak. 5750 trivial. 0 not checked. [2019-09-07 09:33:10,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:33:10,481 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:33:10,494 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE