java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-tiling/pnr5.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 11:33:39,892 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 11:33:39,894 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 11:33:39,906 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 11:33:39,906 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 11:33:39,907 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 11:33:39,909 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 11:33:39,910 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 11:33:39,912 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 11:33:39,913 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 11:33:39,914 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 11:33:39,915 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 11:33:39,915 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 11:33:39,916 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 11:33:39,917 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 11:33:39,918 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 11:33:39,919 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 11:33:39,920 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 11:33:39,922 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 11:33:39,924 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 11:33:39,925 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 11:33:39,926 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 11:33:39,928 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 11:33:39,928 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 11:33:39,930 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 11:33:39,931 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 11:33:39,931 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 11:33:39,932 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 11:33:39,932 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 11:33:39,933 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 11:33:39,934 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 11:33:39,934 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 11:33:39,935 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 11:33:39,936 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 11:33:39,937 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 11:33:39,937 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 11:33:39,938 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 11:33:39,938 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 11:33:39,938 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 11:33:39,939 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 11:33:39,940 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 11:33:39,941 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 11:33:39,955 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 11:33:39,955 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 11:33:39,956 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 11:33:39,957 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 11:33:39,957 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 11:33:39,957 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 11:33:39,957 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 11:33:39,958 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 11:33:39,958 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 11:33:39,958 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 11:33:39,958 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 11:33:39,958 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 11:33:39,959 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 11:33:39,959 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 11:33:39,959 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 11:33:39,959 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 11:33:39,959 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 11:33:39,960 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 11:33:39,960 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 11:33:39,960 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 11:33:39,960 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 11:33:39,960 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 11:33:39,961 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 11:33:39,961 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 11:33:39,961 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 11:33:39,961 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 11:33:39,961 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 11:33:39,961 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 11:33:39,962 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 11:33:40,002 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 11:33:40,015 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 11:33:40,018 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 11:33:40,020 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 11:33:40,020 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 11:33:40,021 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/pnr5.c [2019-09-07 11:33:40,083 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f04d50500/538d279ed51b401eaae09b7803b3d32d/FLAGfd21d9b00 [2019-09-07 11:33:40,520 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 11:33:40,521 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/pnr5.c [2019-09-07 11:33:40,531 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f04d50500/538d279ed51b401eaae09b7803b3d32d/FLAGfd21d9b00 [2019-09-07 11:33:40,924 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f04d50500/538d279ed51b401eaae09b7803b3d32d [2019-09-07 11:33:40,935 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 11:33:40,937 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 11:33:40,938 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 11:33:40,938 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 11:33:40,941 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 11:33:40,942 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 11:33:40" (1/1) ... [2019-09-07 11:33:40,944 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d7e4e80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:33:40, skipping insertion in model container [2019-09-07 11:33:40,944 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 11:33:40" (1/1) ... [2019-09-07 11:33:40,950 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 11:33:40,970 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 11:33:41,162 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 11:33:41,174 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 11:33:41,201 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 11:33:41,218 INFO L192 MainTranslator]: Completed translation [2019-09-07 11:33:41,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:33:41 WrapperNode [2019-09-07 11:33:41,219 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 11:33:41,220 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 11:33:41,220 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 11:33:41,220 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 11:33:41,321 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:33:41" (1/1) ... [2019-09-07 11:33:41,321 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:33:41" (1/1) ... [2019-09-07 11:33:41,330 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:33:41" (1/1) ... [2019-09-07 11:33:41,331 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:33:41" (1/1) ... [2019-09-07 11:33:41,340 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:33:41" (1/1) ... [2019-09-07 11:33:41,348 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:33:41" (1/1) ... [2019-09-07 11:33:41,350 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:33:41" (1/1) ... [2019-09-07 11:33:41,353 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 11:33:41,354 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 11:33:41,354 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 11:33:41,354 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 11:33:41,355 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:33:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 11:33:41,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 11:33:41,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 11:33:41,403 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-07 11:33:41,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ReadFromPort [2019-09-07 11:33:41,403 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 11:33:41,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 11:33:41,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-07 11:33:41,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-07 11:33:41,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 11:33:41,404 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-07 11:33:41,405 INFO L130 BoogieDeclarations]: Found specification of procedure ReadFromPort [2019-09-07 11:33:41,405 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 11:33:41,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-07 11:33:41,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-07 11:33:41,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-07 11:33:41,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 11:33:41,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 11:33:41,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-07 11:33:41,761 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 11:33:41,762 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-07 11:33:41,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 11:33:41 BoogieIcfgContainer [2019-09-07 11:33:41,763 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 11:33:41,764 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 11:33:41,765 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 11:33:41,768 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 11:33:41,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 11:33:40" (1/3) ... [2019-09-07 11:33:41,769 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@256f5a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 11:33:41, skipping insertion in model container [2019-09-07 11:33:41,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:33:41" (2/3) ... [2019-09-07 11:33:41,770 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@256f5a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 11:33:41, skipping insertion in model container [2019-09-07 11:33:41,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 11:33:41" (3/3) ... [2019-09-07 11:33:41,772 INFO L109 eAbstractionObserver]: Analyzing ICFG pnr5.c [2019-09-07 11:33:41,782 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 11:33:41,792 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 11:33:41,810 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 11:33:41,845 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 11:33:41,846 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 11:33:41,846 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 11:33:41,846 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 11:33:41,846 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 11:33:41,846 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 11:33:41,846 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 11:33:41,847 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 11:33:41,847 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 11:33:41,864 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-09-07 11:33:41,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-07 11:33:41,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:33:41,871 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:33:41,873 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:33:41,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:33:41,880 INFO L82 PathProgramCache]: Analyzing trace with hash -973608197, now seen corresponding path program 1 times [2019-09-07 11:33:41,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:33:41,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:33:41,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:33:41,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:33:41,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:33:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:33:42,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 11:33:42,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:33:42,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-07 11:33:42,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-07 11:33:42,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-07 11:33:42,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 11:33:42,056 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2019-09-07 11:33:42,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:33:42,086 INFO L93 Difference]: Finished difference Result 60 states and 78 transitions. [2019-09-07 11:33:42,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-07 11:33:42,087 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-09-07 11:33:42,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:33:42,097 INFO L225 Difference]: With dead ends: 60 [2019-09-07 11:33:42,098 INFO L226 Difference]: Without dead ends: 39 [2019-09-07 11:33:42,101 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 11:33:42,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-07 11:33:42,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-09-07 11:33:42,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-07 11:33:42,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2019-09-07 11:33:42,161 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 15 [2019-09-07 11:33:42,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:33:42,161 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2019-09-07 11:33:42,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-07 11:33:42,162 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2019-09-07 11:33:42,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-07 11:33:42,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:33:42,165 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:33:42,166 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:33:42,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:33:42,166 INFO L82 PathProgramCache]: Analyzing trace with hash 2038399118, now seen corresponding path program 1 times [2019-09-07 11:33:42,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:33:42,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:33:42,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:33:42,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:33:42,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:33:42,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:33:42,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 11:33:42,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:33:42,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 11:33:42,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 11:33:42,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 11:33:42,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 11:33:42,558 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand 4 states. [2019-09-07 11:33:42,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:33:42,738 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2019-09-07 11:33:42,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 11:33:42,739 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-09-07 11:33:42,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:33:42,742 INFO L225 Difference]: With dead ends: 67 [2019-09-07 11:33:42,743 INFO L226 Difference]: Without dead ends: 56 [2019-09-07 11:33:42,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 11:33:42,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-07 11:33:42,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 40. [2019-09-07 11:33:42,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-07 11:33:42,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2019-09-07 11:33:42,780 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 15 [2019-09-07 11:33:42,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:33:42,780 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2019-09-07 11:33:42,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 11:33:42,781 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2019-09-07 11:33:42,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-07 11:33:42,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:33:42,786 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:33:42,786 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:33:42,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:33:42,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1405014836, now seen corresponding path program 1 times [2019-09-07 11:33:42,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:33:42,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:33:42,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:33:42,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:33:42,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:33:42,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:33:43,341 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-07 11:33:43,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:33:43,342 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:33:43,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:33:43,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:33:43,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-07 11:33:43,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:33:43,528 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-09-07 11:33:43,529 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:33:43,540 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:33:43,541 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:33:43,541 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-09-07 11:33:43,588 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-09-07 11:33:43,588 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 30 treesize of output 29 [2019-09-07 11:33:43,589 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:33:43,598 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:33:43,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-07 11:33:43,599 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:17 [2019-09-07 11:33:43,620 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-09-07 11:33:43,620 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 30 treesize of output 29 [2019-09-07 11:33:43,621 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:33:43,628 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:33:43,629 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:33:43,629 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:17 [2019-09-07 11:33:43,658 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-09-07 11:33:43,659 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 30 treesize of output 29 [2019-09-07 11:33:43,659 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:33:43,670 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:33:43,670 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:33:43,671 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:17 [2019-09-07 11:33:43,689 INFO L341 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2019-09-07 11:33:43,690 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 22 treesize of output 21 [2019-09-07 11:33:43,691 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:33:43,699 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:33:43,699 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:33:43,699 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:8 [2019-09-07 11:33:43,738 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-09-07 11:33:43,738 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:33:43,740 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:33:43,741 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:33:43,741 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2019-09-07 11:33:43,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:33:43,777 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:33:43,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:33:43,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2019-09-07 11:33:43,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 11:33:43,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 11:33:43,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-09-07 11:33:43,787 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand 16 states. [2019-09-07 11:33:44,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:33:44,271 INFO L93 Difference]: Finished difference Result 105 states and 146 transitions. [2019-09-07 11:33:44,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 11:33:44,272 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 47 [2019-09-07 11:33:44,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:33:44,277 INFO L225 Difference]: With dead ends: 105 [2019-09-07 11:33:44,277 INFO L226 Difference]: Without dead ends: 103 [2019-09-07 11:33:44,278 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2019-09-07 11:33:44,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-09-07 11:33:44,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 64. [2019-09-07 11:33:44,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-07 11:33:44,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 85 transitions. [2019-09-07 11:33:44,317 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 85 transitions. Word has length 47 [2019-09-07 11:33:44,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:33:44,319 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 85 transitions. [2019-09-07 11:33:44,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 11:33:44,320 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 85 transitions. [2019-09-07 11:33:44,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-07 11:33:44,326 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:33:44,326 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:33:44,326 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:33:44,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:33:44,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1332628278, now seen corresponding path program 1 times [2019-09-07 11:33:44,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:33:44,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:33:44,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:33:44,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:33:44,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:33:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:33:44,746 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-07 11:33:44,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:33:44,749 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:33:44,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:33:44,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:33:44,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-07 11:33:44,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:33:44,862 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 16 treesize of output 12 [2019-09-07 11:33:44,863 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:33:44,870 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:33:44,871 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:33:44,871 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-09-07 11:33:44,951 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-09-07 11:33:44,952 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 29 treesize of output 28 [2019-09-07 11:33:44,953 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:33:44,962 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:33:44,964 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:33:44,964 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-09-07 11:33:45,019 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-09-07 11:33:45,020 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 29 treesize of output 28 [2019-09-07 11:33:45,021 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:33:45,030 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:33:45,031 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:33:45,031 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-09-07 11:33:45,104 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-09-07 11:33:45,104 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 29 treesize of output 28 [2019-09-07 11:33:45,105 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:33:45,114 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:33:45,114 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:33:45,115 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-09-07 11:33:45,166 INFO L341 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2019-09-07 11:33:45,167 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 21 treesize of output 20 [2019-09-07 11:33:45,168 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:33:45,174 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:33:45,174 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:33:45,175 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:11 [2019-09-07 11:33:45,222 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-07 11:33:45,224 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:33:45,229 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:33:45,229 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:33:45,230 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:7 [2019-09-07 11:33:45,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:33:45,288 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-07 11:33:45,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:33:45,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2019-09-07 11:33:45,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 11:33:45,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 11:33:45,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-07 11:33:45,294 INFO L87 Difference]: Start difference. First operand 64 states and 85 transitions. Second operand 19 states. [2019-09-07 11:33:46,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:33:46,765 INFO L93 Difference]: Finished difference Result 211 states and 292 transitions. [2019-09-07 11:33:46,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 11:33:46,765 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2019-09-07 11:33:46,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:33:46,775 INFO L225 Difference]: With dead ends: 211 [2019-09-07 11:33:46,775 INFO L226 Difference]: Without dead ends: 209 [2019-09-07 11:33:46,782 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 36 SyntacticMatches, 11 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=228, Invalid=1104, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 11:33:46,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-09-07 11:33:46,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 46. [2019-09-07 11:33:46,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-07 11:33:46,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2019-09-07 11:33:46,804 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 47 [2019-09-07 11:33:46,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:33:46,805 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2019-09-07 11:33:46,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 11:33:46,805 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2019-09-07 11:33:46,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-07 11:33:46,806 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:33:46,806 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:33:46,807 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:33:46,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:33:46,807 INFO L82 PathProgramCache]: Analyzing trace with hash 2120960149, now seen corresponding path program 1 times [2019-09-07 11:33:46,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:33:46,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:33:46,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:33:46,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:33:46,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:33:46,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:33:46,934 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-07 11:33:46,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:33:46,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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:33:46,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:33:46,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:33:47,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-07 11:33:47,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:33:47,018 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-09-07 11:33:47,018 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:33:47,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:33:47,025 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:33:47,026 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-09-07 11:33:47,042 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-09-07 11:33:47,043 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 30 treesize of output 29 [2019-09-07 11:33:47,044 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:33:47,054 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:33:47,054 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:33:47,055 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:17 [2019-09-07 11:33:47,079 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-09-07 11:33:47,080 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 30 treesize of output 29 [2019-09-07 11:33:47,080 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:33:47,090 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:33:47,091 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:33:47,091 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:17 [2019-09-07 11:33:47,117 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-09-07 11:33:47,117 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 24 treesize of output 23 [2019-09-07 11:33:47,119 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:33:47,125 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:33:47,126 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:33:47,127 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:10 [2019-09-07 11:33:47,141 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-09-07 11:33:47,142 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:33:47,145 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:33:47,145 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:33:47,146 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:4 [2019-09-07 11:33:47,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:33:47,175 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-07 11:33:47,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:33:47,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2019-09-07 11:33:47,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 11:33:47,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 11:33:47,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-07 11:33:47,180 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand 12 states. [2019-09-07 11:33:47,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:33:47,463 INFO L93 Difference]: Finished difference Result 108 states and 147 transitions. [2019-09-07 11:33:47,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 11:33:47,463 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-09-07 11:33:47,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:33:47,465 INFO L225 Difference]: With dead ends: 108 [2019-09-07 11:33:47,465 INFO L226 Difference]: Without dead ends: 106 [2019-09-07 11:33:47,466 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2019-09-07 11:33:47,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-09-07 11:33:47,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 74. [2019-09-07 11:33:47,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-09-07 11:33:47,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 96 transitions. [2019-09-07 11:33:47,483 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 96 transitions. Word has length 55 [2019-09-07 11:33:47,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:33:47,484 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 96 transitions. [2019-09-07 11:33:47,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 11:33:47,484 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 96 transitions. [2019-09-07 11:33:47,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-07 11:33:47,486 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:33:47,486 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:33:47,486 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:33:47,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:33:47,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1276954647, now seen corresponding path program 1 times [2019-09-07 11:33:47,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:33:47,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:33:47,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:33:47,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:33:47,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:33:47,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:33:47,673 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-07 11:33:47,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:33:47,674 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:33:47,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:33:47,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:33:47,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-07 11:33:47,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:33:47,767 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 16 treesize of output 12 [2019-09-07 11:33:47,768 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:33:47,774 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:33:47,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-07 11:33:47,775 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-09-07 11:33:47,847 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-09-07 11:33:47,847 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 29 treesize of output 28 [2019-09-07 11:33:47,848 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:33:47,856 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:33:47,857 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:33:47,857 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-09-07 11:33:47,911 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-09-07 11:33:47,911 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 29 treesize of output 28 [2019-09-07 11:33:47,912 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:33:47,920 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:33:47,921 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:33:47,921 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-09-07 11:33:47,985 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-09-07 11:33:47,986 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 23 treesize of output 22 [2019-09-07 11:33:47,986 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:33:47,996 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:33:47,996 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:33:47,997 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2019-09-07 11:33:48,097 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-09-07 11:33:48,098 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:33:48,102 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:33:48,102 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:33:48,103 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2019-09-07 11:33:48,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:33:48,179 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-07 11:33:48,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:33:48,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2019-09-07 11:33:48,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 11:33:48,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 11:33:48,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2019-09-07 11:33:48,191 INFO L87 Difference]: Start difference. First operand 74 states and 96 transitions. Second operand 20 states. [2019-09-07 11:34:07,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:34:07,670 INFO L93 Difference]: Finished difference Result 214 states and 290 transitions. [2019-09-07 11:34:07,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 11:34:07,670 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 55 [2019-09-07 11:34:07,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:34:07,673 INFO L225 Difference]: With dead ends: 214 [2019-09-07 11:34:07,673 INFO L226 Difference]: Without dead ends: 212 [2019-09-07 11:34:07,675 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 42 SyntacticMatches, 11 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=206, Invalid=982, Unknown=2, NotChecked=0, Total=1190 [2019-09-07 11:34:07,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-09-07 11:34:07,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 128. [2019-09-07 11:34:07,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-09-07 11:34:07,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 178 transitions. [2019-09-07 11:34:07,703 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 178 transitions. Word has length 55 [2019-09-07 11:34:07,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:34:07,704 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 178 transitions. [2019-09-07 11:34:07,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 11:34:07,704 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 178 transitions. [2019-09-07 11:34:07,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-07 11:34:07,709 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:34:07,709 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:34:07,709 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:34:07,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:34:07,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1312764682, now seen corresponding path program 2 times [2019-09-07 11:34:07,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:34:07,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:34:07,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:34:07,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:34:07,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:34:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:34:07,852 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-07 11:34:07,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:34:07,853 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:34:07,864 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:34:07,909 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:34:07,909 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:34:07,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-07 11:34:07,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:34:07,981 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-09-07 11:34:07,982 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:34:07,991 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:34:07,991 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:34:07,992 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2019-09-07 11:34:08,067 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:34:08,068 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 30 treesize of output 29 [2019-09-07 11:34:08,069 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:34:08,079 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:34:08,080 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:34:08,080 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:23 [2019-09-07 11:34:08,124 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:34:08,125 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 24 treesize of output 23 [2019-09-07 11:34:08,126 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:34:08,134 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:34:08,134 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:34:08,134 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:17 [2019-09-07 11:34:08,324 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-09-07 11:34:08,324 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:34:08,328 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:34:08,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-07 11:34:08,329 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:8 [2019-09-07 11:34:08,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:34:08,383 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-07 11:34:08,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:34:08,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2019-09-07 11:34:08,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 11:34:08,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 11:34:08,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2019-09-07 11:34:08,402 INFO L87 Difference]: Start difference. First operand 128 states and 178 transitions. Second operand 21 states. [2019-09-07 11:34:49,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:34:49,594 INFO L93 Difference]: Finished difference Result 339 states and 484 transitions. [2019-09-07 11:34:49,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 11:34:49,594 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 63 [2019-09-07 11:34:49,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:34:49,599 INFO L225 Difference]: With dead ends: 339 [2019-09-07 11:34:49,599 INFO L226 Difference]: Without dead ends: 337 [2019-09-07 11:34:49,600 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 48 SyntacticMatches, 10 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2019-09-07 11:34:49,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-09-07 11:34:49,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 290. [2019-09-07 11:34:49,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-09-07 11:34:49,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 413 transitions. [2019-09-07 11:34:49,646 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 413 transitions. Word has length 63 [2019-09-07 11:34:49,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:34:49,646 INFO L475 AbstractCegarLoop]: Abstraction has 290 states and 413 transitions. [2019-09-07 11:34:49,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 11:34:49,647 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 413 transitions. [2019-09-07 11:34:49,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-07 11:34:49,650 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:34:49,650 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:34:49,650 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:34:49,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:34:49,651 INFO L82 PathProgramCache]: Analyzing trace with hash -653233160, now seen corresponding path program 1 times [2019-09-07 11:34:49,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:34:49,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:34:49,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:34:49,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:34:49,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:34:49,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:34:49,870 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-07 11:34:49,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:34:49,870 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:34:49,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:34:49,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:34:49,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 11:34:49,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:34:49,959 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 16 treesize of output 12 [2019-09-07 11:34:49,960 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:34:49,967 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:34:49,968 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:34:49,969 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-09-07 11:34:50,042 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-09-07 11:34:50,042 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 29 treesize of output 28 [2019-09-07 11:34:50,043 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:34:50,051 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:34:50,052 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:34:50,052 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-09-07 11:34:50,099 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-09-07 11:34:50,100 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 23 treesize of output 22 [2019-09-07 11:34:50,101 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:34:50,108 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:34:50,108 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:34:50,109 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2019-09-07 11:34:50,246 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-09-07 11:34:50,246 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:34:50,249 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:34:50,250 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:34:50,250 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2019-09-07 11:34:50,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:34:50,306 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-07 11:34:50,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:34:50,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-09-07 11:34:50,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-07 11:34:50,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-07 11:34:50,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2019-09-07 11:34:50,311 INFO L87 Difference]: Start difference. First operand 290 states and 413 transitions. Second operand 22 states. [2019-09-07 11:35:17,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:35:17,254 INFO L93 Difference]: Finished difference Result 704 states and 999 transitions. [2019-09-07 11:35:17,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-07 11:35:17,255 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 63 [2019-09-07 11:35:17,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:35:17,261 INFO L225 Difference]: With dead ends: 704 [2019-09-07 11:35:17,262 INFO L226 Difference]: Without dead ends: 702 [2019-09-07 11:35:17,263 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 48 SyntacticMatches, 10 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 581 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=354, Invalid=1808, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 11:35:17,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2019-09-07 11:35:17,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 468. [2019-09-07 11:35:17,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2019-09-07 11:35:17,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 714 transitions. [2019-09-07 11:35:17,334 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 714 transitions. Word has length 63 [2019-09-07 11:35:17,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:35:17,335 INFO L475 AbstractCegarLoop]: Abstraction has 468 states and 714 transitions. [2019-09-07 11:35:17,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-07 11:35:17,335 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 714 transitions. [2019-09-07 11:35:17,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-07 11:35:17,338 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:35:17,338 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:35:17,338 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:35:17,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:35:17,339 INFO L82 PathProgramCache]: Analyzing trace with hash 926965847, now seen corresponding path program 3 times [2019-09-07 11:35:17,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:35:17,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:35:17,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:35:17,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:35:17,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:35:17,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:35:17,481 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-07 11:35:17,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:35:17,482 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:35:17,501 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:35:17,563 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-07 11:35:17,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:35:17,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-07 11:35:17,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:35:17,616 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-09-07 11:35:17,617 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:35:17,627 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:35:17,628 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:35:17,628 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2019-09-07 11:35:17,654 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:35:17,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2019-09-07 11:35:17,656 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:35:17,663 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:35:17,663 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:35:17,664 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:14 [2019-09-07 11:35:17,767 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-09-07 11:35:17,768 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:35:17,769 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:35:17,770 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:35:17,770 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-09-07 11:35:17,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:35:17,805 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-07 11:35:17,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:35:17,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2019-09-07 11:35:17,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 11:35:17,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 11:35:17,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2019-09-07 11:35:17,810 INFO L87 Difference]: Start difference. First operand 468 states and 714 transitions. Second operand 21 states. [2019-09-07 11:35:19,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:35:19,858 INFO L93 Difference]: Finished difference Result 1132 states and 1768 transitions. [2019-09-07 11:35:19,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 11:35:19,859 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 71 [2019-09-07 11:35:19,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:35:19,871 INFO L225 Difference]: With dead ends: 1132 [2019-09-07 11:35:19,872 INFO L226 Difference]: Without dead ends: 1130 [2019-09-07 11:35:19,874 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=874, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 11:35:19,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2019-09-07 11:35:20,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1053. [2019-09-07 11:35:20,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1053 states. [2019-09-07 11:35:20,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1656 transitions. [2019-09-07 11:35:20,012 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1656 transitions. Word has length 71 [2019-09-07 11:35:20,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:35:20,013 INFO L475 AbstractCegarLoop]: Abstraction has 1053 states and 1656 transitions. [2019-09-07 11:35:20,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 11:35:20,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1656 transitions. [2019-09-07 11:35:20,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-07 11:35:20,019 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:35:20,019 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:35:20,019 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:35:20,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:35:20,020 INFO L82 PathProgramCache]: Analyzing trace with hash -918401319, now seen corresponding path program 1 times [2019-09-07 11:35:20,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:35:20,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:35:20,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:35:20,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:35:20,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:35:20,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:35:20,239 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-07 11:35:20,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:35:20,242 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) [2019-09-07 11:35:20,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:35:20,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:35:20,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-07 11:35:20,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:35:20,340 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 16 treesize of output 12 [2019-09-07 11:35:20,341 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:35:20,352 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:35:20,353 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:35:20,353 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-09-07 11:35:20,431 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-09-07 11:35:20,432 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 23 treesize of output 22 [2019-09-07 11:35:20,433 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:35:20,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:35:20,442 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:35:20,442 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2019-09-07 11:35:20,660 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-09-07 11:35:20,661 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:35:20,664 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:35:20,664 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:35:20,664 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2019-09-07 11:35:20,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:35:20,726 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-07 11:35:20,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:35:20,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2019-09-07 11:35:20,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-07 11:35:20,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-07 11:35:20,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2019-09-07 11:35:20,732 INFO L87 Difference]: Start difference. First operand 1053 states and 1656 transitions. Second operand 24 states. [2019-09-07 11:36:04,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:36:04,762 INFO L93 Difference]: Finished difference Result 2059 states and 3190 transitions. [2019-09-07 11:36:04,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-07 11:36:04,763 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 71 [2019-09-07 11:36:04,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:36:04,783 INFO L225 Difference]: With dead ends: 2059 [2019-09-07 11:36:04,783 INFO L226 Difference]: Without dead ends: 2057 [2019-09-07 11:36:04,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 55 SyntacticMatches, 9 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1121 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=606, Invalid=3176, Unknown=0, NotChecked=0, Total=3782 [2019-09-07 11:36:04,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2057 states. [2019-09-07 11:36:04,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2057 to 1088. [2019-09-07 11:36:04,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1088 states. [2019-09-07 11:36:04,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1712 transitions. [2019-09-07 11:36:04,966 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1712 transitions. Word has length 71 [2019-09-07 11:36:04,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:36:04,966 INFO L475 AbstractCegarLoop]: Abstraction has 1088 states and 1712 transitions. [2019-09-07 11:36:04,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-07 11:36:04,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1712 transitions. [2019-09-07 11:36:04,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-07 11:36:04,970 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:36:04,970 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:36:04,970 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:36:04,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:36:04,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1198195384, now seen corresponding path program 4 times [2019-09-07 11:36:04,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:36:04,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:36:04,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:36:04,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:36:04,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:36:04,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:36:05,119 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 8 proven. 33 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-09-07 11:36:05,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:36:05,120 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:36:05,133 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:36:05,172 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:36:05,172 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:36:05,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-07 11:36:05,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:36:05,223 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-09-07 11:36:05,223 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:36:05,233 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:36:05,233 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:36:05,233 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-09-07 11:36:05,523 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-09-07 11:36:05,523 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:36:05,527 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:36:05,527 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:36:05,527 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:8 [2019-09-07 11:36:05,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:36:05,589 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:36:05,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:36:05,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2019-09-07 11:36:05,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-07 11:36:05,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-07 11:36:05,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2019-09-07 11:36:05,596 INFO L87 Difference]: Start difference. First operand 1088 states and 1712 transitions. Second operand 25 states. [2019-09-07 11:37:21,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:37:21,266 INFO L93 Difference]: Finished difference Result 1254 states and 1929 transitions. [2019-09-07 11:37:21,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-07 11:37:21,266 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 79 [2019-09-07 11:37:21,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:37:21,274 INFO L225 Difference]: With dead ends: 1254 [2019-09-07 11:37:21,274 INFO L226 Difference]: Without dead ends: 1252 [2019-09-07 11:37:21,277 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 64 SyntacticMatches, 7 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 668 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=302, Invalid=2050, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 11:37:21,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2019-09-07 11:37:21,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1183. [2019-09-07 11:37:21,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2019-09-07 11:37:21,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1824 transitions. [2019-09-07 11:37:21,393 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1824 transitions. Word has length 79 [2019-09-07 11:37:21,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:37:21,393 INFO L475 AbstractCegarLoop]: Abstraction has 1183 states and 1824 transitions. [2019-09-07 11:37:21,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-07 11:37:21,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1824 transitions. [2019-09-07 11:37:21,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-07 11:37:21,397 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:37:21,397 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:37:21,398 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:37:21,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:37:21,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1621842106, now seen corresponding path program 1 times [2019-09-07 11:37:21,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:37:21,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:37:21,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:37:21,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:37:21,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:37:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:37:21,623 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 8 proven. 33 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-09-07 11:37:21,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:37:21,624 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:37:21,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:37:21,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:37:21,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-07 11:37:21,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:37:21,711 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 13 treesize of output 9 [2019-09-07 11:37:21,711 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:37:21,717 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:37:21,718 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:37:21,718 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-09-07 11:37:22,007 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-09-07 11:37:22,008 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:37:22,011 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:37:22,012 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:37:22,012 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2019-09-07 11:37:22,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:37:22,098 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-09-07 11:37:22,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:37:22,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2019-09-07 11:37:22,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-07 11:37:22,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-07 11:37:22,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2019-09-07 11:37:22,103 INFO L87 Difference]: Start difference. First operand 1183 states and 1824 transitions. Second operand 26 states. [2019-09-07 11:38:35,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:38:35,992 INFO L93 Difference]: Finished difference Result 4343 states and 6872 transitions. [2019-09-07 11:38:35,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-07 11:38:35,992 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 79 [2019-09-07 11:38:35,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:38:36,016 INFO L225 Difference]: With dead ends: 4343 [2019-09-07 11:38:36,016 INFO L226 Difference]: Without dead ends: 4341 [2019-09-07 11:38:36,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 62 SyntacticMatches, 7 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1466 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=776, Invalid=4480, Unknown=0, NotChecked=0, Total=5256 [2019-09-07 11:38:36,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4341 states. [2019-09-07 11:38:36,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4341 to 2683. [2019-09-07 11:38:36,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2683 states. [2019-09-07 11:38:36,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2683 states to 2683 states and 4265 transitions. [2019-09-07 11:38:36,441 INFO L78 Accepts]: Start accepts. Automaton has 2683 states and 4265 transitions. Word has length 79 [2019-09-07 11:38:36,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:38:36,441 INFO L475 AbstractCegarLoop]: Abstraction has 2683 states and 4265 transitions. [2019-09-07 11:38:36,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-07 11:38:36,442 INFO L276 IsEmpty]: Start isEmpty. Operand 2683 states and 4265 transitions. [2019-09-07 11:38:36,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-07 11:38:36,447 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:38:36,448 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:38:36,448 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:38:36,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:38:36,448 INFO L82 PathProgramCache]: Analyzing trace with hash 956169405, now seen corresponding path program 1 times [2019-09-07 11:38:36,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:38:36,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:38:36,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:38:36,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:38:36,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:38:36,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:38:36,642 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-09-07 11:38:36,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:38:36,643 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:38:36,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:38:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:38:36,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-07 11:38:36,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:38:36,709 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-09-07 11:38:36,709 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:38:36,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:38:36,716 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:38:36,717 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-09-07 11:38:36,743 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-09-07 11:38:36,743 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 30 treesize of output 29 [2019-09-07 11:38:36,744 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:38:36,753 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:38:36,754 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:38:36,754 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:17 [2019-09-07 11:38:36,770 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-09-07 11:38:36,770 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 30 treesize of output 29 [2019-09-07 11:38:36,771 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:38:36,777 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:38:36,777 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:38:36,778 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:17 [2019-09-07 11:38:36,790 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-09-07 11:38:36,791 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 30 treesize of output 29 [2019-09-07 11:38:36,791 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:38:36,797 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:38:36,798 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:38:36,798 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:17 [2019-09-07 11:38:36,824 INFO L341 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2019-09-07 11:38:36,824 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 27 treesize of output 26 [2019-09-07 11:38:36,825 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:38:36,832 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:38:36,833 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:38:36,833 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:14 [2019-09-07 11:38:36,849 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:38:36,850 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 27 treesize of output 58 [2019-09-07 11:38:36,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:38:36,851 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:38:36,868 INFO L567 ElimStorePlain]: treesize reduction 32, result has 44.8 percent of original size [2019-09-07 11:38:36,868 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:38:36,869 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:14 [2019-09-07 11:38:36,883 INFO L341 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2019-09-07 11:38:36,883 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 27 treesize of output 26 [2019-09-07 11:38:36,884 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:38:36,892 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:38:36,892 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:38:36,893 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:14 [2019-09-07 11:38:36,904 INFO L341 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2019-09-07 11:38:36,904 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 27 treesize of output 26 [2019-09-07 11:38:36,905 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:38:36,911 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:38:36,912 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:38:36,912 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:14 [2019-09-07 11:38:36,926 INFO L341 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2019-09-07 11:38:36,927 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 27 treesize of output 26 [2019-09-07 11:38:36,927 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:38:36,935 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:38:36,936 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:38:36,936 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:10 [2019-09-07 11:38:36,949 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-09-07 11:38:36,949 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:38:36,950 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:38:36,951 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:38:36,951 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:4 [2019-09-07 11:38:36,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:38:36,980 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-09-07 11:38:36,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:38:36,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 15 [2019-09-07 11:38:36,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 11:38:36,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 11:38:36,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-09-07 11:38:36,985 INFO L87 Difference]: Start difference. First operand 2683 states and 4265 transitions. Second operand 15 states. [2019-09-07 11:38:37,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:38:37,686 INFO L93 Difference]: Finished difference Result 3110 states and 4950 transitions. [2019-09-07 11:38:37,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 11:38:37,687 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 87 [2019-09-07 11:38:37,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:38:37,704 INFO L225 Difference]: With dead ends: 3110 [2019-09-07 11:38:37,705 INFO L226 Difference]: Without dead ends: 3108 [2019-09-07 11:38:37,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 91 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-09-07 11:38:37,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3108 states. [2019-09-07 11:38:38,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3108 to 2593. [2019-09-07 11:38:38,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2593 states. [2019-09-07 11:38:38,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2593 states to 2593 states and 4117 transitions. [2019-09-07 11:38:38,070 INFO L78 Accepts]: Start accepts. Automaton has 2593 states and 4117 transitions. Word has length 87 [2019-09-07 11:38:38,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:38:38,070 INFO L475 AbstractCegarLoop]: Abstraction has 2593 states and 4117 transitions. [2019-09-07 11:38:38,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 11:38:38,070 INFO L276 IsEmpty]: Start isEmpty. Operand 2593 states and 4117 transitions. [2019-09-07 11:38:38,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-07 11:38:38,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:38:38,076 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:38:38,076 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:38:38,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:38:38,076 INFO L82 PathProgramCache]: Analyzing trace with hash 163689497, now seen corresponding path program 5 times [2019-09-07 11:38:38,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:38:38,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:38:38,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:38:38,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:38:38,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:38:38,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:38:38,517 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 43 proven. 18 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-07 11:38:38,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:38:38,518 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:38:38,540 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 11:38:38,604 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-07 11:38:38,605 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:38:38,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 11:38:38,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:38:38,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:38:38,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:38:38,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:38:38,957 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 60 proven. 1 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-07 11:38:38,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:38:38,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2019-09-07 11:38:38,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-07 11:38:38,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-07 11:38:38,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=374, Unknown=0, NotChecked=0, Total=506 [2019-09-07 11:38:38,963 INFO L87 Difference]: Start difference. First operand 2593 states and 4117 transitions. Second operand 23 states. [2019-09-07 11:38:39,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:38:39,699 INFO L93 Difference]: Finished difference Result 2697 states and 4245 transitions. [2019-09-07 11:38:39,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 11:38:39,700 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 87 [2019-09-07 11:38:39,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:38:39,712 INFO L225 Difference]: With dead ends: 2697 [2019-09-07 11:38:39,713 INFO L226 Difference]: Without dead ends: 2588 [2019-09-07 11:38:39,717 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=182, Invalid=520, Unknown=0, NotChecked=0, Total=702 [2019-09-07 11:38:39,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2588 states. [2019-09-07 11:38:40,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2588 to 2546. [2019-09-07 11:38:40,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2546 states. [2019-09-07 11:38:40,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 4052 transitions. [2019-09-07 11:38:40,046 INFO L78 Accepts]: Start accepts. Automaton has 2546 states and 4052 transitions. Word has length 87 [2019-09-07 11:38:40,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:38:40,047 INFO L475 AbstractCegarLoop]: Abstraction has 2546 states and 4052 transitions. [2019-09-07 11:38:40,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-07 11:38:40,047 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states and 4052 transitions. [2019-09-07 11:38:40,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-07 11:38:40,059 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:38:40,059 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:38:40,059 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:38:40,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:38:40,060 INFO L82 PathProgramCache]: Analyzing trace with hash 191334629, now seen corresponding path program 2 times [2019-09-07 11:38:40,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:38:40,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:38:40,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:38:40,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:38:40,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:38:40,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:38:40,593 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 2 proven. 56 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2019-09-07 11:38:40,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:38:40,594 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:38:40,631 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:38:40,704 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:38:40,704 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:38:40,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-07 11:38:40,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:38:40,772 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 16 treesize of output 12 [2019-09-07 11:38:40,772 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:38:40,781 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:38:40,782 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:38:40,782 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-09-07 11:38:40,859 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:38:40,860 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-07 11:38:40,861 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:38:40,873 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:38:40,873 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:38:40,873 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:25 [2019-09-07 11:38:40,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:38:40,922 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-07 11:38:40,923 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:38:40,937 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:38:40,938 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:38:40,938 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:25 [2019-09-07 11:38:40,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:38:40,994 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-07 11:38:40,995 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:38:41,007 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:38:41,008 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:38:41,008 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:25 [2019-09-07 11:38:41,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:38:41,088 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 26 treesize of output 25 [2019-09-07 11:38:41,089 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:38:41,105 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:38:41,106 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:38:41,106 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-09-07 11:38:41,170 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:38:41,171 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 26 treesize of output 25 [2019-09-07 11:38:41,171 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:38:41,183 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:38:41,184 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:38:41,184 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-09-07 11:38:41,232 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:38:41,233 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 26 treesize of output 25 [2019-09-07 11:38:41,233 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:38:41,243 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:38:41,244 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:38:41,244 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-09-07 11:38:41,292 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:38:41,293 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 26 treesize of output 25 [2019-09-07 11:38:41,293 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:38:41,305 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:38:41,305 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:38:41,306 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-09-07 11:38:41,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:38:41,355 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 26 treesize of output 25 [2019-09-07 11:38:41,355 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:38:41,366 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:38:41,367 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:38:41,367 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-09-07 11:38:41,442 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:38:41,443 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 26 treesize of output 25 [2019-09-07 11:38:41,443 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:38:41,457 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:38:41,457 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:38:41,457 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-09-07 11:38:41,512 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:38:41,513 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 32 treesize of output 25 [2019-09-07 11:38:41,513 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:38:41,523 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:38:41,524 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:38:41,524 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:40 [2019-09-07 11:38:41,679 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:38:41,680 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:38:41,682 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:38:41,683 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:38:41,683 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 47 treesize of output 40 [2019-09-07 11:38:41,683 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:38:41,696 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:38:41,696 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:38:41,696 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:56, output treesize:40 [2019-09-07 11:38:41,788 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:38:41,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:38:41,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:38:41,793 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:38:41,793 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 47 treesize of output 40 [2019-09-07 11:38:41,794 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:38:41,811 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:38:41,812 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:38:41,812 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:56, output treesize:40 [2019-09-07 11:38:41,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:38:41,911 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:38:41,912 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:38:41,913 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:38:41,913 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 47 treesize of output 40 [2019-09-07 11:38:41,914 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:38:41,926 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:38:41,927 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-07 11:38:41,927 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:40 [2019-09-07 11:38:42,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:38:42,142 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:38:42,142 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 34 treesize of output 10 [2019-09-07 11:38:42,143 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:38:42,152 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:38:42,152 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:38:42,152 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:7 [2019-09-07 11:38:42,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:38:42,265 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 175 proven. 51 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-09-07 11:38:42,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:38:42,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 28 [2019-09-07 11:38:42,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-07 11:38:42,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-07 11:38:42,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=650, Unknown=0, NotChecked=0, Total=756 [2019-09-07 11:38:42,273 INFO L87 Difference]: Start difference. First operand 2546 states and 4052 transitions. Second operand 28 states. [2019-09-07 11:38:45,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:38:45,013 INFO L93 Difference]: Finished difference Result 3181 states and 4918 transitions. [2019-09-07 11:38:45,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-07 11:38:45,014 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 119 [2019-09-07 11:38:45,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:38:45,030 INFO L225 Difference]: With dead ends: 3181 [2019-09-07 11:38:45,031 INFO L226 Difference]: Without dead ends: 3179 [2019-09-07 11:38:45,034 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 87 SyntacticMatches, 42 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 993 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=421, Invalid=2441, Unknown=0, NotChecked=0, Total=2862 [2019-09-07 11:38:45,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3179 states. [2019-09-07 11:38:45,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3179 to 1037. [2019-09-07 11:38:45,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1037 states. [2019-09-07 11:38:45,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1588 transitions. [2019-09-07 11:38:45,262 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1588 transitions. Word has length 119 [2019-09-07 11:38:45,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:38:45,263 INFO L475 AbstractCegarLoop]: Abstraction has 1037 states and 1588 transitions. [2019-09-07 11:38:45,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-07 11:38:45,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1588 transitions. [2019-09-07 11:38:45,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-07 11:38:45,270 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:38:45,270 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 6, 6, 6, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:38:45,270 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:38:45,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:38:45,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1632186177, now seen corresponding path program 6 times [2019-09-07 11:38:45,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:38:45,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:38:45,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:38:45,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:38:45,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:38:45,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:38:45,548 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 10 proven. 69 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2019-09-07 11:38:45,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:38:45,549 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:38:45,563 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 11:38:45,649 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-07 11:38:45,649 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:38:45,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-07 11:38:45,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:38:45,733 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-09-07 11:38:45,733 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:38:45,746 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:38:45,746 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:38:45,747 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2019-09-07 11:38:45,848 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:38:45,849 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 30 treesize of output 29 [2019-09-07 11:38:45,849 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:38:45,859 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:38:45,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-07 11:38:45,860 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:23 [2019-09-07 11:38:45,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:38:45,917 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 30 treesize of output 29 [2019-09-07 11:38:45,917 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:38:45,929 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:38:45,929 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:38:45,929 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:23 [2019-09-07 11:38:45,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:38:45,986 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 30 treesize of output 29 [2019-09-07 11:38:45,986 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:38:45,994 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:38:45,995 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:38:45,995 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:23 [2019-09-07 11:38:46,044 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:38:46,044 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 24 treesize of output 23 [2019-09-07 11:38:46,045 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:38:46,052 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:38:46,053 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:38:46,053 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:17 [2019-09-07 11:38:46,448 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-09-07 11:38:46,448 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:38:46,451 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:38:46,452 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:38:46,452 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:8 [2019-09-07 11:38:46,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:38:46,577 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 72 proven. 79 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-09-07 11:38:46,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:38:46,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 29 [2019-09-07 11:38:46,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-07 11:38:46,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-07 11:38:46,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=708, Unknown=0, NotChecked=0, Total=812 [2019-09-07 11:38:46,583 INFO L87 Difference]: Start difference. First operand 1037 states and 1588 transitions. Second operand 29 states. [2019-09-07 11:45:28,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:45:28,159 INFO L93 Difference]: Finished difference Result 4633 states and 7342 transitions. [2019-09-07 11:45:28,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-09-07 11:45:28,159 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 119 [2019-09-07 11:45:28,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:45:28,181 INFO L225 Difference]: With dead ends: 4633 [2019-09-07 11:45:28,182 INFO L226 Difference]: Without dead ends: 4631 [2019-09-07 11:45:28,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 93 SyntacticMatches, 22 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4276 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1286, Invalid=10270, Unknown=0, NotChecked=0, Total=11556 [2019-09-07 11:45:28,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4631 states. [2019-09-07 11:45:28,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4631 to 1892. [2019-09-07 11:45:28,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1892 states. [2019-09-07 11:45:28,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1892 states and 2949 transitions. [2019-09-07 11:45:28,469 INFO L78 Accepts]: Start accepts. Automaton has 1892 states and 2949 transitions. Word has length 119 [2019-09-07 11:45:28,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:45:28,469 INFO L475 AbstractCegarLoop]: Abstraction has 1892 states and 2949 transitions. [2019-09-07 11:45:28,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-07 11:45:28,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2949 transitions. [2019-09-07 11:45:28,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-07 11:45:28,476 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:45:28,476 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 6, 6, 6, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:45:28,476 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:45:28,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:45:28,476 INFO L82 PathProgramCache]: Analyzing trace with hash 751738561, now seen corresponding path program 1 times [2019-09-07 11:45:28,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:45:28,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:45:28,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:45:28,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:45:28,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:45:28,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:45:28,825 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 10 proven. 69 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2019-09-07 11:45:28,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:45:28,826 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:45:28,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:45:28,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:45:28,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-07 11:45:28,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:45:28,962 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 16 treesize of output 12 [2019-09-07 11:45:28,962 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:45:28,968 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:45:28,968 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:45:28,969 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-09-07 11:45:29,058 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-09-07 11:45:29,058 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 29 treesize of output 28 [2019-09-07 11:45:29,059 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:45:29,066 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:45:29,067 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:45:29,067 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-09-07 11:45:29,129 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-09-07 11:45:29,130 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 29 treesize of output 28 [2019-09-07 11:45:29,130 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:45:29,137 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:45:29,138 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:45:29,138 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-09-07 11:45:29,200 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-09-07 11:45:29,200 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 29 treesize of output 28 [2019-09-07 11:45:29,201 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:45:29,207 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:45:29,208 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:45:29,208 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-09-07 11:45:29,263 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-09-07 11:45:29,264 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 23 treesize of output 22 [2019-09-07 11:45:29,264 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:45:29,270 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:45:29,270 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:45:29,270 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2019-09-07 11:45:29,716 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-09-07 11:45:29,716 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:45:29,724 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:45:29,724 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:45:29,724 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2019-09-07 11:45:29,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:45:29,809 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 72 proven. 79 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-09-07 11:45:29,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:45:29,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2019-09-07 11:45:29,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-07 11:45:29,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-07 11:45:29,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=776, Unknown=0, NotChecked=0, Total=870 [2019-09-07 11:45:29,814 INFO L87 Difference]: Start difference. First operand 1892 states and 2949 transitions. Second operand 30 states. [2019-09-07 11:46:35,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:46:35,599 INFO L93 Difference]: Finished difference Result 3868 states and 6004 transitions. [2019-09-07 11:46:35,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-07 11:46:35,600 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 119 [2019-09-07 11:46:35,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:46:35,623 INFO L225 Difference]: With dead ends: 3868 [2019-09-07 11:46:35,623 INFO L226 Difference]: Without dead ends: 3866 [2019-09-07 11:46:35,629 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 93 SyntacticMatches, 22 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2501 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1039, Invalid=6793, Unknown=0, NotChecked=0, Total=7832 [2019-09-07 11:46:35,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3866 states. [2019-09-07 11:46:36,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3866 to 2669. [2019-09-07 11:46:36,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2669 states. [2019-09-07 11:46:36,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2669 states to 2669 states and 4095 transitions. [2019-09-07 11:46:36,056 INFO L78 Accepts]: Start accepts. Automaton has 2669 states and 4095 transitions. Word has length 119 [2019-09-07 11:46:36,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:46:36,056 INFO L475 AbstractCegarLoop]: Abstraction has 2669 states and 4095 transitions. [2019-09-07 11:46:36,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-07 11:46:36,056 INFO L276 IsEmpty]: Start isEmpty. Operand 2669 states and 4095 transitions. [2019-09-07 11:46:36,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-07 11:46:36,063 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:46:36,064 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 7, 7, 7, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:46:36,064 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:46:36,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:46:36,064 INFO L82 PathProgramCache]: Analyzing trace with hash 87984928, now seen corresponding path program 7 times [2019-09-07 11:46:36,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:46:36,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:46:36,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:46:36,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:46:36,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:46:36,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:46:36,337 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 12 proven. 91 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2019-09-07 11:46:36,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:46:36,338 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:46:36,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:46:36,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:46:36,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-07 11:46:36,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:46:36,430 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-09-07 11:46:36,431 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:46:36,438 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:46:36,438 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:46:36,439 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2019-09-07 11:46:36,452 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-09-07 11:46:36,452 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 30 treesize of output 29 [2019-09-07 11:46:36,453 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:46:36,460 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:46:36,461 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:46:36,461 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:20 [2019-09-07 11:46:36,472 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-09-07 11:46:36,473 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 30 treesize of output 29 [2019-09-07 11:46:36,473 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:46:36,481 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:46:36,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-07 11:46:36,482 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:20 [2019-09-07 11:46:36,496 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-09-07 11:46:36,496 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 30 treesize of output 29 [2019-09-07 11:46:36,497 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:46:36,505 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:46:36,505 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-07 11:46:36,505 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:20 [2019-09-07 11:46:36,658 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:46:36,658 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 25 treesize of output 25 [2019-09-07 11:46:36,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:46:36,659 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-07 11:46:36,671 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-09-07 11:46:36,671 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-07 11:46:36,671 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:4 [2019-09-07 11:46:36,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:46:36,723 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 12 proven. 91 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2019-09-07 11:46:36,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:46:36,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 23 [2019-09-07 11:46:36,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-07 11:46:36,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-07 11:46:36,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2019-09-07 11:46:36,727 INFO L87 Difference]: Start difference. First operand 2669 states and 4095 transitions. Second operand 23 states. [2019-09-07 11:46:54,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:46:54,878 INFO L93 Difference]: Finished difference Result 13078 states and 20937 transitions. [2019-09-07 11:46:54,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2019-09-07 11:46:54,879 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 127 [2019-09-07 11:46:54,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:46:54,915 INFO L225 Difference]: With dead ends: 13078 [2019-09-07 11:46:54,915 INFO L226 Difference]: Without dead ends: 13076 [2019-09-07 11:46:54,925 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 121 SyntacticMatches, 6 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10695 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2086, Invalid=24646, Unknown=0, NotChecked=0, Total=26732 [2019-09-07 11:46:54,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13076 states. [2019-09-07 11:46:56,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13076 to 5561. [2019-09-07 11:46:56,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5561 states. [2019-09-07 11:46:56,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5561 states to 5561 states and 8719 transitions. [2019-09-07 11:46:56,017 INFO L78 Accepts]: Start accepts. Automaton has 5561 states and 8719 transitions. Word has length 127 [2019-09-07 11:46:56,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:46:56,017 INFO L475 AbstractCegarLoop]: Abstraction has 5561 states and 8719 transitions. [2019-09-07 11:46:56,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-07 11:46:56,017 INFO L276 IsEmpty]: Start isEmpty. Operand 5561 states and 8719 transitions. [2019-09-07 11:46:56,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-07 11:46:56,028 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:46:56,028 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 7, 7, 7, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:46:56,029 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:46:56,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:46:56,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1822089378, now seen corresponding path program 3 times [2019-09-07 11:46:56,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:46:56,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:46:56,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:46:56,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:46:56,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:46:56,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:46:56,348 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 12 proven. 91 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2019-09-07 11:46:56,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:46:56,348 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:46:56,359 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 11:46:56,445 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-07 11:46:56,445 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:46:56,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-07 11:46:56,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:46:56,539 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 16 treesize of output 12 [2019-09-07 11:46:56,540 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:46:56,548 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:46:56,549 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:46:56,549 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-09-07 11:46:56,616 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:46:56,617 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-07 11:46:56,617 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:46:56,628 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:46:56,628 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:46:56,628 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-09-07 11:46:56,700 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:46:56,704 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-07 11:46:56,704 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:46:56,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:46:56,715 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:46:56,715 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-09-07 11:46:56,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:46:56,794 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-07 11:46:56,795 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:46:56,812 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:46:56,813 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:46:56,813 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 [2019-09-07 11:46:57,576 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-07 11:46:57,577 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:46:57,589 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:46:57,589 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:46:57,589 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-09-07 11:46:57,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:46:57,722 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 63 proven. 103 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-09-07 11:46:57,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:46:57,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2019-09-07 11:46:57,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-07 11:46:57,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-07 11:46:57,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=890, Unknown=0, NotChecked=0, Total=992 [2019-09-07 11:46:57,737 INFO L87 Difference]: Start difference. First operand 5561 states and 8719 transitions. Second operand 32 states. [2019-09-07 11:47:19,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:47:19,092 INFO L93 Difference]: Finished difference Result 9839 states and 15405 transitions. [2019-09-07 11:47:19,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-09-07 11:47:19,092 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 127 [2019-09-07 11:47:19,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:47:19,119 INFO L225 Difference]: With dead ends: 9839 [2019-09-07 11:47:19,119 INFO L226 Difference]: Without dead ends: 9837 [2019-09-07 11:47:19,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 99 SyntacticMatches, 21 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2767 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1081, Invalid=7475, Unknown=0, NotChecked=0, Total=8556 [2019-09-07 11:47:19,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9837 states. [2019-09-07 11:47:20,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9837 to 5676. [2019-09-07 11:47:20,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5676 states. [2019-09-07 11:47:20,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5676 states to 5676 states and 8771 transitions. [2019-09-07 11:47:20,285 INFO L78 Accepts]: Start accepts. Automaton has 5676 states and 8771 transitions. Word has length 127 [2019-09-07 11:47:20,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:47:20,286 INFO L475 AbstractCegarLoop]: Abstraction has 5676 states and 8771 transitions. [2019-09-07 11:47:20,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-07 11:47:20,286 INFO L276 IsEmpty]: Start isEmpty. Operand 5676 states and 8771 transitions. [2019-09-07 11:47:20,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-07 11:47:20,294 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:47:20,294 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 8, 8, 8, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:47:20,295 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:47:20,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:47:20,295 INFO L82 PathProgramCache]: Analyzing trace with hash -614837119, now seen corresponding path program 8 times [2019-09-07 11:47:20,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:47:20,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:47:20,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:47:20,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:47:20,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:47:20,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:47:20,539 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 14 proven. 117 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2019-09-07 11:47:20,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:47:20,539 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:47:20,605 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:47:20,656 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:47:20,656 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:47:20,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-07 11:47:20,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:47:20,724 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-09-07 11:47:20,724 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:47:20,732 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:47:20,732 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:47:20,733 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2019-09-07 11:47:20,766 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:47:20,767 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 30 treesize of output 29 [2019-09-07 11:47:20,767 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:47:20,774 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:47:20,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-07 11:47:20,775 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:20 [2019-09-07 11:47:20,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:47:20,786 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 24 treesize of output 23 [2019-09-07 11:47:20,786 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:47:20,792 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:47:20,793 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:47:20,793 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:14 [2019-09-07 11:47:21,119 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-09-07 11:47:21,120 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:47:21,122 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:47:21,122 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:47:21,122 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-09-07 11:47:21,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:21,248 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 14 proven. 117 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (19)] Exception during sending of exit command (exit): Stream closed [2019-09-07 11:47:21,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:47:21,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2019-09-07 11:47:21,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-07 11:47:21,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-07 11:47:21,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=822, Unknown=0, NotChecked=0, Total=930 [2019-09-07 11:47:21,266 INFO L87 Difference]: Start difference. First operand 5676 states and 8771 transitions. Second operand 31 states.