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/loops/insertion_sort-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 19:19:47,810 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 19:19:47,812 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 19:19:47,824 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 19:19:47,824 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 19:19:47,825 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 19:19:47,827 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 19:19:47,829 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 19:19:47,830 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 19:19:47,831 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 19:19:47,832 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 19:19:47,835 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 19:19:47,836 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 19:19:47,840 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 19:19:47,841 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 19:19:47,842 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 19:19:47,843 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 19:19:47,844 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 19:19:47,847 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 19:19:47,849 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 19:19:47,851 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 19:19:47,852 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 19:19:47,853 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 19:19:47,854 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 19:19:47,856 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 19:19:47,856 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 19:19:47,856 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 19:19:47,857 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 19:19:47,858 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 19:19:47,859 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 19:19:47,859 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 19:19:47,860 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 19:19:47,860 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 19:19:47,861 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 19:19:47,862 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 19:19:47,862 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 19:19:47,863 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 19:19:47,863 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 19:19:47,863 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 19:19:47,866 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 19:19:47,867 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 19:19:47,868 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-03 19:19:47,897 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 19:19:47,897 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 19:19:47,899 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 19:19:47,899 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 19:19:47,899 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 19:19:47,900 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 19:19:47,900 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 19:19:47,900 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 19:19:47,900 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 19:19:47,900 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 19:19:47,901 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 19:19:47,901 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 19:19:47,901 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 19:19:47,902 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 19:19:47,902 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 19:19:47,902 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 19:19:47,903 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 19:19:47,903 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 19:19:47,903 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 19:19:47,903 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 19:19:47,903 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 19:19:47,904 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:19:47,904 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 19:19:47,904 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 19:19:47,905 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 19:19:47,905 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 19:19:47,905 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 19:19:47,905 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 19:19:47,906 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 19:19:47,963 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 19:19:47,983 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 19:19:47,987 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 19:19:47,989 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 19:19:47,989 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 19:19:47,990 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/insertion_sort-2.c [2019-09-03 19:19:48,058 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bde3b360/176132e35eab4a8d979d9cd7649f990d/FLAGd0bf6b663 [2019-09-03 19:19:48,501 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 19:19:48,508 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort-2.c [2019-09-03 19:19:48,515 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bde3b360/176132e35eab4a8d979d9cd7649f990d/FLAGd0bf6b663 [2019-09-03 19:19:48,892 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bde3b360/176132e35eab4a8d979d9cd7649f990d [2019-09-03 19:19:48,902 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 19:19:48,903 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 19:19:48,904 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 19:19:48,904 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 19:19:48,908 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 19:19:48,909 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:19:48" (1/1) ... [2019-09-03 19:19:48,912 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65e32827 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:48, skipping insertion in model container [2019-09-03 19:19:48,912 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:19:48" (1/1) ... [2019-09-03 19:19:48,920 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 19:19:48,940 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 19:19:49,124 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:19:49,129 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 19:19:49,151 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:19:49,169 INFO L192 MainTranslator]: Completed translation [2019-09-03 19:19:49,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:49 WrapperNode [2019-09-03 19:19:49,169 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 19:19:49,170 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 19:19:49,170 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 19:19:49,170 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 19:19:49,277 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:49" (1/1) ... [2019-09-03 19:19:49,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:49" (1/1) ... [2019-09-03 19:19:49,285 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:49" (1/1) ... [2019-09-03 19:19:49,286 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:49" (1/1) ... [2019-09-03 19:19:49,293 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:49" (1/1) ... [2019-09-03 19:19:49,300 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:49" (1/1) ... [2019-09-03 19:19:49,303 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:49" (1/1) ... [2019-09-03 19:19:49,305 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 19:19:49,310 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 19:19:49,310 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 19:19:49,310 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 19:19:49,311 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:19:49,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 19:19:49,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 19:19:49,369 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 19:19:49,370 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 19:19:49,370 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 19:19:49,370 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 19:19:49,370 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-03 19:19:49,370 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 19:19:49,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-03 19:19:49,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-03 19:19:49,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-03 19:19:49,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-03 19:19:49,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 19:19:49,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 19:19:49,639 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 19:19:49,639 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-03 19:19:49,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:19:49 BoogieIcfgContainer [2019-09-03 19:19:49,641 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 19:19:49,643 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 19:19:49,643 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 19:19:49,650 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 19:19:49,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 07:19:48" (1/3) ... [2019-09-03 19:19:49,651 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cf87a35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:19:49, skipping insertion in model container [2019-09-03 19:19:49,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:49" (2/3) ... [2019-09-03 19:19:49,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cf87a35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:19:49, skipping insertion in model container [2019-09-03 19:19:49,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:19:49" (3/3) ... [2019-09-03 19:19:49,657 INFO L109 eAbstractionObserver]: Analyzing ICFG insertion_sort-2.c [2019-09-03 19:19:49,674 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 19:19:49,683 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 19:19:49,724 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 19:19:49,766 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 19:19:49,767 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 19:19:49,767 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 19:19:49,767 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 19:19:49,767 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 19:19:49,768 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 19:19:49,768 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 19:19:49,768 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 19:19:49,768 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 19:19:49,784 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-09-03 19:19:49,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-03 19:19:49,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:49,790 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:49,792 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:49,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:49,798 INFO L82 PathProgramCache]: Analyzing trace with hash 637757472, now seen corresponding path program 1 times [2019-09-03 19:19:49,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:49,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:49,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:49,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:49,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:49,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:49,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:19:49,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:19:49,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 19:19:49,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 19:19:49,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 19:19:49,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 19:19:49,955 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2019-09-03 19:19:49,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:49,976 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2019-09-03 19:19:49,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 19:19:49,977 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-09-03 19:19:49,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:49,986 INFO L225 Difference]: With dead ends: 50 [2019-09-03 19:19:49,986 INFO L226 Difference]: Without dead ends: 23 [2019-09-03 19:19:49,989 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-03 19:19:50,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-03 19:19:50,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-03 19:19:50,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-03 19:19:50,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-09-03 19:19:50,030 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 13 [2019-09-03 19:19:50,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:50,031 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-09-03 19:19:50,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 19:19:50,031 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2019-09-03 19:19:50,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-03 19:19:50,032 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:50,033 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:50,034 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:50,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:50,034 INFO L82 PathProgramCache]: Analyzing trace with hash -962501754, now seen corresponding path program 1 times [2019-09-03 19:19:50,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:50,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:50,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:50,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:50,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:50,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:50,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:19:50,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:19:50,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:19:50,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:19:50,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:19:50,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:19:50,282 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 5 states. [2019-09-03 19:19:50,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:50,349 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2019-09-03 19:19:50,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:19:50,350 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-09-03 19:19:50,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:50,351 INFO L225 Difference]: With dead ends: 41 [2019-09-03 19:19:50,351 INFO L226 Difference]: Without dead ends: 29 [2019-09-03 19:19:50,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:19:50,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-03 19:19:50,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2019-09-03 19:19:50,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-03 19:19:50,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2019-09-03 19:19:50,360 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 13 [2019-09-03 19:19:50,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:50,360 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-09-03 19:19:50,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:19:50,361 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2019-09-03 19:19:50,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-03 19:19:50,361 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:50,362 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:50,362 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:50,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:50,363 INFO L82 PathProgramCache]: Analyzing trace with hash 513665657, now seen corresponding path program 1 times [2019-09-03 19:19:50,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:50,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:50,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:50,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:50,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:50,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:50,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:19:50,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:19:50,922 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:19:50,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:50,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 19:19:50,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:19:51,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:51,224 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:19:51,229 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-09-03 19:19:51,230 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:19:51,243 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:51,245 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:19:51,246 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2019-09-03 19:19:51,293 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:51,293 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-09-03 19:19:51,294 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:19:51,296 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:51,296 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-03 19:19:51,297 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-03 19:19:51,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:51,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:19:51,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:19:51,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2019-09-03 19:19:51,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 19:19:51,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 19:19:51,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2019-09-03 19:19:51,350 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 19 states. [2019-09-03 19:19:51,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:51,986 INFO L93 Difference]: Finished difference Result 77 states and 95 transitions. [2019-09-03 19:19:51,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 19:19:51,987 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-09-03 19:19:51,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:51,991 INFO L225 Difference]: With dead ends: 77 [2019-09-03 19:19:51,991 INFO L226 Difference]: Without dead ends: 60 [2019-09-03 19:19:51,992 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=155, Invalid=657, Unknown=0, NotChecked=0, Total=812 [2019-09-03 19:19:51,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-03 19:19:52,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 40. [2019-09-03 19:19:52,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-03 19:19:52,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2019-09-03 19:19:52,007 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 19 [2019-09-03 19:19:52,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:52,008 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2019-09-03 19:19:52,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 19:19:52,008 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2019-09-03 19:19:52,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-03 19:19:52,009 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:52,009 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:52,009 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:52,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:52,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1947791941, now seen corresponding path program 1 times [2019-09-03 19:19:52,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:52,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:52,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:52,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:52,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:52,618 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:19:52,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:19:52,619 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:19:52,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:19:52,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:52,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 19:19:52,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:19:52,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:52,814 INFO L341 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2019-09-03 19:19:52,815 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 29 [2019-09-03 19:19:52,815 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:19:52,832 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:52,833 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:19:52,834 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:46 [2019-09-03 19:19:53,085 INFO L341 Elim1Store]: treesize reduction 17, result has 85.8 percent of original size [2019-09-03 19:19:53,086 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 123 [2019-09-03 19:19:53,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:53,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:53,089 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:19:53,134 INFO L567 ElimStorePlain]: treesize reduction 132, result has 21.9 percent of original size [2019-09-03 19:19:53,136 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:19:53,137 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:65, output treesize:29 [2019-09-03 19:19:53,271 INFO L341 Elim1Store]: treesize reduction 27, result has 67.1 percent of original size [2019-09-03 19:19:53,272 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 66 [2019-09-03 19:19:53,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:53,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:53,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:53,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:53,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:53,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:53,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:53,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:53,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:53,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:53,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:53,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:53,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:53,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:53,303 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-09-03 19:19:53,333 INFO L567 ElimStorePlain]: treesize reduction 123, result has 8.9 percent of original size [2019-09-03 19:19:53,334 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:19:53,334 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2019-09-03 19:19:53,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:53,386 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:19:53,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:19:53,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 26 [2019-09-03 19:19:53,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-03 19:19:53,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-03 19:19:53,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2019-09-03 19:19:53,396 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand 26 states. [2019-09-03 19:19:54,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:54,420 INFO L93 Difference]: Finished difference Result 115 states and 144 transitions. [2019-09-03 19:19:54,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-03 19:19:54,423 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 22 [2019-09-03 19:19:54,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:54,426 INFO L225 Difference]: With dead ends: 115 [2019-09-03 19:19:54,426 INFO L226 Difference]: Without dead ends: 84 [2019-09-03 19:19:54,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=196, Invalid=1210, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 19:19:54,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-09-03 19:19:54,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 49. [2019-09-03 19:19:54,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-03 19:19:54,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2019-09-03 19:19:54,438 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 22 [2019-09-03 19:19:54,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:54,438 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2019-09-03 19:19:54,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-03 19:19:54,439 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2019-09-03 19:19:54,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-03 19:19:54,440 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:54,440 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:54,440 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:54,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:54,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1126706988, now seen corresponding path program 2 times [2019-09-03 19:19:54,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:54,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:54,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:54,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:54,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:54,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:54,999 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:19:54,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:19:54,999 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-03 19:19:55,028 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:19:55,050 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:19:55,050 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:19:55,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 19:19:55,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:19:55,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:55,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:19:55,248 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-09-03 19:19:55,249 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:19:55,277 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:55,279 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:19:55,279 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2019-09-03 19:19:55,386 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2019-09-03 19:19:55,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:19:55,390 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:19:55,390 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:19:55,399 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:19:55,402 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:19:55,403 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:19:55,404 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:19:55,405 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 29 [2019-09-03 19:19:55,407 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:19:55,421 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:55,422 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:19:55,431 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:55,432 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-03 19:19:55,432 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:17 [2019-09-03 19:19:55,451 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:55,451 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-09-03 19:19:55,452 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:19:55,454 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:55,454 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-03 19:19:55,454 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-03 19:19:55,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:55,489 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 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-03 19:19:55,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:19:55,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 21 [2019-09-03 19:19:55,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 19:19:55,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 19:19:55,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2019-09-03 19:19:55,494 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand 21 states. [2019-09-03 19:19:56,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:56,113 INFO L93 Difference]: Finished difference Result 96 states and 115 transitions. [2019-09-03 19:19:56,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-03 19:19:56,116 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 25 [2019-09-03 19:19:56,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:56,119 INFO L225 Difference]: With dead ends: 96 [2019-09-03 19:19:56,119 INFO L226 Difference]: Without dead ends: 94 [2019-09-03 19:19:56,120 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 13 SyntacticMatches, 8 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=134, Invalid=736, Unknown=0, NotChecked=0, Total=870 [2019-09-03 19:19:56,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-09-03 19:19:56,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 55. [2019-09-03 19:19:56,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-03 19:19:56,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2019-09-03 19:19:56,131 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 25 [2019-09-03 19:19:56,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:56,132 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2019-09-03 19:19:56,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 19:19:56,132 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2019-09-03 19:19:56,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-03 19:19:56,133 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:56,133 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:56,134 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:56,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:56,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1757940304, now seen corresponding path program 1 times [2019-09-03 19:19:56,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:56,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:56,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:56,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:19:56,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:56,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:56,264 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:19:56,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:19:56,265 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:19:56,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:56,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:56,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 19:19:56,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:19:56,343 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:19:56,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:19:56,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-09-03 19:19:56,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 19:19:56,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 19:19:56,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:19:56,349 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. Second operand 9 states. [2019-09-03 19:19:56,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:56,452 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2019-09-03 19:19:56,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 19:19:56,453 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2019-09-03 19:19:56,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:56,454 INFO L225 Difference]: With dead ends: 93 [2019-09-03 19:19:56,454 INFO L226 Difference]: Without dead ends: 77 [2019-09-03 19:19:56,455 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:19:56,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-09-03 19:19:56,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 61. [2019-09-03 19:19:56,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-03 19:19:56,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2019-09-03 19:19:56,478 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 27 [2019-09-03 19:19:56,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:56,478 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2019-09-03 19:19:56,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 19:19:56,478 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2019-09-03 19:19:56,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 19:19:56,481 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:56,481 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:56,481 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:56,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:56,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1735507290, now seen corresponding path program 1 times [2019-09-03 19:19:56,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:56,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:56,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:56,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:56,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:56,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:56,907 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:19:56,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:19:56,908 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:19:56,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:19:56,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:56,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-03 19:19:56,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:19:57,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:57,126 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:19:57,128 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2019-09-03 19:19:57,129 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:19:57,200 INFO L567 ElimStorePlain]: treesize reduction 7, result has 82.5 percent of original size [2019-09-03 19:19:57,201 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-03 19:19:57,201 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:30 [2019-09-03 19:19:57,233 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:57,234 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-09-03 19:19:57,235 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:19:57,238 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:57,238 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-03 19:19:57,238 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-03 19:19:57,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:57,279 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:19:57,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:19:57,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 19 [2019-09-03 19:19:57,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 19:19:57,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 19:19:57,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2019-09-03 19:19:57,291 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand 19 states. [2019-09-03 19:19:58,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:58,535 INFO L93 Difference]: Finished difference Result 152 states and 191 transitions. [2019-09-03 19:19:58,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-03 19:19:58,536 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 28 [2019-09-03 19:19:58,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:58,538 INFO L225 Difference]: With dead ends: 152 [2019-09-03 19:19:58,538 INFO L226 Difference]: Without dead ends: 116 [2019-09-03 19:19:58,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 727 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=394, Invalid=2258, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 19:19:58,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-09-03 19:19:58,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 58. [2019-09-03 19:19:58,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-03 19:19:58,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2019-09-03 19:19:58,549 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 28 [2019-09-03 19:19:58,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:58,549 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2019-09-03 19:19:58,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 19:19:58,550 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2019-09-03 19:19:58,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 19:19:58,551 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:58,551 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:58,551 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:58,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:58,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1034442712, now seen corresponding path program 2 times [2019-09-03 19:19:58,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:58,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:58,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:58,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:58,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:58,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:58,599 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:19:58,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:19:58,600 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-03 19:19:58,618 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:19:58,638 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:19:58,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:19:58,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-03 19:19:58,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:19:58,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:58,645 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:19:58,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:19:58,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-09-03 19:19:58,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 19:19:58,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 19:19:58,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:19:58,650 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand 7 states. [2019-09-03 19:19:58,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:58,778 INFO L93 Difference]: Finished difference Result 130 states and 165 transitions. [2019-09-03 19:19:58,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 19:19:58,779 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-09-03 19:19:58,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:58,780 INFO L225 Difference]: With dead ends: 130 [2019-09-03 19:19:58,780 INFO L226 Difference]: Without dead ends: 95 [2019-09-03 19:19:58,781 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-09-03 19:19:58,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-09-03 19:19:58,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 63. [2019-09-03 19:19:58,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-03 19:19:58,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2019-09-03 19:19:58,791 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 28 [2019-09-03 19:19:58,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:58,791 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2019-09-03 19:19:58,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 19:19:58,792 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2019-09-03 19:19:58,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 19:19:58,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:58,793 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:58,793 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:58,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:58,793 INFO L82 PathProgramCache]: Analyzing trace with hash -215590674, now seen corresponding path program 3 times [2019-09-03 19:19:58,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:58,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:58,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:58,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:19:58,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:58,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:59,354 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:19:59,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:19:59,355 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:19:59,376 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:19:59,400 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-03 19:19:59,400 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:19:59,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-03 19:19:59,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:19:59,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:59,425 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:19:59,426 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 29 [2019-09-03 19:19:59,427 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:19:59,440 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:59,440 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:19:59,440 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:48 [2019-09-03 19:19:59,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:19:59,595 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:19:59,597 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:59,597 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 44 [2019-09-03 19:19:59,598 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:19:59,618 INFO L567 ElimStorePlain]: treesize reduction 12, result has 76.9 percent of original size [2019-09-03 19:19:59,619 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:19:59,620 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:37 [2019-09-03 19:19:59,783 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:19:59,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:19:59,787 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:19:59,788 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:59,789 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2019-09-03 19:19:59,790 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:19:59,802 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:59,803 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:19:59,804 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:27 [2019-09-03 19:19:59,862 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:59,862 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2019-09-03 19:19:59,863 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:19:59,865 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:19:59,866 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-03 19:19:59,866 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2019-09-03 19:19:59,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:19:59,921 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:19:59,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:19:59,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 25 [2019-09-03 19:19:59,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 19:19:59,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 19:19:59,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2019-09-03 19:19:59,927 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand 25 states. [2019-09-03 19:20:01,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:20:01,255 INFO L93 Difference]: Finished difference Result 107 states and 126 transitions. [2019-09-03 19:20:01,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-03 19:20:01,256 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 28 [2019-09-03 19:20:01,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:20:01,259 INFO L225 Difference]: With dead ends: 107 [2019-09-03 19:20:01,259 INFO L226 Difference]: Without dead ends: 105 [2019-09-03 19:20:01,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 14 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=259, Invalid=1547, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 19:20:01,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-09-03 19:20:01,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 69. [2019-09-03 19:20:01,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-03 19:20:01,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2019-09-03 19:20:01,274 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 28 [2019-09-03 19:20:01,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:20:01,274 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2019-09-03 19:20:01,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 19:20:01,274 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2019-09-03 19:20:01,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-03 19:20:01,275 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:20:01,276 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:20:01,276 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:20:01,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:20:01,276 INFO L82 PathProgramCache]: Analyzing trace with hash 2095767967, now seen corresponding path program 3 times [2019-09-03 19:20:01,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:20:01,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:20:01,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:01,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:20:01,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:01,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:20:01,935 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:20:01,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:20:01,935 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:20:01,948 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:20:01,985 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-03 19:20:01,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:20:01,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 19:20:01,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:20:02,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:02,112 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:02,113 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-09-03 19:20:02,113 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:02,124 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:02,125 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-03 19:20:02,126 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2019-09-03 19:20:02,177 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:02,179 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:02,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:02,182 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:02,183 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-09-03 19:20:02,183 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:02,194 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:02,194 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-03 19:20:02,194 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:20 [2019-09-03 19:20:02,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:02,270 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:02,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:02,271 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:02,272 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-09-03 19:20:02,272 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:02,281 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:02,282 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-03 19:20:02,283 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:17 [2019-09-03 19:20:02,325 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:02,326 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-09-03 19:20:02,327 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:02,329 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:02,329 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-03 19:20:02,329 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-03 19:20:02,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:02,374 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:20:02,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:20:02,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2019-09-03 19:20:02,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 19:20:02,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 19:20:02,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2019-09-03 19:20:02,381 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. Second operand 25 states. [2019-09-03 19:20:03,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:20:03,234 INFO L93 Difference]: Finished difference Result 119 states and 141 transitions. [2019-09-03 19:20:03,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 19:20:03,235 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 31 [2019-09-03 19:20:03,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:20:03,236 INFO L225 Difference]: With dead ends: 119 [2019-09-03 19:20:03,237 INFO L226 Difference]: Without dead ends: 117 [2019-09-03 19:20:03,238 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=218, Invalid=1188, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 19:20:03,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-09-03 19:20:03,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 78. [2019-09-03 19:20:03,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-09-03 19:20:03,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 94 transitions. [2019-09-03 19:20:03,247 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 94 transitions. Word has length 31 [2019-09-03 19:20:03,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:20:03,248 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 94 transitions. [2019-09-03 19:20:03,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 19:20:03,248 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 94 transitions. [2019-09-03 19:20:03,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-03 19:20:03,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:20:03,249 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:20:03,249 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:20:03,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:20:03,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1274271122, now seen corresponding path program 4 times [2019-09-03 19:20:03,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:20:03,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:20:03,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:03,251 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:20:03,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:03,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:20:03,520 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:20:03,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:20:03,520 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:20:03,531 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:20:03,551 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:20:03,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:20:03,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 19:20:03,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:20:03,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:03,655 INFO L341 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2019-09-03 19:20:03,655 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 29 [2019-09-03 19:20:03,656 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:03,664 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:03,665 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:20:03,666 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:42 [2019-09-03 19:20:03,823 INFO L341 Elim1Store]: treesize reduction 17, result has 85.8 percent of original size [2019-09-03 19:20:03,824 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 123 [2019-09-03 19:20:03,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:03,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:03,827 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:03,866 INFO L567 ElimStorePlain]: treesize reduction 128, result has 22.9 percent of original size [2019-09-03 19:20:03,867 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-03 19:20:03,868 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:61, output treesize:35 [2019-09-03 19:20:04,010 INFO L341 Elim1Store]: treesize reduction 10, result has 88.2 percent of original size [2019-09-03 19:20:04,011 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 86 [2019-09-03 19:20:04,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:04,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:04,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:04,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:04,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:04,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:04,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:04,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:04,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:04,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:04,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:04,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:04,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:04,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:04,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:04,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:04,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:04,026 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-03 19:20:04,070 INFO L567 ElimStorePlain]: treesize reduction 193, result has 8.1 percent of original size [2019-09-03 19:20:04,070 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:20:04,071 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:51, output treesize:5 [2019-09-03 19:20:04,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:04,111 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-03 19:20:04,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:20:04,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2019-09-03 19:20:04,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 19:20:04,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 19:20:04,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2019-09-03 19:20:04,116 INFO L87 Difference]: Start difference. First operand 78 states and 94 transitions. Second operand 24 states. [2019-09-03 19:20:05,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:20:05,947 INFO L93 Difference]: Finished difference Result 173 states and 212 transitions. [2019-09-03 19:20:05,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-03 19:20:05,948 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 31 [2019-09-03 19:20:05,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:20:05,950 INFO L225 Difference]: With dead ends: 173 [2019-09-03 19:20:05,950 INFO L226 Difference]: Without dead ends: 137 [2019-09-03 19:20:05,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 787 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=379, Invalid=2701, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 19:20:05,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-09-03 19:20:05,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 78. [2019-09-03 19:20:05,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-09-03 19:20:05,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 92 transitions. [2019-09-03 19:20:05,964 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 92 transitions. Word has length 31 [2019-09-03 19:20:05,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:20:05,964 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 92 transitions. [2019-09-03 19:20:05,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 19:20:05,964 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 92 transitions. [2019-09-03 19:20:05,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-03 19:20:05,965 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:20:05,966 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:20:05,966 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:20:05,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:20:05,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1796724579, now seen corresponding path program 2 times [2019-09-03 19:20:05,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:20:05,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:20:05,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:05,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:20:05,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:05,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:20:06,161 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:20:06,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:20:06,162 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:20:06,185 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:20:06,207 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:20:06,207 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:20:06,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-03 19:20:06,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:20:06,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:06,342 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:06,343 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-09-03 19:20:06,343 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:06,351 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:06,351 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-03 19:20:06,352 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-09-03 19:20:06,529 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:06,529 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-09-03 19:20:06,530 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:06,531 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:06,531 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-03 19:20:06,531 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-03 19:20:06,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:06,564 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:20:06,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:20:06,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 27 [2019-09-03 19:20:06,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 19:20:06,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 19:20:06,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=621, Unknown=0, NotChecked=0, Total=702 [2019-09-03 19:20:06,570 INFO L87 Difference]: Start difference. First operand 78 states and 92 transitions. Second operand 27 states. [2019-09-03 19:20:21,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:20:21,761 INFO L93 Difference]: Finished difference Result 125 states and 143 transitions. [2019-09-03 19:20:21,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-03 19:20:21,761 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 33 [2019-09-03 19:20:21,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:20:21,762 INFO L225 Difference]: With dead ends: 125 [2019-09-03 19:20:21,762 INFO L226 Difference]: Without dead ends: 123 [2019-09-03 19:20:21,763 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=214, Invalid=1346, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 19:20:21,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-09-03 19:20:21,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 93. [2019-09-03 19:20:21,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-09-03 19:20:21,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 109 transitions. [2019-09-03 19:20:21,775 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 109 transitions. Word has length 33 [2019-09-03 19:20:21,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:20:21,776 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 109 transitions. [2019-09-03 19:20:21,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 19:20:21,776 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 109 transitions. [2019-09-03 19:20:21,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-03 19:20:21,777 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:20:21,777 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:20:21,777 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:20:21,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:20:21,778 INFO L82 PathProgramCache]: Analyzing trace with hash -101781095, now seen corresponding path program 2 times [2019-09-03 19:20:21,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:20:21,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:20:21,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:21,779 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:20:21,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:21,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:20:22,188 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:20:22,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:20:22,189 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-03 19:20:22,200 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:20:22,236 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:20:22,236 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:20:22,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-03 19:20:22,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:20:22,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:22,475 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:22,476 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-09-03 19:20:22,477 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:22,489 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:22,489 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:20:22,490 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2019-09-03 19:20:22,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:22,578 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:22,580 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:22,581 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:22,582 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-09-03 19:20:22,583 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:22,591 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:22,592 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-03 19:20:22,592 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:17 [2019-09-03 19:20:22,629 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:22,630 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-09-03 19:20:22,630 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:22,632 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:22,632 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-03 19:20:22,633 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-03 19:20:22,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:22,680 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:20:22,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:20:22,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 27 [2019-09-03 19:20:22,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 19:20:22,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 19:20:22,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=594, Unknown=0, NotChecked=0, Total=702 [2019-09-03 19:20:22,684 INFO L87 Difference]: Start difference. First operand 93 states and 109 transitions. Second operand 27 states. [2019-09-03 19:20:24,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:20:24,029 INFO L93 Difference]: Finished difference Result 162 states and 192 transitions. [2019-09-03 19:20:24,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 19:20:24,031 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 34 [2019-09-03 19:20:24,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:20:24,032 INFO L225 Difference]: With dead ends: 162 [2019-09-03 19:20:24,033 INFO L226 Difference]: Without dead ends: 160 [2019-09-03 19:20:24,034 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=280, Invalid=1526, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 19:20:24,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-09-03 19:20:24,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 93. [2019-09-03 19:20:24,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-09-03 19:20:24,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 109 transitions. [2019-09-03 19:20:24,053 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 109 transitions. Word has length 34 [2019-09-03 19:20:24,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:20:24,053 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 109 transitions. [2019-09-03 19:20:24,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 19:20:24,053 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 109 transitions. [2019-09-03 19:20:24,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-03 19:20:24,054 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:20:24,054 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:20:24,055 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:20:24,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:20:24,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1218981667, now seen corresponding path program 1 times [2019-09-03 19:20:24,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:20:24,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:20:24,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:24,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:20:24,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:24,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:20:24,412 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:20:24,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:20:24,413 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:20:24,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:20:24,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:20:24,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-03 19:20:24,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:20:24,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:24,569 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:24,570 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2019-09-03 19:20:24,570 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:24,581 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:24,581 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:20:24,582 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2019-09-03 19:20:24,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:24,700 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:20:24,702 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:24,702 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 39 [2019-09-03 19:20:24,703 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:24,726 INFO L567 ElimStorePlain]: treesize reduction 9, result has 78.6 percent of original size [2019-09-03 19:20:24,727 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:20:24,727 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:30 [2019-09-03 19:20:24,964 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:24,965 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:20:24,967 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:24,967 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 15 [2019-09-03 19:20:24,968 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:24,974 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:24,974 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-03 19:20:24,975 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:5 [2019-09-03 19:20:24,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:25,020 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:20:25,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:20:25,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 31 [2019-09-03 19:20:25,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 19:20:25,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 19:20:25,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=840, Unknown=0, NotChecked=0, Total=930 [2019-09-03 19:20:25,025 INFO L87 Difference]: Start difference. First operand 93 states and 109 transitions. Second operand 31 states. [2019-09-03 19:20:26,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:20:26,109 INFO L93 Difference]: Finished difference Result 138 states and 158 transitions. [2019-09-03 19:20:26,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-03 19:20:26,110 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 36 [2019-09-03 19:20:26,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:20:26,112 INFO L225 Difference]: With dead ends: 138 [2019-09-03 19:20:26,112 INFO L226 Difference]: Without dead ends: 136 [2019-09-03 19:20:26,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=186, Invalid=1536, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 19:20:26,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-09-03 19:20:26,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 93. [2019-09-03 19:20:26,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-09-03 19:20:26,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 109 transitions. [2019-09-03 19:20:26,124 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 109 transitions. Word has length 36 [2019-09-03 19:20:26,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:20:26,124 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 109 transitions. [2019-09-03 19:20:26,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 19:20:26,125 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 109 transitions. [2019-09-03 19:20:26,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-03 19:20:26,125 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:20:26,126 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:20:26,126 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:20:26,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:20:26,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1021012705, now seen corresponding path program 3 times [2019-09-03 19:20:26,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:20:26,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:20:26,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:26,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:20:26,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:20:26,472 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:20:26,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:20:26,473 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:20:26,504 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:20:26,546 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-03 19:20:26,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:20:26,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 19:20:26,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:20:26,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:26,752 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:26,753 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-09-03 19:20:26,753 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:26,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:26,760 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-03 19:20:26,760 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-09-03 19:20:26,793 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:26,794 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-09-03 19:20:26,794 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:26,799 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:26,800 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-03 19:20:26,800 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-03 19:20:26,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:26,846 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:20:26,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:20:26,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 24 [2019-09-03 19:20:26,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 19:20:26,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 19:20:26,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2019-09-03 19:20:26,852 INFO L87 Difference]: Start difference. First operand 93 states and 109 transitions. Second operand 24 states. [2019-09-03 19:20:28,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:20:28,986 INFO L93 Difference]: Finished difference Result 285 states and 347 transitions. [2019-09-03 19:20:28,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-03 19:20:28,986 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 37 [2019-09-03 19:20:28,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:20:28,988 INFO L225 Difference]: With dead ends: 285 [2019-09-03 19:20:28,988 INFO L226 Difference]: Without dead ends: 252 [2019-09-03 19:20:28,991 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 25 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1515 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=682, Invalid=4720, Unknown=0, NotChecked=0, Total=5402 [2019-09-03 19:20:28,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-09-03 19:20:29,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 117. [2019-09-03 19:20:29,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-09-03 19:20:29,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 141 transitions. [2019-09-03 19:20:29,008 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 141 transitions. Word has length 37 [2019-09-03 19:20:29,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:20:29,009 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 141 transitions. [2019-09-03 19:20:29,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 19:20:29,009 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 141 transitions. [2019-09-03 19:20:29,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-03 19:20:29,010 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:20:29,010 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:20:29,010 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:20:29,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:20:29,011 INFO L82 PathProgramCache]: Analyzing trace with hash -687742111, now seen corresponding path program 5 times [2019-09-03 19:20:29,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:20:29,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:20:29,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:29,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:20:29,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:29,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:20:29,588 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:20:29,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:20:29,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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:20:29,604 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:20:29,636 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-03 19:20:29,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:20:29,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 19:20:29,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:20:29,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:29,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:29,936 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-09-03 19:20:29,936 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 30 [2019-09-03 19:20:29,937 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:29,949 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:29,949 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:20:29,949 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2019-09-03 19:20:30,001 INFO L341 Elim1Store]: treesize reduction 60, result has 16.7 percent of original size [2019-09-03 19:20:30,002 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 33 [2019-09-03 19:20:30,003 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:30,018 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:30,019 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-03 19:20:30,019 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:30 [2019-09-03 19:20:30,222 INFO L341 Elim1Store]: treesize reduction 18, result has 85.6 percent of original size [2019-09-03 19:20:30,223 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 124 [2019-09-03 19:20:30,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:30,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:30,226 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:30,280 INFO L567 ElimStorePlain]: treesize reduction 81, result has 35.7 percent of original size [2019-09-03 19:20:30,281 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:20:30,282 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:30 [2019-09-03 19:20:30,411 INFO L341 Elim1Store]: treesize reduction 28, result has 67.1 percent of original size [2019-09-03 19:20:30,412 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 68 [2019-09-03 19:20:30,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:30,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:30,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:30,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:30,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:30,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:30,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:30,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:30,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:30,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:30,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:30,420 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-03 19:20:30,463 INFO L567 ElimStorePlain]: treesize reduction 107, result has 10.1 percent of original size [2019-09-03 19:20:30,463 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:20:30,463 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:5 [2019-09-03 19:20:30,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:30,515 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:20:30,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:20:30,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 36 [2019-09-03 19:20:30,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-03 19:20:30,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-03 19:20:30,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1149, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 19:20:30,520 INFO L87 Difference]: Start difference. First operand 117 states and 141 transitions. Second operand 36 states. [2019-09-03 19:20:32,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:20:32,594 INFO L93 Difference]: Finished difference Result 202 states and 245 transitions. [2019-09-03 19:20:32,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-03 19:20:32,594 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 37 [2019-09-03 19:20:32,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:20:32,596 INFO L225 Difference]: With dead ends: 202 [2019-09-03 19:20:32,597 INFO L226 Difference]: Without dead ends: 200 [2019-09-03 19:20:32,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=380, Invalid=3042, Unknown=0, NotChecked=0, Total=3422 [2019-09-03 19:20:32,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-09-03 19:20:32,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 114. [2019-09-03 19:20:32,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-09-03 19:20:32,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 137 transitions. [2019-09-03 19:20:32,615 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 137 transitions. Word has length 37 [2019-09-03 19:20:32,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:20:32,615 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 137 transitions. [2019-09-03 19:20:32,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-03 19:20:32,616 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 137 transitions. [2019-09-03 19:20:32,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-03 19:20:32,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:20:32,616 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:20:32,617 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:20:32,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:20:32,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1858975791, now seen corresponding path program 6 times [2019-09-03 19:20:32,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:20:32,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:20:32,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:32,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:20:32,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:20:33,437 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:20:33,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:20:33,438 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:20:33,459 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:20:33,495 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-09-03 19:20:33,496 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:20:33,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 19:20:33,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:20:33,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:33,601 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:33,601 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 29 [2019-09-03 19:20:33,602 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:33,616 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:33,616 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:20:33,617 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:49 [2019-09-03 19:20:33,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:33,741 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:20:33,742 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:33,743 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 44 [2019-09-03 19:20:33,743 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:33,766 INFO L567 ElimStorePlain]: treesize reduction 12, result has 74.5 percent of original size [2019-09-03 19:20:33,767 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-03 19:20:33,767 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:32 [2019-09-03 19:20:33,886 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:33,888 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:33,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:33,890 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:33,890 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 41 [2019-09-03 19:20:33,890 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:33,900 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:33,900 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-03 19:20:33,900 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:33 [2019-09-03 19:20:33,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:33,983 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:33,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:33,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:33,987 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:33,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:33,989 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:33,990 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 53 [2019-09-03 19:20:33,990 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:34,002 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:34,002 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:20:34,002 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:57, output treesize:53 [2019-09-03 19:20:34,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:34,127 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:34,130 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:34,133 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:34,134 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:34,135 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:34,136 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:34,136 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 56 [2019-09-03 19:20:34,137 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:34,148 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:34,149 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:20:34,150 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:69, output treesize:32 [2019-09-03 19:20:34,262 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:34,263 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:20:34,264 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:20:34,269 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:34,269 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 18 [2019-09-03 19:20:34,270 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:34,278 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:34,278 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-03 19:20:34,278 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:5 [2019-09-03 19:20:34,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:34,363 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (16)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:20:34,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:20:34,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 36 [2019-09-03 19:20:34,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-03 19:20:34,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-03 19:20:34,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1123, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 19:20:34,368 INFO L87 Difference]: Start difference. First operand 114 states and 137 transitions. Second operand 36 states. [2019-09-03 19:20:36,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:20:36,118 INFO L93 Difference]: Finished difference Result 179 states and 212 transitions. [2019-09-03 19:20:36,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 19:20:36,120 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 37 [2019-09-03 19:20:36,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:20:36,122 INFO L225 Difference]: With dead ends: 179 [2019-09-03 19:20:36,122 INFO L226 Difference]: Without dead ends: 177 [2019-09-03 19:20:36,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=322, Invalid=2648, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 19:20:36,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-09-03 19:20:36,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 114. [2019-09-03 19:20:36,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-09-03 19:20:36,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 137 transitions. [2019-09-03 19:20:36,139 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 137 transitions. Word has length 37 [2019-09-03 19:20:36,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:20:36,139 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 137 transitions. [2019-09-03 19:20:36,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-03 19:20:36,139 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 137 transitions. [2019-09-03 19:20:36,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-03 19:20:36,140 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:20:36,140 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:20:36,140 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:20:36,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:20:36,140 INFO L82 PathProgramCache]: Analyzing trace with hash -221878570, now seen corresponding path program 3 times [2019-09-03 19:20:36,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:20:36,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:20:36,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:36,141 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:20:36,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:36,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:20:36,418 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:20:36,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:20:36,418 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:20:36,429 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:20:36,454 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-03 19:20:36,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:20:36,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 19:20:36,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:20:36,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:36,594 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:36,595 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-09-03 19:20:36,595 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:36,604 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:36,604 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-03 19:20:36,605 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2019-09-03 19:20:36,707 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:36,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:36,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:36,710 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:36,711 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-09-03 19:20:36,711 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:36,719 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:36,720 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-03 19:20:36,720 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2019-09-03 19:20:36,997 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:36,997 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-09-03 19:20:36,998 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:37,000 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:37,000 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-03 19:20:37,001 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-03 19:20:37,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:37,079 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (17)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:20:37,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:20:37,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 33 [2019-09-03 19:20:37,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 19:20:37,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 19:20:37,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=934, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 19:20:37,084 INFO L87 Difference]: Start difference. First operand 114 states and 137 transitions. Second operand 33 states. [2019-09-03 19:20:55,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:20:55,731 INFO L93 Difference]: Finished difference Result 188 states and 219 transitions. [2019-09-03 19:20:55,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 19:20:55,732 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 39 [2019-09-03 19:20:55,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:20:55,734 INFO L225 Difference]: With dead ends: 188 [2019-09-03 19:20:55,734 INFO L226 Difference]: Without dead ends: 186 [2019-09-03 19:20:55,735 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=324, Invalid=2126, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 19:20:55,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-09-03 19:20:55,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 126. [2019-09-03 19:20:55,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-09-03 19:20:55,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 153 transitions. [2019-09-03 19:20:55,751 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 153 transitions. Word has length 39 [2019-09-03 19:20:55,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:20:55,751 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 153 transitions. [2019-09-03 19:20:55,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 19:20:55,751 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 153 transitions. [2019-09-03 19:20:55,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-03 19:20:55,752 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:20:55,752 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:20:55,752 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:20:55,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:20:55,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1686802267, now seen corresponding path program 1 times [2019-09-03 19:20:55,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:20:55,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:20:55,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:55,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:20:55,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:55,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:20:56,732 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:20:56,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:20:56,732 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:20:56,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:20:56,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:20:56,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 19:20:56,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:20:56,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:56,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:56,862 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-09-03 19:20:56,862 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:56,878 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:56,879 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-03 19:20:56,879 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2019-09-03 19:20:56,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:56,940 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:56,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:56,942 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:56,942 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 29 [2019-09-03 19:20:56,943 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:56,951 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:56,951 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:20:56,952 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2019-09-03 19:20:57,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:57,088 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:57,089 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:57,090 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:20:57,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:57,096 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:20:57,098 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:57,098 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 58 [2019-09-03 19:20:57,099 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:57,123 INFO L567 ElimStorePlain]: treesize reduction 32, result has 59.5 percent of original size [2019-09-03 19:20:57,124 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:20:57,125 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:47 [2019-09-03 19:20:57,283 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:57,284 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:57,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:57,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:57,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:20:57,300 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:57,300 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 54 treesize of output 89 [2019-09-03 19:20:57,301 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:57,344 INFO L567 ElimStorePlain]: treesize reduction 25, result has 75.2 percent of original size [2019-09-03 19:20:57,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:57,346 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-03 19:20:57,347 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:66, output treesize:78 [2019-09-03 19:20:57,552 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:57,553 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-09-03 19:20:57,553 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:20:57,560 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:20:57,561 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-03 19:20:57,561 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-03 19:20:57,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:20:57,664 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:20:57,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:20:57,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 25] total 37 [2019-09-03 19:20:57,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 19:20:57,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 19:20:57,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1206, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 19:20:57,673 INFO L87 Difference]: Start difference. First operand 126 states and 153 transitions. Second operand 37 states. [2019-09-03 19:21:11,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:21:11,606 INFO L93 Difference]: Finished difference Result 192 states and 223 transitions. [2019-09-03 19:21:11,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-03 19:21:11,606 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 39 [2019-09-03 19:21:11,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:21:11,607 INFO L225 Difference]: With dead ends: 192 [2019-09-03 19:21:11,608 INFO L226 Difference]: Without dead ends: 190 [2019-09-03 19:21:11,609 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 18 SyntacticMatches, 9 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1328 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=405, Invalid=3885, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 19:21:11,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-09-03 19:21:11,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 132. [2019-09-03 19:21:11,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-09-03 19:21:11,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 160 transitions. [2019-09-03 19:21:11,629 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 160 transitions. Word has length 39 [2019-09-03 19:21:11,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:21:11,629 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 160 transitions. [2019-09-03 19:21:11,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 19:21:11,629 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 160 transitions. [2019-09-03 19:21:11,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-03 19:21:11,630 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:21:11,630 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:21:11,630 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:21:11,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:21:11,630 INFO L82 PathProgramCache]: Analyzing trace with hash -141338470, now seen corresponding path program 4 times [2019-09-03 19:21:11,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:21:11,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:21:11,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:21:11,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:21:11,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:21:11,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:21:11,736 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 19:21:11,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:21:11,736 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:21:11,759 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:21:11,777 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:21:11,777 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:21:11,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 19:21:11,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:21:11,841 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 19:21:11,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:21:11,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2019-09-03 19:21:11,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 19:21:11,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 19:21:11,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:21:11,845 INFO L87 Difference]: Start difference. First operand 132 states and 160 transitions. Second operand 12 states. [2019-09-03 19:21:12,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:21:12,007 INFO L93 Difference]: Finished difference Result 168 states and 200 transitions. [2019-09-03 19:21:12,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 19:21:12,007 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2019-09-03 19:21:12,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:21:12,008 INFO L225 Difference]: With dead ends: 168 [2019-09-03 19:21:12,008 INFO L226 Difference]: Without dead ends: 148 [2019-09-03 19:21:12,008 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-09-03 19:21:12,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-09-03 19:21:12,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 139. [2019-09-03 19:21:12,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-09-03 19:21:12,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 165 transitions. [2019-09-03 19:21:12,034 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 165 transitions. Word has length 41 [2019-09-03 19:21:12,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:21:12,034 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 165 transitions. [2019-09-03 19:21:12,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 19:21:12,035 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 165 transitions. [2019-09-03 19:21:12,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-03 19:21:12,037 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:21:12,037 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:21:12,037 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:21:12,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:21:12,037 INFO L82 PathProgramCache]: Analyzing trace with hash 706685066, now seen corresponding path program 2 times [2019-09-03 19:21:12,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:21:12,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:21:12,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:21:12,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:21:12,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:21:12,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:21:12,463 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:21:12,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:21:12,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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:21:12,474 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:21:12,497 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:21:12,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:21:12,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-03 19:21:12,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:21:12,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:21:12,643 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:12,643 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-09-03 19:21:12,643 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:12,650 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:12,651 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-03 19:21:12,651 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-09-03 19:21:12,851 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:12,851 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-09-03 19:21:12,852 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:12,853 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:12,853 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-03 19:21:12,853 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-03 19:21:12,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:21:12,895 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:21:12,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:21:12,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 31 [2019-09-03 19:21:12,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 19:21:12,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 19:21:12,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=837, Unknown=0, NotChecked=0, Total=930 [2019-09-03 19:21:12,900 INFO L87 Difference]: Start difference. First operand 139 states and 165 transitions. Second operand 31 states. [2019-09-03 19:21:36,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:21:36,282 INFO L93 Difference]: Finished difference Result 237 states and 277 transitions. [2019-09-03 19:21:36,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-03 19:21:36,282 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 42 [2019-09-03 19:21:36,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:21:36,285 INFO L225 Difference]: With dead ends: 237 [2019-09-03 19:21:36,285 INFO L226 Difference]: Without dead ends: 235 [2019-09-03 19:21:36,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 947 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=419, Invalid=3121, Unknown=0, NotChecked=0, Total=3540 [2019-09-03 19:21:36,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-09-03 19:21:36,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 166. [2019-09-03 19:21:36,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-09-03 19:21:36,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 196 transitions. [2019-09-03 19:21:36,319 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 196 transitions. Word has length 42 [2019-09-03 19:21:36,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:21:36,320 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 196 transitions. [2019-09-03 19:21:36,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 19:21:36,320 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 196 transitions. [2019-09-03 19:21:36,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-03 19:21:36,321 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:21:36,321 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:21:36,321 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:21:36,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:21:36,321 INFO L82 PathProgramCache]: Analyzing trace with hash -115352368, now seen corresponding path program 3 times [2019-09-03 19:21:36,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:21:36,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:21:36,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:21:36,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:21:36,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:21:36,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:21:36,708 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:21:36,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:21:36,708 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:21:36,719 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:21:36,771 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-03 19:21:36,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:21:36,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 19:21:36,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:21:36,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:21:36,878 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:36,879 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 29 [2019-09-03 19:21:36,879 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:36,891 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:36,891 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:21:36,892 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:45 [2019-09-03 19:21:37,034 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:37,035 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:21:37,036 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:37,036 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 44 [2019-09-03 19:21:37,036 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:37,067 INFO L567 ElimStorePlain]: treesize reduction 12, result has 76.9 percent of original size [2019-09-03 19:21:37,067 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:21:37,068 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:37 [2019-09-03 19:21:37,216 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:37,217 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:37,219 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:37,219 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:37,220 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2019-09-03 19:21:37,220 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:37,229 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:37,230 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:21:37,230 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:30 [2019-09-03 19:21:37,502 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:37,502 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:21:37,504 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:37,504 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 15 [2019-09-03 19:21:37,505 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:37,509 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:37,510 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-03 19:21:37,510 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:5 [2019-09-03 19:21:37,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:21:37,575 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:21:37,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:21:37,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 37 [2019-09-03 19:21:37,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 19:21:37,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 19:21:37,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1191, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 19:21:37,579 INFO L87 Difference]: Start difference. First operand 166 states and 196 transitions. Second operand 37 states. [2019-09-03 19:21:39,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:21:39,039 INFO L93 Difference]: Finished difference Result 227 states and 265 transitions. [2019-09-03 19:21:39,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-03 19:21:39,041 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 42 [2019-09-03 19:21:39,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:21:39,043 INFO L225 Difference]: With dead ends: 227 [2019-09-03 19:21:39,044 INFO L226 Difference]: Without dead ends: 225 [2019-09-03 19:21:39,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 917 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=349, Invalid=2731, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 19:21:39,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-09-03 19:21:39,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 178. [2019-09-03 19:21:39,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-09-03 19:21:39,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 211 transitions. [2019-09-03 19:21:39,085 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 211 transitions. Word has length 42 [2019-09-03 19:21:39,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:21:39,085 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 211 transitions. [2019-09-03 19:21:39,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 19:21:39,086 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 211 transitions. [2019-09-03 19:21:39,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-03 19:21:39,086 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:21:39,087 INFO L399 BasicCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:21:39,087 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:21:39,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:21:39,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1287758105, now seen corresponding path program 2 times [2019-09-03 19:21:39,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:21:39,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:21:39,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:21:39,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:21:39,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:21:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:21:40,311 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:21:40,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:21:40,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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:21:40,322 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:21:40,346 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:21:40,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:21:40,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 19:21:40,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:21:40,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:21:40,427 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:40,427 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 29 [2019-09-03 19:21:40,428 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:40,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:40,442 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:21:40,442 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:49 [2019-09-03 19:21:40,610 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:40,611 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:21:40,612 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:40,612 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 44 [2019-09-03 19:21:40,613 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:40,641 INFO L567 ElimStorePlain]: treesize reduction 12, result has 76.9 percent of original size [2019-09-03 19:21:40,642 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:21:40,642 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:65, output treesize:37 [2019-09-03 19:21:40,700 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:40,701 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:40,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:40,704 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:40,705 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:21:40,707 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:40,707 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 48 [2019-09-03 19:21:40,708 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:40,732 INFO L567 ElimStorePlain]: treesize reduction 20, result has 71.8 percent of original size [2019-09-03 19:21:40,732 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:21:40,733 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:51 [2019-09-03 19:21:40,903 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:40,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:40,904 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:21:40,905 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:40,906 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:40,907 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:40,908 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:21:40,910 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:40,911 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 63 [2019-09-03 19:21:40,911 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:40,940 INFO L567 ElimStorePlain]: treesize reduction 41, result has 54.4 percent of original size [2019-09-03 19:21:40,940 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-03 19:21:40,941 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:78, output treesize:49 [2019-09-03 19:21:41,171 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:41,174 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:41,176 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:41,177 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:41,179 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:41,190 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:41,190 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 78 [2019-09-03 19:21:41,191 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:41,229 INFO L567 ElimStorePlain]: treesize reduction 17, result has 82.1 percent of original size [2019-09-03 19:21:41,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:21:41,231 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-09-03 19:21:41,232 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:68, output treesize:106 [2019-09-03 19:21:41,480 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:41,480 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2019-09-03 19:21:41,480 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:41,482 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:41,482 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-03 19:21:41,482 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2019-09-03 19:21:41,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:21:41,546 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:21:41,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:21:41,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 27] total 42 [2019-09-03 19:21:41,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-03 19:21:41,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-03 19:21:41,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1570, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 19:21:41,551 INFO L87 Difference]: Start difference. First operand 178 states and 211 transitions. Second operand 42 states. [2019-09-03 19:21:43,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:21:43,440 INFO L93 Difference]: Finished difference Result 204 states and 239 transitions. [2019-09-03 19:21:43,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-03 19:21:43,441 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-09-03 19:21:43,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:21:43,442 INFO L225 Difference]: With dead ends: 204 [2019-09-03 19:21:43,442 INFO L226 Difference]: Without dead ends: 187 [2019-09-03 19:21:43,444 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 19 SyntacticMatches, 7 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1173 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=334, Invalid=3326, Unknown=0, NotChecked=0, Total=3660 [2019-09-03 19:21:43,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-09-03 19:21:43,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 129. [2019-09-03 19:21:43,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-09-03 19:21:43,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 154 transitions. [2019-09-03 19:21:43,461 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 154 transitions. Word has length 42 [2019-09-03 19:21:43,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:21:43,461 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 154 transitions. [2019-09-03 19:21:43,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-03 19:21:43,462 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 154 transitions. [2019-09-03 19:21:43,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-03 19:21:43,465 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:21:43,465 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:21:43,465 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:21:43,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:21:43,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1454886126, now seen corresponding path program 4 times [2019-09-03 19:21:43,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:21:43,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:21:43,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:21:43,467 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:21:43,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:21:43,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:21:44,147 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:21:44,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:21:44,147 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:21:44,158 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:21:44,188 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:21:44,189 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:21:44,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 19:21:44,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:21:44,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:21:44,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:44,209 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-09-03 19:21:44,210 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:44,220 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:44,220 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-03 19:21:44,220 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2019-09-03 19:21:44,270 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:44,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:44,274 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:44,275 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:44,275 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-09-03 19:21:44,276 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:44,283 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:44,284 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-03 19:21:44,284 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:25 [2019-09-03 19:21:44,387 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:44,388 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:44,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:44,390 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:44,390 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 35 [2019-09-03 19:21:44,391 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:44,402 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:44,403 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-03 19:21:44,403 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:25 [2019-09-03 19:21:44,436 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 42 [2019-09-03 19:21:44,438 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:44,439 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:44,439 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:44,440 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:44,441 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:44,442 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:44,444 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:44,445 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:44,446 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:44,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:44,448 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:44,449 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:44,450 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:44,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:44,452 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 38 [2019-09-03 19:21:44,452 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:44,457 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:44,457 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:21:44,464 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:44,465 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:21:44,465 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:35 [2019-09-03 19:21:44,500 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:44,501 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:44,502 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:44,503 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:44,505 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:44,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:44,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:44,508 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:44,509 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:44,510 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:44,511 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:44,511 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 48 treesize of output 50 [2019-09-03 19:21:44,512 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:44,521 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:44,521 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:21:44,522 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:35 [2019-09-03 19:21:44,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:44,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:44,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:44,559 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:44,560 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:44,561 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:44,562 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:44,562 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 41 [2019-09-03 19:21:44,562 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:44,567 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:44,568 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-03 19:21:44,568 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:17 [2019-09-03 19:21:44,589 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:44,590 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-09-03 19:21:44,590 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:44,591 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:44,591 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-03 19:21:44,591 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-03 19:21:44,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:21:44,642 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:21:44,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:21:44,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 27 [2019-09-03 19:21:44,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 19:21:44,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 19:21:44,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=619, Unknown=0, NotChecked=0, Total=702 [2019-09-03 19:21:44,646 INFO L87 Difference]: Start difference. First operand 129 states and 154 transitions. Second operand 27 states. [2019-09-03 19:21:46,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:21:46,469 INFO L93 Difference]: Finished difference Result 271 states and 329 transitions. [2019-09-03 19:21:46,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-03 19:21:46,470 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 43 [2019-09-03 19:21:46,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:21:46,472 INFO L225 Difference]: With dead ends: 271 [2019-09-03 19:21:46,472 INFO L226 Difference]: Without dead ends: 269 [2019-09-03 19:21:46,473 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 30 SyntacticMatches, 10 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=236, Invalid=2116, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 19:21:46,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-09-03 19:21:46,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 156. [2019-09-03 19:21:46,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-09-03 19:21:46,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 190 transitions. [2019-09-03 19:21:46,499 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 190 transitions. Word has length 43 [2019-09-03 19:21:46,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:21:46,499 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 190 transitions. [2019-09-03 19:21:46,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 19:21:46,499 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 190 transitions. [2019-09-03 19:21:46,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-03 19:21:46,500 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:21:46,500 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:21:46,500 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:21:46,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:21:46,500 INFO L82 PathProgramCache]: Analyzing trace with hash 466732370, now seen corresponding path program 5 times [2019-09-03 19:21:46,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:21:46,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:21:46,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:21:46,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:21:46,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:21:46,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:21:47,082 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:21:47,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:21:47,083 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-03 19:21:47,092 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:21:47,132 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-03 19:21:47,132 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:21:47,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-03 19:21:47,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:21:47,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:21:47,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:21:47,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:47,401 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-09-03 19:21:47,401 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:47,412 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:47,412 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-03 19:21:47,413 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2019-09-03 19:21:47,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:47,535 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:47,536 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:47,537 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:47,538 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 40 [2019-09-03 19:21:47,538 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:47,552 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:47,552 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:21:47,553 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:31 [2019-09-03 19:21:47,596 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:47,596 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-09-03 19:21:47,596 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:47,598 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:47,598 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-03 19:21:47,598 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-03 19:21:47,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:21:47,649 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:21:47,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:21:47,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 32 [2019-09-03 19:21:47,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-03 19:21:47,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-03 19:21:47,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=888, Unknown=0, NotChecked=0, Total=992 [2019-09-03 19:21:47,654 INFO L87 Difference]: Start difference. First operand 156 states and 190 transitions. Second operand 32 states. [2019-09-03 19:21:49,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:21:49,464 INFO L93 Difference]: Finished difference Result 242 states and 295 transitions. [2019-09-03 19:21:49,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 19:21:49,464 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 43 [2019-09-03 19:21:49,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:21:49,466 INFO L225 Difference]: With dead ends: 242 [2019-09-03 19:21:49,466 INFO L226 Difference]: Without dead ends: 240 [2019-09-03 19:21:49,466 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 27 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=270, Invalid=2082, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 19:21:49,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-09-03 19:21:49,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 162. [2019-09-03 19:21:49,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-09-03 19:21:49,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 198 transitions. [2019-09-03 19:21:49,494 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 198 transitions. Word has length 43 [2019-09-03 19:21:49,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:21:49,494 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 198 transitions. [2019-09-03 19:21:49,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-03 19:21:49,494 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 198 transitions. [2019-09-03 19:21:49,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-03 19:21:49,495 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:21:49,495 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:21:49,495 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:21:49,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:21:49,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1876766658, now seen corresponding path program 7 times [2019-09-03 19:21:49,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:21:49,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:21:49,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:21:49,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:21:49,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:21:49,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:21:50,205 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 3 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:21:50,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:21:50,205 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:21:50,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:21:50,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:21:50,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-03 19:21:50,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:21:50,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:21:50,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:50,353 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 29 [2019-09-03 19:21:50,353 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:50,369 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:50,369 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:21:50,370 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:48 [2019-09-03 19:21:50,574 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:50,575 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:21:50,577 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:50,577 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 44 [2019-09-03 19:21:50,577 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:50,600 INFO L567 ElimStorePlain]: treesize reduction 12, result has 76.9 percent of original size [2019-09-03 19:21:50,601 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:21:50,601 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:37 [2019-09-03 19:21:50,668 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:50,670 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:50,671 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:50,672 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:50,673 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2019-09-03 19:21:50,673 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:50,681 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:50,681 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-03 19:21:50,682 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:27 [2019-09-03 19:21:50,760 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:50,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:50,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:50,763 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:50,764 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 33 [2019-09-03 19:21:50,764 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:50,774 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:50,775 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-03 19:21:50,775 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:22 [2019-09-03 19:21:50,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:50,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:50,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:50,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:50,848 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:50,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:50,850 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:50,850 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 40 [2019-09-03 19:21:50,850 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:50,860 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:50,860 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:21:50,860 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2019-09-03 19:21:50,907 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:50,908 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:50,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:50,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:50,911 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:50,913 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:50,914 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:50,914 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 43 [2019-09-03 19:21:50,915 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:50,922 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:50,922 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-03 19:21:50,923 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:19 [2019-09-03 19:21:50,942 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:50,943 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2019-09-03 19:21:50,943 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:50,944 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:50,944 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-03 19:21:50,944 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2019-09-03 19:21:50,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:21:51,000 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:21:51,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:21:51,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 35 [2019-09-03 19:21:51,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-03 19:21:51,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-03 19:21:51,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1050, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 19:21:51,004 INFO L87 Difference]: Start difference. First operand 162 states and 198 transitions. Second operand 35 states. [2019-09-03 19:21:54,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:21:54,237 INFO L93 Difference]: Finished difference Result 328 states and 403 transitions. [2019-09-03 19:21:54,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-03 19:21:54,237 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 43 [2019-09-03 19:21:54,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:21:54,239 INFO L225 Difference]: With dead ends: 328 [2019-09-03 19:21:54,240 INFO L226 Difference]: Without dead ends: 295 [2019-09-03 19:21:54,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1790 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=693, Invalid=5007, Unknown=0, NotChecked=0, Total=5700 [2019-09-03 19:21:54,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-09-03 19:21:54,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 171. [2019-09-03 19:21:54,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-09-03 19:21:54,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 210 transitions. [2019-09-03 19:21:54,278 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 210 transitions. Word has length 43 [2019-09-03 19:21:54,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:21:54,279 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 210 transitions. [2019-09-03 19:21:54,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-03 19:21:54,279 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 210 transitions. [2019-09-03 19:21:54,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-03 19:21:54,280 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:21:54,280 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:21:54,280 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:21:54,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:21:54,280 INFO L82 PathProgramCache]: Analyzing trace with hash -338388394, now seen corresponding path program 4 times [2019-09-03 19:21:54,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:21:54,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:21:54,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:21:54,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:21:54,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:21:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:21:54,505 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 2 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:21:54,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:21:54,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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:21:54,516 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:21:54,561 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:21:54,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:21:54,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-03 19:21:54,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:21:54,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:21:54,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:54,711 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2019-09-03 19:21:54,711 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:54,720 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:54,721 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:21:54,721 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:46 [2019-09-03 19:21:54,857 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:21:54,858 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:54,859 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:54,859 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 44 [2019-09-03 19:21:54,859 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:54,884 INFO L567 ElimStorePlain]: treesize reduction 11, result has 78.8 percent of original size [2019-09-03 19:21:54,885 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-03 19:21:54,885 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:65, output treesize:38 [2019-09-03 19:21:55,155 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:21:55,156 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:21:55,157 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:21:55,161 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:55,162 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 18 [2019-09-03 19:21:55,162 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:21:55,170 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:21:55,170 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:21:55,171 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:5 [2019-09-03 19:21:55,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:21:55,226 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:21:55,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:21:55,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20] total 33 [2019-09-03 19:21:55,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 19:21:55,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 19:21:55,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=958, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 19:21:55,232 INFO L87 Difference]: Start difference. First operand 171 states and 210 transitions. Second operand 33 states. [2019-09-03 19:21:58,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:21:58,568 INFO L93 Difference]: Finished difference Result 276 states and 331 transitions. [2019-09-03 19:21:58,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-03 19:21:58,568 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 45 [2019-09-03 19:21:58,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:21:58,570 INFO L225 Difference]: With dead ends: 276 [2019-09-03 19:21:58,570 INFO L226 Difference]: Without dead ends: 274 [2019-09-03 19:21:58,571 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1537 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=542, Invalid=5008, Unknown=0, NotChecked=0, Total=5550 [2019-09-03 19:21:58,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-09-03 19:21:58,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 174. [2019-09-03 19:21:58,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-09-03 19:21:58,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 214 transitions. [2019-09-03 19:21:58,610 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 214 transitions. Word has length 45 [2019-09-03 19:21:58,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:21:58,610 INFO L475 AbstractCegarLoop]: Abstraction has 174 states and 214 transitions. [2019-09-03 19:21:58,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 19:21:58,611 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 214 transitions. [2019-09-03 19:21:58,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-03 19:21:58,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:21:58,612 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:21:58,612 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:21:58,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:21:58,612 INFO L82 PathProgramCache]: Analyzing trace with hash -433551720, now seen corresponding path program 3 times [2019-09-03 19:21:58,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:21:58,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:21:58,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:21:58,613 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:21:58,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:21:58,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:21:59,639 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 28 [2019-09-03 19:22:00,100 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 2 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:22:00,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:22:00,100 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:22:00,117 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:22:00,151 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-03 19:22:00,151 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:22:00,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-03 19:22:00,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:22:00,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:00,276 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:00,277 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-09-03 19:22:00,277 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:00,288 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:00,288 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-03 19:22:00,288 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2019-09-03 19:22:00,311 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 46 [2019-09-03 19:22:00,318 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:00,319 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:00,320 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:00,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:00,324 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:00,325 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:00,327 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:00,328 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-09-03 19:22:00,328 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:00,334 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:00,334 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:22:00,346 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:00,346 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:22:00,346 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:66, output treesize:45 [2019-09-03 19:22:00,491 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:00,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:00,495 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:00,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:00,501 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:00,547 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:00,548 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 61 treesize of output 188 [2019-09-03 19:22:00,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:00,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:00,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:00,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:00,553 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:00,623 INFO L567 ElimStorePlain]: treesize reduction 344, result has 20.0 percent of original size [2019-09-03 19:22:00,623 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:22:00,623 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:85 [2019-09-03 19:22:00,835 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:00,836 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:00,837 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:22:00,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:00,840 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:00,840 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 52 [2019-09-03 19:22:00,841 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:00,872 INFO L567 ElimStorePlain]: treesize reduction 7, result has 87.7 percent of original size [2019-09-03 19:22:00,872 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:22:00,873 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:70, output treesize:38 [2019-09-03 19:22:01,007 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:01,008 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:01,008 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:01,009 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:01,009 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-09-03 19:22:01,010 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:01,019 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:01,020 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-03 19:22:01,020 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2019-09-03 19:22:01,199 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:01,199 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-09-03 19:22:01,199 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:01,200 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:01,200 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-03 19:22:01,201 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-03 19:22:01,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:01,263 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:22:01,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:22:01,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27] total 41 [2019-09-03 19:22:01,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-03 19:22:01,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-03 19:22:01,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1471, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 19:22:01,267 INFO L87 Difference]: Start difference. First operand 174 states and 214 transitions. Second operand 41 states. [2019-09-03 19:22:11,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:22:11,225 INFO L93 Difference]: Finished difference Result 255 states and 304 transitions. [2019-09-03 19:22:11,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-03 19:22:11,225 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 45 [2019-09-03 19:22:11,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:22:11,227 INFO L225 Difference]: With dead ends: 255 [2019-09-03 19:22:11,227 INFO L226 Difference]: Without dead ends: 253 [2019-09-03 19:22:11,227 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 23 SyntacticMatches, 7 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1386 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=419, Invalid=3741, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 19:22:11,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-09-03 19:22:11,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 180. [2019-09-03 19:22:11,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-03 19:22:11,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 221 transitions. [2019-09-03 19:22:11,253 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 221 transitions. Word has length 45 [2019-09-03 19:22:11,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:22:11,253 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 221 transitions. [2019-09-03 19:22:11,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-03 19:22:11,253 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 221 transitions. [2019-09-03 19:22:11,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-03 19:22:11,254 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:22:11,254 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:22:11,254 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:22:11,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:22:11,255 INFO L82 PathProgramCache]: Analyzing trace with hash -973028083, now seen corresponding path program 5 times [2019-09-03 19:22:11,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:22:11,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:22:11,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:11,256 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:22:11,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:11,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:22:11,503 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 19:22:11,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:22:11,503 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:22:11,526 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:22:11,571 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-09-03 19:22:11,571 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:22:11,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 19:22:11,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:22:11,645 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-03 19:22:11,646 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:11,651 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:11,651 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-03 19:22:11,652 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2019-09-03 19:22:11,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:11,766 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:11,766 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-09-03 19:22:11,767 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:11,773 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:11,774 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-03 19:22:11,774 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-09-03 19:22:12,073 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:12,073 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-09-03 19:22:12,074 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:12,076 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:12,076 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-03 19:22:12,076 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-03 19:22:12,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:12,120 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 19:22:12,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:22:12,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 32 [2019-09-03 19:22:12,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-03 19:22:12,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-03 19:22:12,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=895, Unknown=0, NotChecked=0, Total=992 [2019-09-03 19:22:12,124 INFO L87 Difference]: Start difference. First operand 180 states and 221 transitions. Second operand 32 states. [2019-09-03 19:22:22,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:22:22,553 INFO L93 Difference]: Finished difference Result 241 states and 288 transitions. [2019-09-03 19:22:22,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-03 19:22:22,553 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 47 [2019-09-03 19:22:22,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:22:22,555 INFO L225 Difference]: With dead ends: 241 [2019-09-03 19:22:22,555 INFO L226 Difference]: Without dead ends: 239 [2019-09-03 19:22:22,556 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=268, Invalid=1988, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 19:22:22,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-09-03 19:22:22,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 224. [2019-09-03 19:22:22,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-09-03 19:22:22,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 270 transitions. [2019-09-03 19:22:22,614 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 270 transitions. Word has length 47 [2019-09-03 19:22:22,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:22:22,615 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 270 transitions. [2019-09-03 19:22:22,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-03 19:22:22,615 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 270 transitions. [2019-09-03 19:22:22,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-03 19:22:22,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:22:22,616 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:22:22,616 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:22:22,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:22:22,616 INFO L82 PathProgramCache]: Analyzing trace with hash 3403008, now seen corresponding path program 6 times [2019-09-03 19:22:22,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:22:22,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:22:22,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:22,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:22:22,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:22,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:22:23,076 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:22:23,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:22:23,077 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:22:23,100 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:22:23,175 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-03 19:22:23,175 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:22:23,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 19:22:23,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:22:23,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:23,479 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:23,480 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-09-03 19:22:23,480 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:23,492 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:23,493 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:22:23,493 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2019-09-03 19:22:23,564 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:23,564 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-09-03 19:22:23,564 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:23,566 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:23,566 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-03 19:22:23,566 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-03 19:22:23,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:23,611 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 18 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:22:23,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:22:23,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 28 [2019-09-03 19:22:23,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 19:22:23,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 19:22:23,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2019-09-03 19:22:23,617 INFO L87 Difference]: Start difference. First operand 224 states and 270 transitions. Second operand 28 states. [2019-09-03 19:22:27,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:22:27,051 INFO L93 Difference]: Finished difference Result 524 states and 647 transitions. [2019-09-03 19:22:27,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-03 19:22:27,051 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 46 [2019-09-03 19:22:27,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:22:27,054 INFO L225 Difference]: With dead ends: 524 [2019-09-03 19:22:27,054 INFO L226 Difference]: Without dead ends: 522 [2019-09-03 19:22:27,056 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2878 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1007, Invalid=8695, Unknown=0, NotChecked=0, Total=9702 [2019-09-03 19:22:27,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2019-09-03 19:22:27,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 251. [2019-09-03 19:22:27,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-09-03 19:22:27,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 306 transitions. [2019-09-03 19:22:27,127 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 306 transitions. Word has length 46 [2019-09-03 19:22:27,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:22:27,127 INFO L475 AbstractCegarLoop]: Abstraction has 251 states and 306 transitions. [2019-09-03 19:22:27,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 19:22:27,127 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 306 transitions. [2019-09-03 19:22:27,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-03 19:22:27,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:22:27,128 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:22:27,128 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:22:27,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:22:27,129 INFO L82 PathProgramCache]: Analyzing trace with hash 840845576, now seen corresponding path program 8 times [2019-09-03 19:22:27,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:22:27,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:22:27,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:27,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:22:27,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:27,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:22:27,620 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 14 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:22:27,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:22:27,621 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:22:27,638 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:22:27,661 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:22:27,662 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:22:27,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 19:22:27,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:22:27,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:27,853 INFO L341 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2019-09-03 19:22:27,854 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 29 [2019-09-03 19:22:27,855 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:27,868 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:27,869 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:22:27,869 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:51 [2019-09-03 19:22:28,073 INFO L341 Elim1Store]: treesize reduction 17, result has 85.8 percent of original size [2019-09-03 19:22:28,073 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 123 [2019-09-03 19:22:28,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:28,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:28,075 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:28,115 INFO L567 ElimStorePlain]: treesize reduction 132, result has 23.7 percent of original size [2019-09-03 19:22:28,116 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-03 19:22:28,116 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:70, output treesize:38 [2019-09-03 19:22:28,268 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:28,269 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 142 [2019-09-03 19:22:28,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:28,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:28,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:28,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:28,271 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:28,317 INFO L567 ElimStorePlain]: treesize reduction 148, result has 25.3 percent of original size [2019-09-03 19:22:28,318 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-03 19:22:28,318 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:54, output treesize:35 [2019-09-03 19:22:28,459 INFO L341 Elim1Store]: treesize reduction 10, result has 88.2 percent of original size [2019-09-03 19:22:28,459 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 86 [2019-09-03 19:22:28,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:28,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:28,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:28,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:28,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:28,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:28,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:28,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:28,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:28,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:28,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:28,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:28,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:28,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:28,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:28,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:28,469 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-03 19:22:28,513 INFO L567 ElimStorePlain]: treesize reduction 172, result has 9.0 percent of original size [2019-09-03 19:22:28,514 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:22:28,514 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:51, output treesize:5 [2019-09-03 19:22:28,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:28,587 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 11 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (30)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:22:28,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:22:28,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 37 [2019-09-03 19:22:28,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 19:22:28,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 19:22:28,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1208, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 19:22:28,592 INFO L87 Difference]: Start difference. First operand 251 states and 306 transitions. Second operand 37 states. [2019-09-03 19:22:30,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:22:30,486 INFO L93 Difference]: Finished difference Result 395 states and 483 transitions. [2019-09-03 19:22:30,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 19:22:30,487 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 46 [2019-09-03 19:22:30,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:22:30,489 INFO L225 Difference]: With dead ends: 395 [2019-09-03 19:22:30,489 INFO L226 Difference]: Without dead ends: 320 [2019-09-03 19:22:30,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 795 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=407, Invalid=3015, Unknown=0, NotChecked=0, Total=3422 [2019-09-03 19:22:30,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-09-03 19:22:30,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 245. [2019-09-03 19:22:30,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-09-03 19:22:30,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 297 transitions. [2019-09-03 19:22:30,547 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 297 transitions. Word has length 46 [2019-09-03 19:22:30,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:22:30,548 INFO L475 AbstractCegarLoop]: Abstraction has 245 states and 297 transitions. [2019-09-03 19:22:30,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 19:22:30,548 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 297 transitions. [2019-09-03 19:22:30,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-03 19:22:30,549 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:22:30,549 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:22:30,549 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:22:30,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:22:30,549 INFO L82 PathProgramCache]: Analyzing trace with hash 694110839, now seen corresponding path program 5 times [2019-09-03 19:22:30,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:22:30,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:22:30,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:30,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:22:30,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:30,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:22:30,874 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 3 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:22:30,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:22:30,874 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:22:30,885 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:22:30,922 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-03 19:22:30,922 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:22:30,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-03 19:22:30,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:22:31,022 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-03 19:22:31,023 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:31,037 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:31,038 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-03 19:22:31,038 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2019-09-03 19:22:31,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:31,201 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:31,202 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-09-03 19:22:31,202 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:31,213 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:31,214 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-03 19:22:31,214 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2019-09-03 19:22:31,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:31,397 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:31,398 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:31,399 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:31,399 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2019-09-03 19:22:31,400 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:31,418 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:31,419 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:22:31,419 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:35 [2019-09-03 19:22:31,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:31,567 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:31,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:31,573 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:31,575 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:31,576 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:31,578 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:31,579 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 50 [2019-09-03 19:22:31,579 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:31,599 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:31,599 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-03 19:22:31,600 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:60 [2019-09-03 19:22:31,950 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:31,953 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:31,956 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:31,957 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:31,958 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:31,960 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:31,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:31,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:31,989 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:31,990 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 57 treesize of output 144 [2019-09-03 19:22:31,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:31,991 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:32,046 INFO L567 ElimStorePlain]: treesize reduction 52, result has 65.3 percent of original size [2019-09-03 19:22:32,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 19:22:32,049 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-03 19:22:32,049 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:84 [2019-09-03 19:22:34,140 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 43 DAG size of output: 21 [2019-09-03 19:22:34,436 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:22:34,436 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:34,437 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:22:34,441 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:34,441 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 16 [2019-09-03 19:22:34,442 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:34,446 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:34,446 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-03 19:22:34,447 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:3 [2019-09-03 19:22:34,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:34,511 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:22:34,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:22:34,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 26] total 42 [2019-09-03 19:22:34,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-03 19:22:34,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-03 19:22:34,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1552, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 19:22:34,515 INFO L87 Difference]: Start difference. First operand 245 states and 297 transitions. Second operand 42 states. [2019-09-03 19:22:59,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:22:59,248 INFO L93 Difference]: Finished difference Result 386 states and 459 transitions. [2019-09-03 19:22:59,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 19:22:59,248 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 48 [2019-09-03 19:22:59,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:22:59,250 INFO L225 Difference]: With dead ends: 386 [2019-09-03 19:22:59,250 INFO L226 Difference]: Without dead ends: 384 [2019-09-03 19:22:59,251 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1030 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=470, Invalid=3312, Unknown=0, NotChecked=0, Total=3782 [2019-09-03 19:22:59,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-09-03 19:22:59,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 281. [2019-09-03 19:22:59,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-09-03 19:22:59,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 341 transitions. [2019-09-03 19:22:59,333 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 341 transitions. Word has length 48 [2019-09-03 19:22:59,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:22:59,333 INFO L475 AbstractCegarLoop]: Abstraction has 281 states and 341 transitions. [2019-09-03 19:22:59,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-03 19:22:59,333 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 341 transitions. [2019-09-03 19:22:59,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-03 19:22:59,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:22:59,334 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:22:59,334 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:22:59,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:22:59,335 INFO L82 PathProgramCache]: Analyzing trace with hash -127926595, now seen corresponding path program 6 times [2019-09-03 19:22:59,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:22:59,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:22:59,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:59,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:22:59,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:22:59,606 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 2 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:22:59,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:22:59,606 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-03 19:22:59,617 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:22:59,659 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-09-03 19:22:59,659 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:22:59,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 19:22:59,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:22:59,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:59,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:59,840 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-09-03 19:22:59,840 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:59,847 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:59,848 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-03 19:22:59,848 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:28 [2019-09-03 19:22:59,935 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:59,936 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:59,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:22:59,938 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:59,939 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-09-03 19:22:59,939 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:59,948 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:59,949 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-03 19:22:59,949 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2019-09-03 19:23:00,158 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:23:00,159 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-09-03 19:23:00,159 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:23:00,160 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:23:00,160 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-03 19:23:00,160 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-03 19:23:00,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:23:00,213 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:23:00,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:23:00,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21] total 36 [2019-09-03 19:23:00,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-03 19:23:00,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-03 19:23:00,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1132, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 19:23:00,218 INFO L87 Difference]: Start difference. First operand 281 states and 341 transitions. Second operand 36 states. [2019-09-03 19:23:21,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:23:21,019 INFO L93 Difference]: Finished difference Result 375 states and 449 transitions. [2019-09-03 19:23:21,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-03 19:23:21,019 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 48 [2019-09-03 19:23:21,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:23:21,021 INFO L225 Difference]: With dead ends: 375 [2019-09-03 19:23:21,021 INFO L226 Difference]: Without dead ends: 373 [2019-09-03 19:23:21,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 786 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=444, Invalid=2862, Unknown=0, NotChecked=0, Total=3306 [2019-09-03 19:23:21,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-09-03 19:23:21,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 278. [2019-09-03 19:23:21,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-09-03 19:23:21,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 337 transitions. [2019-09-03 19:23:21,115 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 337 transitions. Word has length 48 [2019-09-03 19:23:21,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:23:21,116 INFO L475 AbstractCegarLoop]: Abstraction has 278 states and 337 transitions. [2019-09-03 19:23:21,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-03 19:23:21,116 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 337 transitions. [2019-09-03 19:23:21,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-03 19:23:21,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:23:21,117 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:23:21,118 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:23:21,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:23:21,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1592850292, now seen corresponding path program 4 times [2019-09-03 19:23:21,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:23:21,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:23:21,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:23:21,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:23:21,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:23:21,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:23:22,311 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 2 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:23:22,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:23: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 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:23:22,323 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:23:22,353 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:23:22,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:23:22,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 19:23:22,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:23:22,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:23:22,408 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:22,409 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2019-09-03 19:23:22,409 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:23:22,433 INFO L567 ElimStorePlain]: treesize reduction 7, result has 84.8 percent of original size [2019-09-03 19:23:22,433 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-03 19:23:22,434 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:36 [2019-09-03 19:23:22,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:22,582 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:22,583 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:22,584 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:23:22,585 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-09-03 19:23:22,585 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:23:22,596 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:23:22,597 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:23:22,597 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:25 [2019-09-03 19:23:22,662 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:22,663 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:23:22,697 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:23:22,698 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 40 treesize of output 137 [2019-09-03 19:23:22,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:23:22,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:23:22,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:23:22,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:23:22,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:23:22,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:23:22,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:23:22,702 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:23:22,766 INFO L567 ElimStorePlain]: treesize reduction 228, result has 20.6 percent of original size [2019-09-03 19:23:22,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:23:22,768 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-03 19:23:22,768 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:59 [2019-09-03 19:23:22,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:23:39,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:23:52,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:05,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:05,215 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:05,216 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:05,220 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:05,222 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:05,224 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:05,247 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:24:05,247 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 134 [2019-09-03 19:24:05,248 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:24:05,259 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:05,264 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:05,266 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:05,267 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:05,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:05,274 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:24:05,363 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:24:05,363 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 75 treesize of output 276 [2019-09-03 19:24:05,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:05,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:05,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:05,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:05,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:05,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:05,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:05,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:05,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:05,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:05,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:05,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:05,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:05,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:05,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:05,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:05,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:05,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:05,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:05,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:05,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:05,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:05,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:05,376 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:24:05,699 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 63 [2019-09-03 19:24:05,699 INFO L567 ElimStorePlain]: treesize reduction 1147, result has 17.4 percent of original size [2019-09-03 19:24:05,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:05,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:05,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:05,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:05,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:05,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:05,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:05,713 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-09-03 19:24:05,713 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:152, output treesize:240 [2019-09-03 19:24:05,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 19:24:05,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:05,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:05,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:05,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:05,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:05,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:05,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 19:24:05,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:05,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 19:24:05,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:25:05,127 WARN L188 SmtUtils]: Spent 59.09 s on a formula simplification. DAG size of input: 99 DAG size of output: 79 [2019-09-03 19:25:05,195 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:25:05,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:25:05,197 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:25:05,203 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:25:05,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:25:05,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:25:05,210 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:25:05,240 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:25:05,241 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 61 treesize of output 143 [2019-09-03 19:25:05,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:25:05,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:25:05,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:25:05,244 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:25:05,328 INFO L567 ElimStorePlain]: treesize reduction 202, result has 32.4 percent of original size [2019-09-03 19:25:05,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:25:05,329 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-03 19:25:05,329 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:88, output treesize:97 [2019-09-03 19:25:05,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:25:07,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:25:09,629 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-09-03 19:25:09,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:25:09,713 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:25:09,715 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:25:09,716 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:25:09,717 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:25:09,719 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:25:09,719 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 64 [2019-09-03 19:25:09,720 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:25:09,747 INFO L567 ElimStorePlain]: treesize reduction 21, result has 69.6 percent of original size [2019-09-03 19:25:09,748 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:25:09,748 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:70, output treesize:31 [2019-09-03 19:25:10,017 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:25:10,017 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-09-03 19:25:10,017 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:25:10,019 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:25:10,019 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-03 19:25:10,020 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-03 19:25:10,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:25:10,104 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 6 proven. 53 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:25:10,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:25:10,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26] total 41 [2019-09-03 19:25:10,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-03 19:25:10,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-03 19:25:10,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1475, Unknown=11, NotChecked=0, Total=1640 [2019-09-03 19:25:10,109 INFO L87 Difference]: Start difference. First operand 278 states and 337 transitions. Second operand 41 states. [2019-09-03 19:25:16,443 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 38 [2019-09-03 19:25:27,912 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 52 [2019-09-03 19:25:44,368 WARN L188 SmtUtils]: Spent 640.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 37 [2019-09-03 19:25:59,647 WARN L188 SmtUtils]: Spent 2.46 s on a formula simplification. DAG size of input: 119 DAG size of output: 35 [2019-09-03 19:26:11,107 WARN L188 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 117 DAG size of output: 28 [2019-09-03 19:26:28,281 WARN L188 SmtUtils]: Spent 635.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 38 [2019-09-03 19:26:43,544 WARN L188 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 33 [2019-09-03 19:26:51,607 WARN L188 SmtUtils]: Spent 3.08 s on a formula simplification. DAG size of input: 120 DAG size of output: 36 [2019-09-03 19:27:05,880 WARN L188 SmtUtils]: Spent 2.76 s on a formula simplification. DAG size of input: 114 DAG size of output: 54 [2019-09-03 19:27:11,889 WARN L188 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 118 DAG size of output: 44 [2019-09-03 19:27:37,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:27:37,594 INFO L93 Difference]: Finished difference Result 439 states and 532 transitions. [2019-09-03 19:27:37,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-03 19:27:37,594 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 48 [2019-09-03 19:27:37,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:27:37,596 INFO L225 Difference]: With dead ends: 439 [2019-09-03 19:27:37,596 INFO L226 Difference]: Without dead ends: 437 [2019-09-03 19:27:37,597 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 24 SyntacticMatches, 11 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2123 ImplicationChecksByTransitivity, 157.5s TimeCoverageRelationStatistics Valid=696, Invalid=6413, Unknown=31, NotChecked=0, Total=7140 [2019-09-03 19:27:37,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-09-03 19:27:37,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 318. [2019-09-03 19:27:37,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-09-03 19:27:37,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 391 transitions. [2019-09-03 19:27:37,700 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 391 transitions. Word has length 48 [2019-09-03 19:27:37,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:27:37,701 INFO L475 AbstractCegarLoop]: Abstraction has 318 states and 391 transitions. [2019-09-03 19:27:37,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-03 19:27:37,701 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 391 transitions. [2019-09-03 19:27:37,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-03 19:27:37,702 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:27:37,702 INFO L399 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:27:37,702 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:27:37,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:27:37,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1235076262, now seen corresponding path program 5 times [2019-09-03 19:27:37,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:27:37,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:27:37,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:27:37,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:27:37,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:27:37,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:27:39,318 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:27:39,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:27:39,318 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-03 19:27:39,328 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:27:39,371 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-09-03 19:27:39,371 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:27:39,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-03 19:27:39,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:27:39,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:27:39,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:27:39,486 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2019-09-03 19:27:39,486 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:27:39,498 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:27:39,499 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:27:39,499 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:46 [2019-09-03 19:27:39,680 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:27:39,682 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:27:39,684 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:27:39,684 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 44 [2019-09-03 19:27:39,685 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:27:39,713 INFO L567 ElimStorePlain]: treesize reduction 11, result has 78.8 percent of original size [2019-09-03 19:27:39,714 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-03 19:27:39,714 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:65, output treesize:38 [2019-09-03 19:27:39,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:27:39,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:27:39,905 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:27:39,906 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 49 treesize of output 172 [2019-09-03 19:27:39,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:27:39,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:27:39,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:27:39,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:27:39,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:27:39,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:27:39,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:27:39,910 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:27:40,038 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 39 [2019-09-03 19:27:40,038 INFO L567 ElimStorePlain]: treesize reduction 263, result has 25.9 percent of original size [2019-09-03 19:27:40,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:27:40,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:27:40,041 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-03 19:27:40,041 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:68, output treesize:91 [2019-09-03 19:27:40,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 19:27:40,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 19:27:40,328 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-09-03 19:27:40,406 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:27:40,407 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:27:40,409 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:27:40,410 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:27:40,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:27:40,414 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:27:40,418 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:27:40,451 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:27:40,452 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 70 treesize of output 164 [2019-09-03 19:27:40,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:27:40,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:27:40,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:27:40,455 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:27:40,531 INFO L567 ElimStorePlain]: treesize reduction 236, result has 31.2 percent of original size [2019-09-03 19:27:40,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:27:40,533 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-03 19:27:40,533 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:94, output treesize:107 [2019-09-03 19:27:40,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:27:40,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:27:40,834 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-03 19:27:40,936 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:27:40,941 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:27:40,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:27:40,949 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:27:40,952 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:27:40,953 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 59 [2019-09-03 19:27:40,953 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:27:40,981 INFO L567 ElimStorePlain]: treesize reduction 12, result has 80.3 percent of original size [2019-09-03 19:27:40,981 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-03 19:27:40,982 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:74, output treesize:32 [2019-09-03 19:27:41,230 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:27:41,234 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:27:41,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:27:41,240 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:27:41,241 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2019-09-03 19:27:41,242 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:27:41,268 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:27:41,269 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:27:41,269 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:29 [2019-09-03 19:27:41,831 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:27:41,831 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2019-09-03 19:27:41,832 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:27:41,834 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:27:41,835 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-03 19:27:41,835 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2019-09-03 19:27:41,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:27:41,974 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 11 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:27:41,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:27:41,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 49 [2019-09-03 19:27:41,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-03 19:27:41,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-03 19:27:41,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=2136, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 19:27:41,988 INFO L87 Difference]: Start difference. First operand 318 states and 391 transitions. Second operand 49 states. [2019-09-03 19:27:43,645 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 40 [2019-09-03 19:27:45,168 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-09-03 19:27:46,382 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-09-03 19:27:48,327 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 52 [2019-09-03 19:27:49,838 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 50 [2019-09-03 19:27:51,279 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 54 [2019-09-03 19:27:52,810 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 43 [2019-09-03 19:27:55,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:27:55,913 INFO L93 Difference]: Finished difference Result 700 states and 853 transitions. [2019-09-03 19:27:55,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-09-03 19:27:55,914 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 48 [2019-09-03 19:27:55,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:27:55,917 INFO L225 Difference]: With dead ends: 700 [2019-09-03 19:27:55,918 INFO L226 Difference]: Without dead ends: 667 [2019-09-03 19:27:55,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 25 SyntacticMatches, 5 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7435 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=1790, Invalid=19966, Unknown=0, NotChecked=0, Total=21756 [2019-09-03 19:27:55,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2019-09-03 19:27:56,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 451. [2019-09-03 19:27:56,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2019-09-03 19:27:56,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 564 transitions. [2019-09-03 19:27:56,040 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 564 transitions. Word has length 48 [2019-09-03 19:27:56,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:27:56,040 INFO L475 AbstractCegarLoop]: Abstraction has 451 states and 564 transitions. [2019-09-03 19:27:56,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-03 19:27:56,040 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 564 transitions. [2019-09-03 19:27:56,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-03 19:27:56,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:27:56,041 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:27:56,042 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:27:56,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:27:56,042 INFO L82 PathProgramCache]: Analyzing trace with hash -47803711, now seen corresponding path program 7 times [2019-09-03 19:27:56,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:27:56,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:27:56,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:27:56,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:27:56,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:27:56,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:27:56,335 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 19:27:56,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:27:56,335 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:27:56,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:27:56,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:27:56,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 19:27:56,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:27:56,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:27:56,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:27:56,499 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 30 [2019-09-03 19:27:56,500 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:27:56,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:27:56,514 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:27:56,514 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:42 [2019-09-03 19:27:56,552 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:27:56,554 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:27:56,554 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2019-09-03 19:27:56,555 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:27:56,562 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:27:56,562 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-03 19:27:56,562 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:21 [2019-09-03 19:27:56,871 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:27:56,872 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2019-09-03 19:27:56,872 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:27:56,874 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:27:56,874 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-03 19:27:56,875 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2019-09-03 19:27:56,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:27:56,956 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 19:27:56,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:27:56,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 33 [2019-09-03 19:27:56,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 19:27:56,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 19:27:56,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=961, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 19:27:56,961 INFO L87 Difference]: Start difference. First operand 451 states and 564 transitions. Second operand 33 states. [2019-09-03 19:27:58,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:27:58,291 INFO L93 Difference]: Finished difference Result 506 states and 624 transitions. [2019-09-03 19:27:58,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-03 19:27:58,291 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 50 [2019-09-03 19:27:58,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:27:58,294 INFO L225 Difference]: With dead ends: 506 [2019-09-03 19:27:58,294 INFO L226 Difference]: Without dead ends: 504 [2019-09-03 19:27:58,294 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=188, Invalid=1792, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 19:27:58,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-09-03 19:27:58,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 445. [2019-09-03 19:27:58,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2019-09-03 19:27:58,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 556 transitions. [2019-09-03 19:27:58,423 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 556 transitions. Word has length 50 [2019-09-03 19:27:58,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:27:58,423 INFO L475 AbstractCegarLoop]: Abstraction has 445 states and 556 transitions. [2019-09-03 19:27:58,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 19:27:58,424 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 556 transitions. [2019-09-03 19:27:58,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-03 19:27:58,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:27:58,425 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:27:58,426 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:27:58,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:27:58,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1844687163, now seen corresponding path program 7 times [2019-09-03 19:27:58,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:27:58,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:27:58,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:27:58,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:27:58,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:27:58,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:27:59,645 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 13 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:27:59,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:27:59,646 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:27:59,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:27:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:27:59,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-03 19:27:59,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:27:59,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:27:59,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:27:59,835 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2019-09-03 19:27:59,835 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:27:59,859 INFO L567 ElimStorePlain]: treesize reduction 7, result has 84.8 percent of original size [2019-09-03 19:27:59,860 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-03 19:27:59,860 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:36 [2019-09-03 19:27:59,955 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:27:59,956 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:27:59,957 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:27:59,961 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:27:59,962 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-09-03 19:27:59,962 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:27:59,980 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:27:59,980 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-03 19:27:59,980 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:26 [2019-09-03 19:28:00,064 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:00,065 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:00,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:00,072 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:00,072 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-09-03 19:28:00,073 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:00,083 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:00,083 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-03 19:28:00,084 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:26 [2019-09-03 19:28:00,169 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:00,171 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:00,172 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:00,173 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:00,174 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-09-03 19:28:00,174 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:00,191 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:00,192 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-03 19:28:00,192 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:26 [2019-09-03 19:28:00,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:00,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:00,274 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:00,275 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:00,276 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:00,278 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:00,279 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:00,279 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 47 [2019-09-03 19:28:00,280 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:00,289 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:00,289 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:28:00,289 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2019-09-03 19:28:00,337 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:00,338 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:00,339 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:00,341 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:00,342 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:00,344 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:00,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:00,346 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:00,347 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:00,349 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:00,350 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:00,350 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 63 treesize of output 62 [2019-09-03 19:28:00,351 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:00,362 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:00,362 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:28:00,363 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:47 [2019-09-03 19:28:00,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:00,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:00,414 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:00,416 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:00,417 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:00,418 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:00,418 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:00,419 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 50 [2019-09-03 19:28:00,419 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:00,431 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:00,432 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:28:00,432 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:63, output treesize:26 [2019-09-03 19:28:00,477 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:00,477 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-09-03 19:28:00,478 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:00,479 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:00,479 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-03 19:28:00,479 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-03 19:28:00,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:00,553 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:28:00,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:28:00,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 38 [2019-09-03 19:28:00,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-03 19:28:00,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-03 19:28:00,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1237, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 19:28:00,558 INFO L87 Difference]: Start difference. First operand 445 states and 556 transitions. Second operand 38 states. [2019-09-03 19:28:04,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:28:04,516 INFO L93 Difference]: Finished difference Result 812 states and 1020 transitions. [2019-09-03 19:28:04,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-03 19:28:04,517 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 49 [2019-09-03 19:28:04,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:28:04,521 INFO L225 Difference]: With dead ends: 812 [2019-09-03 19:28:04,521 INFO L226 Difference]: Without dead ends: 810 [2019-09-03 19:28:04,522 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 32 SyntacticMatches, 6 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1631 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=676, Invalid=4726, Unknown=0, NotChecked=0, Total=5402 [2019-09-03 19:28:04,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2019-09-03 19:28:04,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 562. [2019-09-03 19:28:04,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-09-03 19:28:04,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 715 transitions. [2019-09-03 19:28:04,694 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 715 transitions. Word has length 49 [2019-09-03 19:28:04,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:28:04,694 INFO L475 AbstractCegarLoop]: Abstraction has 562 states and 715 transitions. [2019-09-03 19:28:04,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-03 19:28:04,694 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 715 transitions. [2019-09-03 19:28:04,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-03 19:28:04,696 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:28:04,696 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:28:04,696 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:28:04,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:28:04,697 INFO L82 PathProgramCache]: Analyzing trace with hash -617569836, now seen corresponding path program 9 times [2019-09-03 19:28:04,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:28:04,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:28:04,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:04,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:28:04,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:04,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:28:05,503 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 4 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:28:05,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:28:05,503 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:28:05,516 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:28:05,587 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-03 19:28:05,587 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:28:05,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 19:28:05,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:28:05,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:05,738 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-09-03 19:28:05,738 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 30 [2019-09-03 19:28:05,739 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:05,747 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:05,747 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:28:05,747 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:44 [2019-09-03 19:28:05,897 INFO L341 Elim1Store]: treesize reduction 60, result has 16.7 percent of original size [2019-09-03 19:28:05,898 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 33 [2019-09-03 19:28:05,898 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:05,911 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:05,911 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:28:05,912 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:63, output treesize:35 [2019-09-03 19:28:06,095 INFO L341 Elim1Store]: treesize reduction 18, result has 85.6 percent of original size [2019-09-03 19:28:06,096 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 124 [2019-09-03 19:28:06,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:06,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:06,097 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:06,138 INFO L567 ElimStorePlain]: treesize reduction 81, result has 39.1 percent of original size [2019-09-03 19:28:06,139 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:28:06,139 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:35 [2019-09-03 19:28:06,340 INFO L341 Elim1Store]: treesize reduction 74, result has 58.4 percent of original size [2019-09-03 19:28:06,340 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 118 [2019-09-03 19:28:06,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:06,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:06,342 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:06,372 INFO L567 ElimStorePlain]: treesize reduction 81, result has 38.2 percent of original size [2019-09-03 19:28:06,373 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:28:06,373 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:50 [2019-09-03 19:28:06,555 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 43 [2019-09-03 19:28:06,555 INFO L341 Elim1Store]: treesize reduction 166, result has 46.3 percent of original size [2019-09-03 19:28:06,556 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 58 treesize of output 160 [2019-09-03 19:28:06,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:06,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:06,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:06,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:06,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:06,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:06,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:06,560 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:06,615 INFO L567 ElimStorePlain]: treesize reduction 249, result has 16.7 percent of original size [2019-09-03 19:28:06,616 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:28:06,616 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:69, output treesize:50 [2019-09-03 19:28:06,859 INFO L341 Elim1Store]: treesize reduction 86, result has 60.9 percent of original size [2019-09-03 19:28:06,859 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 52 treesize of output 151 [2019-09-03 19:28:06,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:06,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:06,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:06,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:06,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:06,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:06,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:06,863 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:06,921 INFO L567 ElimStorePlain]: treesize reduction 237, result has 14.7 percent of original size [2019-09-03 19:28:06,921 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:28:06,922 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:32 [2019-09-03 19:28:07,072 INFO L341 Elim1Store]: treesize reduction 28, result has 67.1 percent of original size [2019-09-03 19:28:07,072 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 68 [2019-09-03 19:28:07,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:07,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:07,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:07,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:07,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:07,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:07,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:07,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:07,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:07,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:07,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:07,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:07,079 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-03 19:28:07,109 INFO L567 ElimStorePlain]: treesize reduction 123, result has 10.2 percent of original size [2019-09-03 19:28:07,110 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:28:07,110 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:5 [2019-09-03 19:28:07,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:07,180 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 7 proven. 98 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 19:28:07,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:28:07,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 41 [2019-09-03 19:28:07,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-03 19:28:07,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-03 19:28:07,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1503, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 19:28:07,185 INFO L87 Difference]: Start difference. First operand 562 states and 715 transitions. Second operand 41 states. [2019-09-03 19:28:10,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:28:10,937 INFO L93 Difference]: Finished difference Result 822 states and 1031 transitions. [2019-09-03 19:28:10,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-03 19:28:10,937 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 49 [2019-09-03 19:28:10,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:28:10,941 INFO L225 Difference]: With dead ends: 822 [2019-09-03 19:28:10,941 INFO L226 Difference]: Without dead ends: 728 [2019-09-03 19:28:10,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1536 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=498, Invalid=5508, Unknown=0, NotChecked=0, Total=6006 [2019-09-03 19:28:10,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-09-03 19:28:11,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 539. [2019-09-03 19:28:11,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2019-09-03 19:28:11,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 689 transitions. [2019-09-03 19:28:11,129 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 689 transitions. Word has length 49 [2019-09-03 19:28:11,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:28:11,129 INFO L475 AbstractCegarLoop]: Abstraction has 539 states and 689 transitions. [2019-09-03 19:28:11,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-03 19:28:11,129 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 689 transitions. [2019-09-03 19:28:11,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-03 19:28:11,131 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:28:11,131 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:28:11,131 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:28:11,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:28:11,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1275030199, now seen corresponding path program 8 times [2019-09-03 19:28:11,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:28:11,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:28:11,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:11,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:28:11,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:11,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:28:11,505 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 2 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:28:11,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:28:11,506 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:28:11,529 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:28:11,558 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:28:11,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:28:11,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-03 19:28:11,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:28:11,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:11,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:11,826 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-09-03 19:28:11,826 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:11,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:11,837 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-03 19:28:11,837 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-09-03 19:28:12,190 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:12,190 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-09-03 19:28:12,190 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:12,192 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:12,193 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-03 19:28:12,193 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-03 19:28:12,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:12,260 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:28:12,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:28:12,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 34 [2019-09-03 19:28:12,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-03 19:28:12,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-03 19:28:12,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1023, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 19:28:12,271 INFO L87 Difference]: Start difference. First operand 539 states and 689 transitions. Second operand 34 states. [2019-09-03 19:28:48,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:28:48,213 INFO L93 Difference]: Finished difference Result 858 states and 1074 transitions. [2019-09-03 19:28:48,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-03 19:28:48,214 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 51 [2019-09-03 19:28:48,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:28:48,218 INFO L225 Difference]: With dead ends: 858 [2019-09-03 19:28:48,218 INFO L226 Difference]: Without dead ends: 856 [2019-09-03 19:28:48,219 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2443 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=817, Invalid=7193, Unknown=0, NotChecked=0, Total=8010 [2019-09-03 19:28:48,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2019-09-03 19:28:48,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 622. [2019-09-03 19:28:48,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2019-09-03 19:28:48,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 785 transitions. [2019-09-03 19:28:48,395 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 785 transitions. Word has length 51 [2019-09-03 19:28:48,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:28:48,395 INFO L475 AbstractCegarLoop]: Abstraction has 622 states and 785 transitions. [2019-09-03 19:28:48,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-03 19:28:48,395 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 785 transitions. [2019-09-03 19:28:48,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-03 19:28:48,397 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:28:48,397 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:28:48,397 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:28:48,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:28:48,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1510742135, now seen corresponding path program 9 times [2019-09-03 19:28:48,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:28:48,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:28:48,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:48,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:28:48,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:48,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:28:48,831 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 2 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:28:48,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:28:48,831 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-03 19:28:48,841 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:28:48,903 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-03 19:28:48,904 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:28:48,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 19:28:48,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:28:49,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:49,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:49,077 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 30 [2019-09-03 19:28:49,077 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:49,089 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:49,090 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:28:49,090 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2019-09-03 19:28:49,236 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:28:49,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:49,238 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:49,238 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 45 [2019-09-03 19:28:49,238 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:49,267 INFO L567 ElimStorePlain]: treesize reduction 12, result has 77.4 percent of original size [2019-09-03 19:28:49,268 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:28:49,268 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:66, output treesize:38 [2019-09-03 19:28:49,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:49,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:49,416 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:49,417 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:49,417 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2019-09-03 19:28:49,418 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:49,432 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:49,433 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:28:49,433 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:30 [2019-09-03 19:28:49,819 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:49,820 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:28:49,823 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:49,823 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 15 [2019-09-03 19:28:49,824 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:49,829 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:49,830 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-03 19:28:49,830 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:5 [2019-09-03 19:28:49,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:49,900 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:28:49,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:28:49,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 41 [2019-09-03 19:28:49,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-03 19:28:49,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-03 19:28:49,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1493, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 19:28:49,905 INFO L87 Difference]: Start difference. First operand 622 states and 785 transitions. Second operand 41 states. [2019-09-03 19:28:52,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:28:52,357 INFO L93 Difference]: Finished difference Result 802 states and 996 transitions. [2019-09-03 19:28:52,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 19:28:52,358 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 51 [2019-09-03 19:28:52,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:28:52,361 INFO L225 Difference]: With dead ends: 802 [2019-09-03 19:28:52,361 INFO L226 Difference]: Without dead ends: 800 [2019-09-03 19:28:52,361 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 939 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=394, Invalid=3266, Unknown=0, NotChecked=0, Total=3660 [2019-09-03 19:28:52,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2019-09-03 19:28:52,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 634. [2019-09-03 19:28:52,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2019-09-03 19:28:52,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 801 transitions. [2019-09-03 19:28:52,527 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 801 transitions. Word has length 51 [2019-09-03 19:28:52,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:28:52,527 INFO L475 AbstractCegarLoop]: Abstraction has 634 states and 801 transitions. [2019-09-03 19:28:52,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-03 19:28:52,527 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 801 transitions. [2019-09-03 19:28:52,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-03 19:28:52,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:28:52,529 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:28:52,529 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:28:52,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:28:52,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1469181373, now seen corresponding path program 10 times [2019-09-03 19:28:52,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:28:52,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:28:52,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:52,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:28:52,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:52,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:28:53,102 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 3 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:28:53,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:28:53,103 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-03 19:28:53,114 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:28:53,148 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:28:53,148 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:28:53,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-03 19:28:53,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:28:53,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:53,270 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:53,270 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 30 [2019-09-03 19:28:53,271 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:53,284 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:53,284 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:28:53,285 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2019-09-03 19:28:53,327 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:53,329 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:53,329 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 32 [2019-09-03 19:28:53,329 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:53,338 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:53,338 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-03 19:28:53,339 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:56, output treesize:29 [2019-09-03 19:28:53,443 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:53,445 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:53,446 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:53,447 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:53,447 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 35 [2019-09-03 19:28:53,448 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:53,456 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:53,456 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-03 19:28:53,456 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:24 [2019-09-03 19:28:53,525 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:53,526 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:53,527 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:53,528 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:53,529 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:53,529 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:53,530 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:53,530 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 42 [2019-09-03 19:28:53,531 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:53,539 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:53,540 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:28:53,540 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:39 [2019-09-03 19:28:53,603 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:53,605 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:53,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:53,612 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:53,613 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:53,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:53,616 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:53,616 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 45 [2019-09-03 19:28:53,617 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:53,624 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:53,625 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-03 19:28:53,625 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:21 [2019-09-03 19:28:53,960 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:53,960 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2019-09-03 19:28:53,961 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:53,963 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:53,963 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-03 19:28:53,964 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2019-09-03 19:28:53,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:54,095 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:28:54,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:28:54,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 41 [2019-09-03 19:28:54,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-03 19:28:54,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-03 19:28:54,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1478, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 19:28:54,109 INFO L87 Difference]: Start difference. First operand 634 states and 801 transitions. Second operand 41 states. [2019-09-03 19:28:56,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:28:56,437 INFO L93 Difference]: Finished difference Result 797 states and 986 transitions. [2019-09-03 19:28:56,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-03 19:28:56,438 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 51 [2019-09-03 19:28:56,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:28:56,441 INFO L225 Difference]: With dead ends: 797 [2019-09-03 19:28:56,441 INFO L226 Difference]: Without dead ends: 795 [2019-09-03 19:28:56,442 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1391 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=490, Invalid=4066, Unknown=0, NotChecked=0, Total=4556 [2019-09-03 19:28:56,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2019-09-03 19:28:56,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 657. [2019-09-03 19:28:56,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-09-03 19:28:56,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 825 transitions. [2019-09-03 19:28:56,745 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 825 transitions. Word has length 51 [2019-09-03 19:28:56,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:28:56,745 INFO L475 AbstractCegarLoop]: Abstraction has 657 states and 825 transitions. [2019-09-03 19:28:56,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-03 19:28:56,745 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 825 transitions. [2019-09-03 19:28:56,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-03 19:28:56,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:28:56,748 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:28:56,749 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:28:56,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:28:56,749 INFO L82 PathProgramCache]: Analyzing trace with hash -817779758, now seen corresponding path program 6 times [2019-09-03 19:28:56,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:28:56,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:28:56,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:56,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:28:56,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:56,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:28:57,746 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 13 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:28:57,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:28:57,747 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-03 19:28:57,759 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:28:57,814 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-03 19:28:57,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:28:57,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-03 19:28:57,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:28:57,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:57,915 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:57,915 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-09-03 19:28:57,915 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:57,925 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:57,925 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-03 19:28:57,926 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2019-09-03 19:28:58,097 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:58,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:58,100 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:58,101 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:58,102 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:58,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:58,104 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:58,104 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2019-09-03 19:28:58,105 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:58,115 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:58,115 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:28:58,115 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:44 [2019-09-03 19:28:58,171 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:58,173 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:58,174 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:58,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:58,177 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:58,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:58,179 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:28:58,180 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:58,182 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:58,183 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 61 [2019-09-03 19:28:58,184 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:58,205 INFO L567 ElimStorePlain]: treesize reduction 20, result has 67.2 percent of original size [2019-09-03 19:28:58,205 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:28:58,206 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:41 [2019-09-03 19:28:58,458 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:58,460 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:58,464 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:58,465 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:58,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:58,508 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:58,509 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 57 treesize of output 178 [2019-09-03 19:28:58,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:58,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:58,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:58,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:58,512 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:58,609 INFO L567 ElimStorePlain]: treesize reduction 322, result has 20.3 percent of original size [2019-09-03 19:28:58,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:58,610 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:28:58,611 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:71, output treesize:81 [2019-09-03 19:28:58,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:58,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:58,901 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:58,903 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:58,918 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:28:58,919 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:58,919 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 35 [2019-09-03 19:28:58,920 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:58,929 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:58,930 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:28:58,930 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:28 [2019-09-03 19:28:59,160 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:59,161 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-09-03 19:28:59,161 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:28:59,162 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:28:59,162 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-03 19:28:59,163 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-03 19:28:59,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:28:59,237 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:28:59,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:28:59,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 28] total 45 [2019-09-03 19:28:59,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-03 19:28:59,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-03 19:28:59,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1786, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 19:28:59,242 INFO L87 Difference]: Start difference. First operand 657 states and 825 transitions. Second operand 45 states. [2019-09-03 19:29:26,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:29:26,016 INFO L93 Difference]: Finished difference Result 846 states and 1043 transitions. [2019-09-03 19:29:26,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-03 19:29:26,017 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 51 [2019-09-03 19:29:26,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:29:26,020 INFO L225 Difference]: With dead ends: 846 [2019-09-03 19:29:26,020 INFO L226 Difference]: Without dead ends: 844 [2019-09-03 19:29:26,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 27 SyntacticMatches, 5 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3132 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=914, Invalid=8592, Unknown=0, NotChecked=0, Total=9506 [2019-09-03 19:29:26,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2019-09-03 19:29:26,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 684. [2019-09-03 19:29:26,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 684 states. [2019-09-03 19:29:26,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 860 transitions. [2019-09-03 19:29:26,219 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 860 transitions. Word has length 51 [2019-09-03 19:29:26,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:29:26,219 INFO L475 AbstractCegarLoop]: Abstraction has 684 states and 860 transitions. [2019-09-03 19:29:26,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-03 19:29:26,219 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 860 transitions. [2019-09-03 19:29:26,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-03 19:29:26,222 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:29:26,222 INFO L399 BasicCegarLoop]: trace histogram [7, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:29:26,223 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:29:26,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:29:26,223 INFO L82 PathProgramCache]: Analyzing trace with hash 207684746, now seen corresponding path program 7 times [2019-09-03 19:29:26,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:29:26,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:29:26,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:29:26,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:29:26,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:29:26,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:29:27,433 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 2 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:29:27,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:29:27,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 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-03 19:29:27,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:29:27,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:29:27,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-03 19:29:27,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:29:27,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:27,575 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:29:27,576 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 29 [2019-09-03 19:29:27,576 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:29:27,589 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:29:27,590 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:29:27,590 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:50 [2019-09-03 19:29:27,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:29:27,742 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:29:27,744 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:29:27,744 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 44 [2019-09-03 19:29:27,744 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:29:27,772 INFO L567 ElimStorePlain]: treesize reduction 12, result has 78.6 percent of original size [2019-09-03 19:29:27,773 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:29:27,773 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:69, output treesize:41 [2019-09-03 19:29:27,846 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2019-09-03 19:29:27,848 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:29:27,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:29:27,850 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:29:27,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:29:27,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:29:27,856 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:29:27,857 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:29:27,858 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:29:27,859 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 36 [2019-09-03 19:29:27,859 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:29:27,866 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:29:27,866 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:29:27,876 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:29:27,877 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-03 19:29:27,877 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:27 [2019-09-03 19:29:27,902 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 44 [2019-09-03 19:29:27,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:29:27,905 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:29:27,906 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:29:27,907 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:29:27,908 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:29:27,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:29:27,911 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:29:27,912 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:29:27,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:29:27,915 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:29:27,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:29:27,917 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:29:27,918 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:29:27,919 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:29:27,920 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-09-03 19:29:27,921 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:29:27,928 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:29:27,928 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:29:27,936 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:29:27,936 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:29:27,937 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:63, output treesize:37 [2019-09-03 19:29:27,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:29:27,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:29:27,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:29:27,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:29:27,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:29:27,983 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:29:27,984 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:29:27,984 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 43 [2019-09-03 19:29:27,985 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:29:27,994 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:29:27,995 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:29:27,995 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:37 [2019-09-03 19:29:28,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:29:28,142 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:29:28,143 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:29:28,144 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:29:28,146 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:29:28,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:29:28,148 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:29:28,150 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:29:28,150 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 61 [2019-09-03 19:29:28,151 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:29:28,175 INFO L567 ElimStorePlain]: treesize reduction 34, result has 61.8 percent of original size [2019-09-03 19:29:28,176 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:29:28,176 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:69, output treesize:55 [2019-09-03 19:29:28,299 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:29:28,301 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:29:28,302 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:29:28,302 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:29:28,303 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 42 [2019-09-03 19:29:28,303 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:29:28,315 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:29:28,316 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:29:28,316 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:71, output treesize:34 [2019-09-03 19:29:28,587 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:29:28,588 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2019-09-03 19:29:28,588 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:29:28,594 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:29:28,594 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-03 19:29:28,594 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2019-09-03 19:29:28,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:28,668 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:29:28,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:29:28,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 29] total 40 [2019-09-03 19:29:28,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-03 19:29:28,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-03 19:29:28,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1422, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 19:29:28,673 INFO L87 Difference]: Start difference. First operand 684 states and 860 transitions. Second operand 40 states. [2019-09-03 19:29:31,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:29:31,747 INFO L93 Difference]: Finished difference Result 781 states and 970 transitions. [2019-09-03 19:29:31,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-03 19:29:31,747 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 51 [2019-09-03 19:29:31,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:29:31,750 INFO L225 Difference]: With dead ends: 781 [2019-09-03 19:29:31,751 INFO L226 Difference]: Without dead ends: 779 [2019-09-03 19:29:31,751 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 22 SyntacticMatches, 18 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1352 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=321, Invalid=3711, Unknown=0, NotChecked=0, Total=4032 [2019-09-03 19:29:31,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2019-09-03 19:29:31,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 684. [2019-09-03 19:29:31,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 684 states. [2019-09-03 19:29:31,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 860 transitions. [2019-09-03 19:29:31,958 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 860 transitions. Word has length 51 [2019-09-03 19:29:31,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:29:31,958 INFO L475 AbstractCegarLoop]: Abstraction has 684 states and 860 transitions. [2019-09-03 19:29:31,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-03 19:29:31,958 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 860 transitions. [2019-09-03 19:29:31,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-03 19:29:31,959 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:29:31,960 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:29:31,960 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:29:31,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:29:31,960 INFO L82 PathProgramCache]: Analyzing trace with hash 857329472, now seen corresponding path program 6 times [2019-09-03 19:29:31,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:29:31,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:29:31,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:29:31,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:29:31,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:29:31,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:29:32,302 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 4 proven. 48 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 19:29:32,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:29:32,302 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:29:32,313 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:29:32,354 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-09-03 19:29:32,355 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:29:32,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-03 19:29:32,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:29:32,433 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-03 19:29:32,434 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:29:32,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:29:32,441 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-03 19:29:32,442 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2019-09-03 19:29:32,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:32,572 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:29:32,573 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-09-03 19:29:32,573 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:29:32,583 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:29:32,584 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-03 19:29:32,584 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2019-09-03 19:29:32,681 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:29:32,682 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:29:32,683 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:29:32,684 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:29:32,684 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2019-09-03 19:29:32,684 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:29:32,693 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:29:32,693 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-03 19:29:32,693 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2019-09-03 19:29:33,013 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:29:33,013 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-09-03 19:29:33,013 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:29:33,015 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:29:33,015 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-03 19:29:33,015 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-03 19:29:33,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:33,070 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 3 proven. 52 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 19:29:33,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:29:33,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22] total 38 [2019-09-03 19:29:33,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-03 19:29:33,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-03 19:29:33,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1271, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 19:29:33,075 INFO L87 Difference]: Start difference. First operand 684 states and 860 transitions. Second operand 38 states. [2019-09-03 19:29:59,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:29:59,457 INFO L93 Difference]: Finished difference Result 864 states and 1065 transitions. [2019-09-03 19:29:59,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-03 19:29:59,457 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 53 [2019-09-03 19:29:59,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:29:59,461 INFO L225 Difference]: With dead ends: 864 [2019-09-03 19:29:59,461 INFO L226 Difference]: Without dead ends: 862 [2019-09-03 19:29:59,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1518 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=523, Invalid=4307, Unknown=0, NotChecked=0, Total=4830 [2019-09-03 19:29:59,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2019-09-03 19:29:59,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 706. [2019-09-03 19:29:59,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-03 19:29:59,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 887 transitions. [2019-09-03 19:29:59,668 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 887 transitions. Word has length 53 [2019-09-03 19:29:59,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:29:59,669 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 887 transitions. [2019-09-03 19:29:59,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-03 19:29:59,669 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 887 transitions. [2019-09-03 19:29:59,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-03 19:29:59,670 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:29:59,671 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:29:59,671 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:29:59,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:29:59,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1788643187, now seen corresponding path program 11 times [2019-09-03 19:29:59,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:29:59,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:29:59,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:29:59,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:29:59,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:29:59,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:30:00,261 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 4 proven. 50 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 19:30:00,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:30:00,261 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-03 19:30:00,284 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:30:00,356 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-03 19:30:00,356 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:30:00,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-03 19:30:00,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:30:00,541 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-03 19:30:00,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:30:00,548 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:30:00,548 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-03 19:30:00,548 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2019-09-03 19:30:00,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:30:00,576 INFO L341 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2019-09-03 19:30:00,576 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2019-09-03 19:30:00,577 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:30:00,585 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:30:00,586 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-03 19:30:00,586 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2019-09-03 19:30:00,700 INFO L341 Elim1Store]: treesize reduction 83, result has 53.4 percent of original size [2019-09-03 19:30:00,701 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 110 [2019-09-03 19:30:00,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:30:00,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:30:00,702 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:30:00,726 INFO L567 ElimStorePlain]: treesize reduction 81, result has 33.1 percent of original size [2019-09-03 19:30:00,727 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:30:00,727 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2019-09-03 19:30:00,891 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 42 [2019-09-03 19:30:00,891 INFO L341 Elim1Store]: treesize reduction 208, result has 39.7 percent of original size [2019-09-03 19:30:00,891 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 62 treesize of output 155 [2019-09-03 19:30:00,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:30:00,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:30:00,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:30:00,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:30:00,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:30:00,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:30:00,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:30:00,895 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:30:00,929 INFO L567 ElimStorePlain]: treesize reduction 254, result has 14.5 percent of original size [2019-09-03 19:30:00,930 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:30:00,930 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:65, output treesize:43 [2019-09-03 19:30:00,992 INFO L341 Elim1Store]: treesize reduction 88, result has 17.8 percent of original size [2019-09-03 19:30:00,992 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 44 treesize of output 34 [2019-09-03 19:30:00,993 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:30:00,997 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:30:00,997 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-03 19:30:00,997 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:15 [2019-09-03 19:30:03,018 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#v~0.offset_BEFORE_CALL_25| Int) (|v_main_~#v~0.base_BEFORE_CALL_25| Int)) (let ((.cse0 (select |c_#memory_int| |v_main_~#v~0.base_BEFORE_CALL_25|))) (<= (select .cse0 (+ |v_main_~#v~0.offset_BEFORE_CALL_25| 8)) (select .cse0 (+ |v_main_~#v~0.offset_BEFORE_CALL_25| 12))))) is different from true [2019-09-03 19:30:05,061 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 16 [2019-09-03 19:30:09,101 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 17 [2019-09-03 19:30:11,158 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#v~0.offset_BEFORE_CALL_26| Int) (|v_main_~#v~0.base_BEFORE_CALL_26| Int)) (let ((.cse0 (select |c_#memory_int| |v_main_~#v~0.base_BEFORE_CALL_26|))) (<= (select .cse0 (+ |v_main_~#v~0.offset_BEFORE_CALL_26| 8)) (select .cse0 (+ |v_main_~#v~0.offset_BEFORE_CALL_26| 12))))) is different from true [2019-09-03 19:30:11,239 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-09-03 19:30:11,240 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 34 treesize of output 10 [2019-09-03 19:30:11,240 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:30:11,242 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:30:11,242 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-03 19:30:11,242 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:3 [2019-09-03 19:30:11,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:30:13,308 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2019-09-03 19:30:13,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:30:13,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 27] total 35 [2019-09-03 19:30:13,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-03 19:30:13,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-03 19:30:13,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=966, Unknown=4, NotChecked=126, Total=1190 [2019-09-03 19:30:13,313 INFO L87 Difference]: Start difference. First operand 706 states and 887 transitions. Second operand 35 states. [2019-09-03 19:30:22,423 WARN L188 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 21 DAG size of output: 19 [2019-09-03 19:30:48,735 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 17 [2019-09-03 19:30:56,916 WARN L188 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2019-09-03 19:30:57,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:30:57,033 INFO L93 Difference]: Finished difference Result 796 states and 986 transitions. [2019-09-03 19:30:57,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-03 19:30:57,033 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 53 [2019-09-03 19:30:57,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:30:57,037 INFO L225 Difference]: With dead ends: 796 [2019-09-03 19:30:57,037 INFO L226 Difference]: Without dead ends: 794 [2019-09-03 19:30:57,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 34 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 39.4s TimeCoverageRelationStatistics Valid=174, Invalid=1984, Unknown=12, NotChecked=182, Total=2352 [2019-09-03 19:30:57,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2019-09-03 19:30:57,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 721. [2019-09-03 19:30:57,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2019-09-03 19:30:57,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 904 transitions. [2019-09-03 19:30:57,371 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 904 transitions. Word has length 53 [2019-09-03 19:30:57,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:30:57,372 INFO L475 AbstractCegarLoop]: Abstraction has 721 states and 904 transitions. [2019-09-03 19:30:57,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-03 19:30:57,372 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 904 transitions. [2019-09-03 19:30:57,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-03 19:30:57,373 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:30:57,373 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:30:57,373 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:30:57,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:30:57,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1162806204, now seen corresponding path program 7 times [2019-09-03 19:30:57,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:30:57,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:30:57,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:30:57,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:30:57,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:30:57,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:30:57,552 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 19:30:57,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:30:57,553 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-03 19:30:57,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:30:57,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:30:57,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 19:30:57,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:30:57,711 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 19:30:57,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:30:57,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 16 [2019-09-03 19:30:57,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 19:30:57,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 19:30:57,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-09-03 19:30:57,715 INFO L87 Difference]: Start difference. First operand 721 states and 904 transitions. Second operand 16 states. [2019-09-03 19:30:58,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:30:58,310 INFO L93 Difference]: Finished difference Result 834 states and 1034 transitions. [2019-09-03 19:30:58,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 19:30:58,310 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 55 [2019-09-03 19:30:58,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:30:58,313 INFO L225 Difference]: With dead ends: 834 [2019-09-03 19:30:58,313 INFO L226 Difference]: Without dead ends: 736 [2019-09-03 19:30:58,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2019-09-03 19:30:58,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2019-09-03 19:30:58,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 712. [2019-09-03 19:30:58,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2019-09-03 19:30:58,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 889 transitions. [2019-09-03 19:30:58,551 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 889 transitions. Word has length 55 [2019-09-03 19:30:58,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:30:58,551 INFO L475 AbstractCegarLoop]: Abstraction has 712 states and 889 transitions. [2019-09-03 19:30:58,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 19:30:58,552 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 889 transitions. [2019-09-03 19:30:58,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-03 19:30:58,553 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:30:58,553 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 5, 5, 5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:30:58,553 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:30:58,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:30:58,553 INFO L82 PathProgramCache]: Analyzing trace with hash -836898701, now seen corresponding path program 8 times [2019-09-03 19:30:58,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:30:58,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:30:58,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:30:58,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:30:58,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:30:58,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:30:59,236 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:30:59,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:30:59,237 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-03 19:30:59,251 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:30:59,285 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:30:59,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:30:59,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-03 19:30:59,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:30:59,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:30:59,719 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:30:59,720 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-09-03 19:30:59,721 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:30:59,739 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:30:59,740 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:30:59,741 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:37 [2019-09-03 19:31:00,013 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:00,015 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:00,017 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:00,018 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:00,019 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2019-09-03 19:31:00,019 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:31:00,039 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:00,040 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:31:00,041 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:30 [2019-09-03 19:31:00,144 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:00,145 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-09-03 19:31:00,146 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:31:00,148 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:00,148 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-03 19:31:00,149 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-03 19:31:00,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:00,235 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 18 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:31:00,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:31:00,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 33 [2019-09-03 19:31:00,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 19:31:00,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 19:31:00,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=937, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 19:31:00,248 INFO L87 Difference]: Start difference. First operand 712 states and 889 transitions. Second operand 33 states. [2019-09-03 19:31:02,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:31:02,605 INFO L93 Difference]: Finished difference Result 908 states and 1135 transitions. [2019-09-03 19:31:02,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 19:31:02,606 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 52 [2019-09-03 19:31:02,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:31:02,609 INFO L225 Difference]: With dead ends: 908 [2019-09-03 19:31:02,610 INFO L226 Difference]: Without dead ends: 906 [2019-09-03 19:31:02,610 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 35 SyntacticMatches, 7 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=292, Invalid=2060, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 19:31:02,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2019-09-03 19:31:02,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 722. [2019-09-03 19:31:02,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2019-09-03 19:31:02,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 900 transitions. [2019-09-03 19:31:02,851 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 900 transitions. Word has length 52 [2019-09-03 19:31:02,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:31:02,852 INFO L475 AbstractCegarLoop]: Abstraction has 722 states and 900 transitions. [2019-09-03 19:31:02,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 19:31:02,852 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 900 transitions. [2019-09-03 19:31:02,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-03 19:31:02,853 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:31:02,854 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:31:02,854 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:31:02,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:31:02,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1869720693, now seen corresponding path program 10 times [2019-09-03 19:31:02,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:31:02,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:31:02,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:31:02,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:31:02,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:31:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:31:02,938 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 67 proven. 48 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 19:31:02,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:31:02,938 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-03 19:31:02,949 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:31:03,006 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:31:03,007 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:31:03,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 19:31:03,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:31:03,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:03,013 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 67 proven. 48 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 19:31:03,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:31:03,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-09-03 19:31:03,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 19:31:03,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 19:31:03,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:31:03,018 INFO L87 Difference]: Start difference. First operand 722 states and 900 transitions. Second operand 11 states. [2019-09-03 19:31:03,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:31:03,829 INFO L93 Difference]: Finished difference Result 988 states and 1234 transitions. [2019-09-03 19:31:03,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-03 19:31:03,829 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2019-09-03 19:31:03,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:31:03,833 INFO L225 Difference]: With dead ends: 988 [2019-09-03 19:31:03,833 INFO L226 Difference]: Without dead ends: 766 [2019-09-03 19:31:03,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=311, Invalid=619, Unknown=0, NotChecked=0, Total=930 [2019-09-03 19:31:03,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2019-09-03 19:31:04,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 599. [2019-09-03 19:31:04,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-09-03 19:31:04,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 734 transitions. [2019-09-03 19:31:04,071 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 734 transitions. Word has length 52 [2019-09-03 19:31:04,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:31:04,071 INFO L475 AbstractCegarLoop]: Abstraction has 599 states and 734 transitions. [2019-09-03 19:31:04,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 19:31:04,071 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 734 transitions. [2019-09-03 19:31:04,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-03 19:31:04,072 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:31:04,072 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 5, 5, 5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:31:04,072 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:31:04,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:31:04,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1632668653, now seen corresponding path program 9 times [2019-09-03 19:31:04,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:31:04,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:31:04,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:31:04,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:31:04,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:31:04,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:31:04,764 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 9 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:31:04,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:31:04,765 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-03 19:31:04,775 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:31:04,847 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-03 19:31:04,848 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:31:04,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-03 19:31:04,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:31:05,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:05,160 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:05,161 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-09-03 19:31:05,161 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:31:05,172 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:05,173 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-03 19:31:05,173 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2019-09-03 19:31:05,267 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:05,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:05,270 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:05,271 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:05,272 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-09-03 19:31:05,272 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:31:05,283 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:05,284 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-03 19:31:05,284 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:26 [2019-09-03 19:31:05,304 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 60 [2019-09-03 19:31:05,307 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:05,308 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:05,309 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:05,311 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:05,312 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:05,313 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:05,315 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:05,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:05,320 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:05,321 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:05,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:05,323 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:05,324 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:05,326 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:05,327 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 44 [2019-09-03 19:31:05,327 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:31:05,355 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:05,355 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:31:05,369 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:05,369 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:31:05,369 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:85, output treesize:47 [2019-09-03 19:31:05,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:05,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:05,491 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:05,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:05,494 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:05,495 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:05,496 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:05,497 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 47 [2019-09-03 19:31:05,497 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:31:05,506 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:05,507 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-03 19:31:05,507 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:63, output treesize:17 [2019-09-03 19:31:05,526 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:05,527 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-09-03 19:31:05,527 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:31:05,529 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:05,529 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-03 19:31:05,529 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-03 19:31:05,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:05,585 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 1 proven. 118 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:31:05,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:31:05,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 36 [2019-09-03 19:31:05,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-03 19:31:05,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-03 19:31:05,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1105, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 19:31:05,590 INFO L87 Difference]: Start difference. First operand 599 states and 734 transitions. Second operand 36 states. [2019-09-03 19:31:08,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:31:08,807 INFO L93 Difference]: Finished difference Result 713 states and 871 transitions. [2019-09-03 19:31:08,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-03 19:31:08,808 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 52 [2019-09-03 19:31:08,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:31:08,810 INFO L225 Difference]: With dead ends: 713 [2019-09-03 19:31:08,810 INFO L226 Difference]: Without dead ends: 711 [2019-09-03 19:31:08,811 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1066 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=459, Invalid=3323, Unknown=0, NotChecked=0, Total=3782 [2019-09-03 19:31:08,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-09-03 19:31:09,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 611. [2019-09-03 19:31:09,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-09-03 19:31:09,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 750 transitions. [2019-09-03 19:31:09,044 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 750 transitions. Word has length 52 [2019-09-03 19:31:09,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:31:09,045 INFO L475 AbstractCegarLoop]: Abstraction has 611 states and 750 transitions. [2019-09-03 19:31:09,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-03 19:31:09,045 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 750 transitions. [2019-09-03 19:31:09,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-03 19:31:09,046 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:31:09,046 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:31:09,046 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:31:09,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:31:09,046 INFO L82 PathProgramCache]: Analyzing trace with hash -631436856, now seen corresponding path program 11 times [2019-09-03 19:31:09,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:31:09,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:31:09,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:31:09,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:31:09,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:31:09,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:31:09,835 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:31:09,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:31:09,835 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-03 19:31:09,846 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:31:09,915 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-09-03 19:31:09,916 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:31:09,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 19:31:09,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:31:10,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,193 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-09-03 19:31:10,193 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 30 [2019-09-03 19:31:10,194 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:31:10,204 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:10,205 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:31:10,205 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:49 [2019-09-03 19:31:10,266 INFO L341 Elim1Store]: treesize reduction 60, result has 16.7 percent of original size [2019-09-03 19:31:10,267 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 33 [2019-09-03 19:31:10,267 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:31:10,279 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:10,279 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:31:10,280 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:65, output treesize:37 [2019-09-03 19:31:10,517 INFO L341 Elim1Store]: treesize reduction 90, result has 56.7 percent of original size [2019-09-03 19:31:10,518 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 135 [2019-09-03 19:31:10,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,519 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:31:10,560 INFO L567 ElimStorePlain]: treesize reduction 99, result has 39.3 percent of original size [2019-09-03 19:31:10,561 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-03 19:31:10,561 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:68, output treesize:64 [2019-09-03 19:31:10,903 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 70 [2019-09-03 19:31:10,903 INFO L341 Elim1Store]: treesize reduction 140, result has 67.4 percent of original size [2019-09-03 19:31:10,904 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 68 treesize of output 310 [2019-09-03 19:31:10,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:10,937 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:31:11,160 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 44 [2019-09-03 19:31:11,160 INFO L567 ElimStorePlain]: treesize reduction 1775, result has 5.5 percent of original size [2019-09-03 19:31:11,161 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-03 19:31:11,161 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:93, output treesize:102 [2019-09-03 19:31:11,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:11,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,660 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-09-03 19:31:15,661 INFO L341 Elim1Store]: treesize reduction 35, result has 88.9 percent of original size [2019-09-03 19:31:15,661 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 60 treesize of output 299 [2019-09-03 19:31:15,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,687 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:31:15,935 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 45 [2019-09-03 19:31:15,936 INFO L567 ElimStorePlain]: treesize reduction 1694, result has 7.0 percent of original size [2019-09-03 19:31:15,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:15,938 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-09-03 19:31:15,938 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:80, output treesize:94 [2019-09-03 19:31:16,839 WARN L188 SmtUtils]: Spent 821.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 21 [2019-09-03 19:31:18,949 INFO L341 Elim1Store]: treesize reduction 28, result has 67.1 percent of original size [2019-09-03 19:31:18,950 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 68 [2019-09-03 19:31:18,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:18,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:18,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:18,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:18,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:18,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:18,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:18,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:18,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:18,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:18,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:18,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:18,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:18,956 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-09-03 19:31:18,995 INFO L567 ElimStorePlain]: treesize reduction 138, result has 10.4 percent of original size [2019-09-03 19:31:18,996 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:31:18,996 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:5 [2019-09-03 19:31:19,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:19,102 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 16 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:31:19,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:31:19,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42 [2019-09-03 19:31:19,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-03 19:31:19,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-03 19:31:19,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1572, Unknown=2, NotChecked=0, Total=1722 [2019-09-03 19:31:19,106 INFO L87 Difference]: Start difference. First operand 611 states and 750 transitions. Second operand 42 states. [2019-09-03 19:31:28,140 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 59 DAG size of output: 37 [2019-09-03 19:31:35,235 WARN L188 SmtUtils]: Spent 793.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-09-03 19:31:44,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:31:44,680 INFO L93 Difference]: Finished difference Result 730 states and 891 transitions. [2019-09-03 19:31:44,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-03 19:31:44,680 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 52 [2019-09-03 19:31:44,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:31:44,683 INFO L225 Difference]: With dead ends: 730 [2019-09-03 19:31:44,683 INFO L226 Difference]: Without dead ends: 728 [2019-09-03 19:31:44,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1396 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=569, Invalid=5129, Unknown=2, NotChecked=0, Total=5700 [2019-09-03 19:31:44,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-09-03 19:31:44,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 594. [2019-09-03 19:31:44,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2019-09-03 19:31:44,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 731 transitions. [2019-09-03 19:31:44,900 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 731 transitions. Word has length 52 [2019-09-03 19:31:44,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:31:44,900 INFO L475 AbstractCegarLoop]: Abstraction has 594 states and 731 transitions. [2019-09-03 19:31:44,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-03 19:31:44,900 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 731 transitions. [2019-09-03 19:31:44,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-03 19:31:44,901 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:31:44,902 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 5, 5, 5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:31:44,902 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:31:44,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:31:44,902 INFO L82 PathProgramCache]: Analyzing trace with hash 707662911, now seen corresponding path program 10 times [2019-09-03 19:31:44,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:31:44,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:31:44,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:31:44,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:31:44,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:31:44,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:31:46,148 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 10 proven. 109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:31:46,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:31:46,149 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:31:46,173 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:31:46,307 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:31:46,307 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:31:46,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-03 19:31:46,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:31:46,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:46,359 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2019-09-03 19:31:46,359 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:31:46,371 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:46,371 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:31:46,372 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2019-09-03 19:31:46,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:46,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:46,571 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:46,572 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:46,573 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:46,574 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 42 [2019-09-03 19:31:46,574 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:31:46,582 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:46,582 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-03 19:31:46,583 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:57, output treesize:30 [2019-09-03 19:31:46,700 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:46,701 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:46,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:46,703 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:46,703 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2019-09-03 19:31:46,704 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:31:46,711 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:46,712 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-03 19:31:46,712 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:30 [2019-09-03 19:31:46,797 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:46,798 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:46,799 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:46,800 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:46,801 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2019-09-03 19:31:46,801 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:31:46,810 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:46,811 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-03 19:31:46,811 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:30 [2019-09-03 19:31:46,886 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:46,887 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:46,888 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:46,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:46,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:46,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:46,892 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:46,893 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2019-09-03 19:31:46,893 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:31:46,902 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:46,902 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:31:46,903 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2019-09-03 19:31:46,952 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:46,953 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:46,954 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:46,956 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:46,957 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:46,958 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:46,959 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:46,960 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:46,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:46,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:46,963 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:46,964 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 60 treesize of output 59 [2019-09-03 19:31:46,965 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:31:46,980 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:46,980 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:31:46,980 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:66, output treesize:41 [2019-09-03 19:31:47,026 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:47,027 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:47,028 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:47,029 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:47,030 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:47,032 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:47,033 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:47,033 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 41 [2019-09-03 19:31:47,033 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:31:47,039 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:47,039 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-03 19:31:47,040 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:17 [2019-09-03 19:31:47,077 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:47,077 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-09-03 19:31:47,078 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:31:47,079 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:47,079 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-03 19:31:47,079 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-03 19:31:47,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:47,146 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:31:47,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:31:47,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 38 [2019-09-03 19:31:47,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-03 19:31:47,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-03 19:31:47,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1243, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 19:31:47,150 INFO L87 Difference]: Start difference. First operand 594 states and 731 transitions. Second operand 38 states. [2019-09-03 19:31:53,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:31:53,098 INFO L93 Difference]: Finished difference Result 1071 states and 1329 transitions. [2019-09-03 19:31:53,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-03 19:31:53,099 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 52 [2019-09-03 19:31:53,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:31:53,105 INFO L225 Difference]: With dead ends: 1071 [2019-09-03 19:31:53,105 INFO L226 Difference]: Without dead ends: 1069 [2019-09-03 19:31:53,106 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2714 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=986, Invalid=7756, Unknown=0, NotChecked=0, Total=8742 [2019-09-03 19:31:53,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2019-09-03 19:31:53,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 689. [2019-09-03 19:31:53,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2019-09-03 19:31:53,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 856 transitions. [2019-09-03 19:31:53,370 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 856 transitions. Word has length 52 [2019-09-03 19:31:53,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:31:53,370 INFO L475 AbstractCegarLoop]: Abstraction has 689 states and 856 transitions. [2019-09-03 19:31:53,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-03 19:31:53,371 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 856 transitions. [2019-09-03 19:31:53,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-03 19:31:53,373 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:31:53,373 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:31:53,373 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:31:53,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:31:53,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1862675833, now seen corresponding path program 12 times [2019-09-03 19:31:53,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:31:53,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:31:53,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:31:53,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:31:53,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:31:53,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:31:54,374 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 10 proven. 109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:31:54,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:31:54,375 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:31:54,387 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:31:54,450 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-09-03 19:31:54,450 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:31:54,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-03 19:31:54,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:31:54,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:54,473 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:54,474 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 29 [2019-09-03 19:31:54,474 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:31:54,487 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:54,487 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:31:54,488 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:49 [2019-09-03 19:31:54,659 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:31:54,660 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:54,661 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:54,662 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 44 [2019-09-03 19:31:54,662 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:31:54,690 INFO L567 ElimStorePlain]: treesize reduction 12, result has 76.9 percent of original size [2019-09-03 19:31:54,691 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-03 19:31:54,691 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:65, output treesize:32 [2019-09-03 19:31:54,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:54,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:54,781 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:54,782 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:54,783 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-09-03 19:31:54,783 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:31:54,796 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:54,797 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-03 19:31:54,797 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:30 [2019-09-03 19:31:54,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:54,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:54,855 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:54,856 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:54,856 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-09-03 19:31:54,856 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:31:54,867 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:54,867 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-03 19:31:54,868 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:22 [2019-09-03 19:31:54,912 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:54,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:54,915 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:54,916 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:54,916 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-09-03 19:31:54,916 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:31:54,927 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:54,927 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-03 19:31:54,928 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:22 [2019-09-03 19:31:54,950 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 62 [2019-09-03 19:31:54,952 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:54,953 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:54,954 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:54,956 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:54,957 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:54,958 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:54,960 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:54,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:54,964 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:54,965 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:54,967 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:54,968 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:54,969 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:54,970 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:54,971 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2019-09-03 19:31:54,972 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:31:54,979 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:54,979 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:31:54,988 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:54,988 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:31:54,988 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:81, output treesize:43 [2019-09-03 19:31:55,101 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:55,102 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:55,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:55,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:55,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:55,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:55,109 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:55,110 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:55,111 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:55,113 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:55,114 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:55,114 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 61 [2019-09-03 19:31:55,114 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:31:55,122 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:55,122 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:31:55,122 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:68, output treesize:43 [2019-09-03 19:31:55,307 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:55,308 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:55,309 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:55,311 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:55,312 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:55,313 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:55,314 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:55,314 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 49 [2019-09-03 19:31:55,314 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:31:55,323 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:55,323 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-03 19:31:55,324 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:59, output treesize:19 [2019-09-03 19:31:55,373 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:55,374 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2019-09-03 19:31:55,374 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:31:55,375 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:55,376 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-03 19:31:55,376 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2019-09-03 19:31:55,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:55,464 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 21 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:31:55,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:31:55,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 37 [2019-09-03 19:31:55,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 19:31:55,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 19:31:55,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1179, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 19:31:55,469 INFO L87 Difference]: Start difference. First operand 689 states and 856 transitions. Second operand 37 states. [2019-09-03 19:31:58,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:31:58,518 INFO L93 Difference]: Finished difference Result 854 states and 1056 transitions. [2019-09-03 19:31:58,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-03 19:31:58,519 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 52 [2019-09-03 19:31:58,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:31:58,522 INFO L225 Difference]: With dead ends: 854 [2019-09-03 19:31:58,522 INFO L226 Difference]: Without dead ends: 852 [2019-09-03 19:31:58,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 34 SyntacticMatches, 10 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1235 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=568, Invalid=3722, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 19:31:58,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2019-09-03 19:31:58,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 716. [2019-09-03 19:31:58,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2019-09-03 19:31:58,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 892 transitions. [2019-09-03 19:31:58,785 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 892 transitions. Word has length 52 [2019-09-03 19:31:58,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:31:58,786 INFO L475 AbstractCegarLoop]: Abstraction has 716 states and 892 transitions. [2019-09-03 19:31:58,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 19:31:58,786 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 892 transitions. [2019-09-03 19:31:58,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-03 19:31:58,787 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:31:58,787 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:31:58,788 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:31:58,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:31:58,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1002602807, now seen corresponding path program 12 times [2019-09-03 19:31:58,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:31:58,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:31:58,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:31:58,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:31:58,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:31:58,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:31:59,060 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 2 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:31:59,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:31:59,063 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) [2019-09-03 19:31:59,087 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:31:59,171 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-03 19:31:59,171 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:31:59,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 19:31:59,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:31:59,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:59,479 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:59,480 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 30 [2019-09-03 19:31:59,480 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:31:59,490 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:59,490 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:31:59,491 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:42 [2019-09-03 19:31:59,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:59,598 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:59,599 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2019-09-03 19:31:59,599 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:31:59,606 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:59,606 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-03 19:31:59,606 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:21 [2019-09-03 19:31:59,866 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:59,866 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2019-09-03 19:31:59,867 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:31:59,869 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:59,869 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-03 19:31:59,869 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2019-09-03 19:31:59,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:59,927 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:31:59,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:31:59,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21] total 36 [2019-09-03 19:31:59,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-03 19:31:59,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-03 19:31:59,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1159, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 19:31:59,932 INFO L87 Difference]: Start difference. First operand 716 states and 892 transitions. Second operand 36 states. [2019-09-03 19:32:03,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:32:03,549 INFO L93 Difference]: Finished difference Result 1024 states and 1256 transitions. [2019-09-03 19:32:03,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-03 19:32:03,549 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 54 [2019-09-03 19:32:03,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:32:03,554 INFO L225 Difference]: With dead ends: 1024 [2019-09-03 19:32:03,554 INFO L226 Difference]: Without dead ends: 1022 [2019-09-03 19:32:03,555 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1802 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=495, Invalid=5667, Unknown=0, NotChecked=0, Total=6162 [2019-09-03 19:32:03,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2019-09-03 19:32:03,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 749. [2019-09-03 19:32:03,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 749 states. [2019-09-03 19:32:03,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 930 transitions. [2019-09-03 19:32:03,851 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 930 transitions. Word has length 54 [2019-09-03 19:32:03,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:32:03,851 INFO L475 AbstractCegarLoop]: Abstraction has 749 states and 930 transitions. [2019-09-03 19:32:03,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-03 19:32:03,851 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 930 transitions. [2019-09-03 19:32:03,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-03 19:32:03,852 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:32:03,852 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:32:03,852 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:32:03,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:32:03,853 INFO L82 PathProgramCache]: Analyzing trace with hash 498357567, now seen corresponding path program 8 times [2019-09-03 19:32:03,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:32:03,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:32:03,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:32:03,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:32:03,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:32:03,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:32:05,290 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 9 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:32:05,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:32:05,291 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 19:32:05,314 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:32:05,362 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:32:05,362 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:32:05,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-03 19:32:05,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:32:05,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:32:05,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:05,551 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-09-03 19:32:05,551 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:32:05,565 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:32:05,566 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:32:05,566 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2019-09-03 19:32:05,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:05,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:05,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:05,658 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:32:05,659 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-09-03 19:32:05,659 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:32:05,670 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:32:05,671 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-03 19:32:05,671 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:26 [2019-09-03 19:32:05,752 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:05,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:05,755 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:05,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:05,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:05,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:05,759 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:32:05,759 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2019-09-03 19:32:05,760 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:32:05,774 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:32:05,775 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:32:05,775 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:51 [2019-09-03 19:32:05,831 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:05,833 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:05,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:05,835 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:05,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:05,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:05,839 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:32:05,840 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 49 [2019-09-03 19:32:05,840 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:32:05,852 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:32:05,852 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:32:05,853 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:76, output treesize:52 [2019-09-03 19:32:06,050 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:32:06,052 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:06,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:06,055 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:06,056 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:32:06,057 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:06,062 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:32:06,062 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 64 [2019-09-03 19:32:06,062 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:32:06,094 INFO L567 ElimStorePlain]: treesize reduction 41, result has 53.4 percent of original size [2019-09-03 19:32:06,094 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-03 19:32:06,094 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:42 [2019-09-03 19:32:06,263 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:06,266 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:06,267 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:06,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:06,270 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:06,284 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:32:06,284 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 76 [2019-09-03 19:32:06,285 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:32:06,328 INFO L567 ElimStorePlain]: treesize reduction 17, result has 80.7 percent of original size [2019-09-03 19:32:06,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:32:06,330 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-03 19:32:06,330 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:61, output treesize:64 [2019-09-03 19:32:06,457 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:06,458 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:06,459 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:06,460 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:32:06,461 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-09-03 19:32:06,461 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:32:06,469 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:32:06,470 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-03 19:32:06,470 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2019-09-03 19:32:06,678 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:32:06,679 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-09-03 19:32:06,679 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:32:06,680 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:32:06,680 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-03 19:32:06,680 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-03 19:32:06,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:32:06,758 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (53)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:32:06,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:32:06,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 31] total 51 [2019-09-03 19:32:06,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-03 19:32:06,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-03 19:32:06,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=2259, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 19:32:06,763 INFO L87 Difference]: Start difference. First operand 749 states and 930 transitions. Second operand 51 states. [2019-09-03 19:32:37,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:32:37,209 INFO L93 Difference]: Finished difference Result 958 states and 1171 transitions. [2019-09-03 19:32:37,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-03 19:32:37,209 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 54 [2019-09-03 19:32:37,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:32:37,213 INFO L225 Difference]: With dead ends: 958 [2019-09-03 19:32:37,213 INFO L226 Difference]: Without dead ends: 956 [2019-09-03 19:32:37,214 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3815 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1080, Invalid=9222, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 19:32:37,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2019-09-03 19:32:37,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 800. [2019-09-03 19:32:37,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2019-09-03 19:32:37,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 996 transitions. [2019-09-03 19:32:37,517 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 996 transitions. Word has length 54 [2019-09-03 19:32:37,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:32:37,517 INFO L475 AbstractCegarLoop]: Abstraction has 800 states and 996 transitions. [2019-09-03 19:32:37,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-03 19:32:37,517 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 996 transitions. [2019-09-03 19:32:37,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-03 19:32:37,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:32:37,518 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:32:37,518 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:32:37,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:32:37,519 INFO L82 PathProgramCache]: Analyzing trace with hash -392706827, now seen corresponding path program 9 times [2019-09-03 19:32:37,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:32:37,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:32:37,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:32:37,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:32:37,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:32:37,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:32:39,142 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 5 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:32:39,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:32:39,142 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-03 19:32:39,158 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:32:39,221 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-03 19:32:39,221 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:32:39,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-03 19:32:39,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:32:39,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:32:39,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:39,389 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-09-03 19:32:39,390 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:32:39,400 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:32:39,401 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-03 19:32:39,401 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2019-09-03 19:32:39,433 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2019-09-03 19:32:39,436 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:39,438 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:39,439 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:39,441 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:39,444 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:39,445 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:39,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:39,448 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 34 [2019-09-03 19:32:39,448 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:32:39,455 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:32:39,455 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:32:39,469 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:32:39,469 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:32:39,470 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:50 [2019-09-03 19:32:39,666 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:39,669 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:39,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:39,677 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:39,679 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:39,728 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:32:39,729 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 61 treesize of output 188 [2019-09-03 19:32:39,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:32:39,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:32:39,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:32:39,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:32:39,732 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:32:39,819 INFO L567 ElimStorePlain]: treesize reduction 341, result has 21.1 percent of original size [2019-09-03 19:32:39,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:32:39,820 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:32:39,820 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:80, output treesize:90 [2019-09-03 19:32:39,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:32:39,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:32:40,078 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-03 19:32:40,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:40,146 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:40,147 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:32:40,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:40,149 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:32:40,149 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 53 [2019-09-03 19:32:40,149 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:32:40,177 INFO L567 ElimStorePlain]: treesize reduction 7, result has 87.7 percent of original size [2019-09-03 19:32:40,177 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:32:40,178 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:70, output treesize:38 [2019-09-03 19:32:40,346 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:40,347 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:40,348 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:40,349 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:32:40,349 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2019-09-03 19:32:40,349 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:32:40,365 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:32:40,366 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:32:40,366 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:53, output treesize:32 [2019-09-03 19:32:40,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:40,494 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:40,496 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:40,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:40,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:40,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:40,500 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:32:40,501 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 47 [2019-09-03 19:32:40,501 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:32:40,518 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:32:40,519 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-03 19:32:40,520 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:61, output treesize:57 [2019-09-03 19:32:40,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:40,611 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:40,612 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:40,614 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:40,616 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:40,621 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:40,622 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:40,623 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:40,653 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:32:40,654 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 54 treesize of output 141 [2019-09-03 19:32:40,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:32:40,655 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:32:40,710 INFO L567 ElimStorePlain]: treesize reduction 52, result has 64.6 percent of original size [2019-09-03 19:32:40,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 19:32:40,712 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-03 19:32:40,712 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:73, output treesize:78 [2019-09-03 19:32:41,002 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:32:41,003 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-09-03 19:32:41,003 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:32:41,005 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:32:41,005 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-03 19:32:41,005 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-03 19:32:41,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:32:41,097 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 1 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:32:41,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:32:41,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 30] total 48 [2019-09-03 19:32:41,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-03 19:32:41,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-03 19:32:41,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=2041, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 19:32:41,102 INFO L87 Difference]: Start difference. First operand 800 states and 996 transitions. Second operand 48 states. [2019-09-03 19:33:14,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:33:14,202 INFO L93 Difference]: Finished difference Result 1036 states and 1266 transitions. [2019-09-03 19:33:14,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-03 19:33:14,202 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 54 [2019-09-03 19:33:14,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:33:14,205 INFO L225 Difference]: With dead ends: 1036 [2019-09-03 19:33:14,205 INFO L226 Difference]: Without dead ends: 1034 [2019-09-03 19:33:14,206 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 28 SyntacticMatches, 9 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3705 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=938, Invalid=10192, Unknown=0, NotChecked=0, Total=11130 [2019-09-03 19:33:14,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2019-09-03 19:33:14,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 811. [2019-09-03 19:33:14,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2019-09-03 19:33:14,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1003 transitions. [2019-09-03 19:33:14,537 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1003 transitions. Word has length 54 [2019-09-03 19:33:14,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:33:14,538 INFO L475 AbstractCegarLoop]: Abstraction has 811 states and 1003 transitions. [2019-09-03 19:33:14,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-03 19:33:14,538 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1003 transitions. [2019-09-03 19:33:14,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-03 19:33:14,540 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:33:14,540 INFO L399 BasicCegarLoop]: trace histogram [8, 6, 5, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:33:14,540 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:33:14,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:33:14,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1615299338, now seen corresponding path program 10 times [2019-09-03 19:33:14,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:33:14,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:33:14,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:14,541 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:33:14,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:33:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:33:15,635 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 11 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:33:15,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:33:15,635 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-03 19:33:15,646 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:33:15,701 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:33:15,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:33:15,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 19:33:15,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:33:15,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:33:15,815 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-09-03 19:33:15,816 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 30 [2019-09-03 19:33:15,816 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:33:15,823 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:33:15,824 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:33:15,824 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2019-09-03 19:33:15,964 INFO L341 Elim1Store]: treesize reduction 60, result has 16.7 percent of original size [2019-09-03 19:33:15,964 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 33 [2019-09-03 19:33:15,965 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:33:15,974 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:33:15,975 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:33:15,975 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:32 [2019-09-03 19:33:16,095 INFO L341 Elim1Store]: treesize reduction 90, result has 56.7 percent of original size [2019-09-03 19:33:16,096 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 135 [2019-09-03 19:33:16,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:33:16,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:33:16,098 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:33:16,143 INFO L567 ElimStorePlain]: treesize reduction 70, result has 54.5 percent of original size [2019-09-03 19:33:16,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 19:33:16,144 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-03 19:33:16,144 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:61, output treesize:84 [2019-09-03 19:33:16,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 19:33:23,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 19:33:31,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms