java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 11:14:38,949 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 11:14:38,951 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 11:14:38,967 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 11:14:38,968 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 11:14:38,969 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 11:14:38,971 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 11:14:38,980 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 11:14:38,984 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 11:14:38,987 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 11:14:38,989 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 11:14:38,991 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 11:14:38,992 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 11:14:38,993 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 11:14:38,995 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 11:14:38,997 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 11:14:38,998 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 11:14:39,000 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 11:14:39,002 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 11:14:39,007 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 11:14:39,010 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 11:14:39,011 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 11:14:39,012 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 11:14:39,013 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 11:14:39,015 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 11:14:39,016 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 11:14:39,016 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 11:14:39,017 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 11:14:39,019 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 11:14:39,021 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 11:14:39,021 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 11:14:39,022 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 11:14:39,022 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 11:14:39,023 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 11:14:39,025 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 11:14:39,025 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 11:14:39,026 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 11:14:39,026 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 11:14:39,026 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 11:14:39,028 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 11:14:39,030 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 11:14:39,032 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-10-02 11:14:39,056 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 11:14:39,057 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 11:14:39,058 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 11:14:39,058 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 11:14:39,058 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 11:14:39,059 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 11:14:39,059 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 11:14:39,059 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 11:14:39,059 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 11:14:39,059 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 11:14:39,060 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 11:14:39,060 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 11:14:39,060 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 11:14:39,060 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 11:14:39,060 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 11:14:39,061 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 11:14:39,061 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 11:14:39,061 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 11:14:39,061 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 11:14:39,061 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 11:14:39,062 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 11:14:39,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:14:39,062 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 11:14:39,062 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 11:14:39,062 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 11:14:39,063 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 11:14:39,063 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 11:14:39,063 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 11:14:39,064 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 11:14:39,108 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 11:14:39,120 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 11:14:39,123 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 11:14:39,124 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 11:14:39,125 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 11:14:39,125 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_2.i [2019-10-02 11:14:39,182 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/991f384aa/2fffe337d41b441b8dd76831bbd81c5c/FLAG3d11bdd06 [2019-10-02 11:14:39,530 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 11:14:39,531 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_2.i [2019-10-02 11:14:39,537 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/991f384aa/2fffe337d41b441b8dd76831bbd81c5c/FLAG3d11bdd06 [2019-10-02 11:14:39,917 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/991f384aa/2fffe337d41b441b8dd76831bbd81c5c [2019-10-02 11:14:39,929 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 11:14:39,931 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 11:14:39,931 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 11:14:39,932 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 11:14:39,935 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 11:14:39,936 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:14:39" (1/1) ... [2019-10-02 11:14:39,939 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7664837c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:14:39, skipping insertion in model container [2019-10-02 11:14:39,939 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:14:39" (1/1) ... [2019-10-02 11:14:39,946 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 11:14:39,964 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 11:14:40,183 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:14:40,187 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 11:14:40,208 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:14:40,225 INFO L192 MainTranslator]: Completed translation [2019-10-02 11:14:40,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:14:40 WrapperNode [2019-10-02 11:14:40,225 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 11:14:40,226 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 11:14:40,226 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 11:14:40,226 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 11:14:40,322 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:14:40" (1/1) ... [2019-10-02 11:14:40,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:14:40" (1/1) ... [2019-10-02 11:14:40,330 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:14:40" (1/1) ... [2019-10-02 11:14:40,331 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:14:40" (1/1) ... [2019-10-02 11:14:40,336 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:14:40" (1/1) ... [2019-10-02 11:14:40,341 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:14:40" (1/1) ... [2019-10-02 11:14:40,342 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:14:40" (1/1) ... [2019-10-02 11:14:40,344 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 11:14:40,344 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 11:14:40,345 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 11:14:40,345 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 11:14:40,345 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:14:40" (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-10-02 11:14:40,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 11:14:40,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 11:14:40,403 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-02 11:14:40,404 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 11:14:40,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 11:14:40,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-02 11:14:40,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-02 11:14:40,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-10-02 11:14:40,404 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 11:14:40,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 11:14:40,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 11:14:40,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 11:14:40,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 11:14:40,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 11:14:40,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 11:14:40,622 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 11:14:40,622 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-02 11:14:40,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:14:40 BoogieIcfgContainer [2019-10-02 11:14:40,624 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 11:14:40,625 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 11:14:40,625 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 11:14:40,628 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 11:14:40,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:14:39" (1/3) ... [2019-10-02 11:14:40,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c29b1f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:14:40, skipping insertion in model container [2019-10-02 11:14:40,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:14:40" (2/3) ... [2019-10-02 11:14:40,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c29b1f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:14:40, skipping insertion in model container [2019-10-02 11:14:40,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:14:40" (3/3) ... [2019-10-02 11:14:40,632 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_2.i [2019-10-02 11:14:40,645 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 11:14:40,653 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 11:14:40,670 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 11:14:40,704 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 11:14:40,704 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 11:14:40,705 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 11:14:40,705 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 11:14:40,705 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 11:14:40,705 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 11:14:40,705 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 11:14:40,705 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 11:14:40,706 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 11:14:40,725 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-10-02 11:14:40,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-02 11:14:40,731 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:14:40,731 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:14:40,733 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:14:40,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:14:40,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1821336840, now seen corresponding path program 1 times [2019-10-02 11:14:40,739 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:14:40,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:14:40,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:14:40,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:14:40,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:14:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:14:40,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:14:40,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:14:40,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 11:14:40,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 11:14:40,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 11:14:40,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 11:14:40,904 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2019-10-02 11:14:40,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:14:40,923 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2019-10-02 11:14:40,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 11:14:40,925 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-10-02 11:14:40,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:14:40,933 INFO L225 Difference]: With dead ends: 40 [2019-10-02 11:14:40,933 INFO L226 Difference]: Without dead ends: 19 [2019-10-02 11:14:40,936 INFO L640 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-10-02 11:14:40,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-10-02 11:14:40,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-10-02 11:14:40,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-02 11:14:40,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-10-02 11:14:40,974 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 13 [2019-10-02 11:14:40,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:14:40,975 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-10-02 11:14:40,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 11:14:40,975 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-10-02 11:14:40,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-02 11:14:40,976 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:14:40,976 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:14:40,977 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:14:40,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:14:40,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1443575666, now seen corresponding path program 1 times [2019-10-02 11:14:40,977 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:14:40,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:14:40,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:14:40,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:14:40,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:14:41,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:14:41,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:14:41,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:14:41,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:14:41,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:14:41,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:14:41,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:14:41,067 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 3 states. [2019-10-02 11:14:41,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:14:41,122 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2019-10-02 11:14:41,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:14:41,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-02 11:14:41,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:14:41,125 INFO L225 Difference]: With dead ends: 36 [2019-10-02 11:14:41,126 INFO L226 Difference]: Without dead ends: 25 [2019-10-02 11:14:41,126 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:14:41,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-02 11:14:41,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2019-10-02 11:14:41,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-02 11:14:41,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-10-02 11:14:41,136 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 13 [2019-10-02 11:14:41,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:14:41,136 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-10-02 11:14:41,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:14:41,137 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-10-02 11:14:41,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-02 11:14:41,137 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:14:41,137 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:14:41,137 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:14:41,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:14:41,138 INFO L82 PathProgramCache]: Analyzing trace with hash 31729808, now seen corresponding path program 1 times [2019-10-02 11:14:41,138 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:14:41,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:14:41,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:14:41,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:14:41,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:14:41,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:14:41,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:14:41,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:14:41,246 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:14:41,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:14:41,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:14:41,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 11:14:41,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:14:41,376 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 11 treesize of output 7 [2019-10-02 11:14:41,377 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:14:41,387 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:14:41,389 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:14:41,390 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2019-10-02 11:14:41,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:14:41,438 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:14:41,439 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:14:41,451 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:14:41,451 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 36 [2019-10-02 11:14:41,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:14:41,455 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:14:41,483 INFO L567 ElimStorePlain]: treesize reduction 21, result has 30.0 percent of original size [2019-10-02 11:14:41,484 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:14:41,484 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:75, output treesize:9 [2019-10-02 11:14:41,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:14:41,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:14:41,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:14:41,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8] total 9 [2019-10-02 11:14:41,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:14:41,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:14:41,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:14:41,539 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 9 states. [2019-10-02 11:14:41,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:14:41,701 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2019-10-02 11:14:41,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:14:41,702 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-10-02 11:14:41,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:14:41,703 INFO L225 Difference]: With dead ends: 46 [2019-10-02 11:14:41,703 INFO L226 Difference]: Without dead ends: 35 [2019-10-02 11:14:41,704 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:14:41,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-02 11:14:41,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2019-10-02 11:14:41,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-02 11:14:41,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-10-02 11:14:41,712 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 15 [2019-10-02 11:14:41,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:14:41,712 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-10-02 11:14:41,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:14:41,713 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-10-02 11:14:41,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-02 11:14:41,714 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:14:41,714 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:14:41,714 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:14:41,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:14:41,715 INFO L82 PathProgramCache]: Analyzing trace with hash -744847771, now seen corresponding path program 1 times [2019-10-02 11:14:41,715 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:14:41,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:14:41,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:14:41,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:14:41,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:14:41,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:14:41,854 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 11:14:41,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:14:41,855 INFO L224 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-10-02 11:14:41,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:14:41,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:14:41,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-02 11:14:41,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:14:41,971 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 41 treesize of output 37 [2019-10-02 11:14:41,972 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:14:42,019 INFO L567 ElimStorePlain]: treesize reduction 54, result has 33.3 percent of original size [2019-10-02 11:14:42,020 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_7| vanished before elimination [2019-10-02 11:14:42,022 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:14:42,023 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:85, output treesize:24 [2019-10-02 11:14:42,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:14:42,249 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 11:14:42,253 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 11:14:42,254 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2019-10-02 11:14:42,255 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:14:42,262 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:14:42,262 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:14:42,289 INFO L567 ElimStorePlain]: treesize reduction 10, result has 63.0 percent of original size [2019-10-02 11:14:42,290 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:14:42,291 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:103, output treesize:17 [2019-10-02 11:14:42,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:14:42,373 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:14:42,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:14:42,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11] total 12 [2019-10-02 11:14:42,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 11:14:42,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 11:14:42,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:14:42,379 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 12 states. [2019-10-02 11:14:50,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:14:50,445 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2019-10-02 11:14:50,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 11:14:50,446 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2019-10-02 11:14:50,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:14:50,447 INFO L225 Difference]: With dead ends: 90 [2019-10-02 11:14:50,447 INFO L226 Difference]: Without dead ends: 73 [2019-10-02 11:14:50,448 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2019-10-02 11:14:50,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-10-02 11:14:50,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 41. [2019-10-02 11:14:50,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-02 11:14:50,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2019-10-02 11:14:50,459 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 25 [2019-10-02 11:14:50,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:14:50,460 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2019-10-02 11:14:50,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 11:14:50,460 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2019-10-02 11:14:50,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-02 11:14:50,461 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:14:50,461 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:14:50,462 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:14:50,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:14:50,462 INFO L82 PathProgramCache]: Analyzing trace with hash -259891423, now seen corresponding path program 2 times [2019-10-02 11:14:50,462 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:14:50,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:14:50,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:14:50,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:14:50,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:14:50,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:14:50,618 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 11:14:50,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:14:50,620 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 11:14:50,644 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:14:50,672 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:14:50,673 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:14:50,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-02 11:14:50,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:14:50,723 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:14:50,724 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:14:50,762 INFO L567 ElimStorePlain]: treesize reduction 10, result has 75.6 percent of original size [2019-10-02 11:14:50,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 17 treesize of output 13 [2019-10-02 11:14:50,768 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:14:50,781 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:14:50,783 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:14:50,783 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:85, output treesize:24 [2019-10-02 11:14:50,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:14:50,832 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:14:50,833 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:14:50,856 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:14:50,857 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 58 treesize of output 103 [2019-10-02 11:14:50,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:14:50,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:14:50,860 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:14:50,912 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-10-02 11:14:50,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:14:50,916 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-02 11:14:50,917 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-10-02 11:14:50,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:14:50,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:14:50,995 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:14:50,996 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:14:51,020 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:14:51,021 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 58 treesize of output 103 [2019-10-02 11:14:51,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:14:51,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:14:51,026 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:14:51,091 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-10-02 11:14:51,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:14:51,095 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-02 11:14:51,095 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-10-02 11:14:51,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:14:53,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:14:53,341 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:14:53,341 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:14:53,350 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:14:53,350 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 50 treesize of output 50 [2019-10-02 11:14:53,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:14:53,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:14:53,353 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:14:53,380 INFO L567 ElimStorePlain]: treesize reduction 27, result has 42.6 percent of original size [2019-10-02 11:14:53,382 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:14:53,382 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:103, output treesize:17 [2019-10-02 11:14:53,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:14:53,459 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-02 11:14:53,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:14:53,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12] total 15 [2019-10-02 11:14:53,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 11:14:53,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 11:14:53,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=162, Unknown=1, NotChecked=0, Total=210 [2019-10-02 11:14:53,464 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 15 states. [2019-10-02 11:15:00,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:15:00,779 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2019-10-02 11:15:00,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 11:15:00,780 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2019-10-02 11:15:00,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:15:00,781 INFO L225 Difference]: With dead ends: 89 [2019-10-02 11:15:00,781 INFO L226 Difference]: Without dead ends: 63 [2019-10-02 11:15:00,782 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=88, Invalid=331, Unknown=1, NotChecked=0, Total=420 [2019-10-02 11:15:00,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-02 11:15:00,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 42. [2019-10-02 11:15:00,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-02 11:15:00,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-10-02 11:15:00,792 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 29 [2019-10-02 11:15:00,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:15:00,793 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-10-02 11:15:00,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 11:15:00,793 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2019-10-02 11:15:00,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-02 11:15:00,794 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:15:00,794 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:15:00,795 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:15:00,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:15:00,795 INFO L82 PathProgramCache]: Analyzing trace with hash -881332362, now seen corresponding path program 3 times [2019-10-02 11:15:00,795 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:15:00,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:15:00,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:15:00,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:15:00,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:15:00,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:15:00,939 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 11:15:00,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:15:00,940 INFO L224 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-10-02 11:15:00,957 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 11:15:01,049 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-02 11:15:01,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:15:01,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 38 conjunts are in the unsatisfiable core [2019-10-02 11:15:01,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:15:01,083 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 41 treesize of output 37 [2019-10-02 11:15:01,083 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:01,114 INFO L567 ElimStorePlain]: treesize reduction 54, result has 33.3 percent of original size [2019-10-02 11:15:01,115 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_11| vanished before elimination [2019-10-02 11:15:01,116 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:15:01,117 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:85, output treesize:24 [2019-10-02 11:15:01,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:01,151 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:15:01,152 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:01,178 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:15:01,178 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 58 treesize of output 103 [2019-10-02 11:15:01,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:01,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:01,181 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:15:01,229 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-10-02 11:15:01,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:01,232 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-02 11:15:01,232 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-10-02 11:15:01,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:01,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:01,308 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:15:01,309 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 58 treesize of output 103 [2019-10-02 11:15:01,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:01,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:01,312 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:15:01,316 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:15:01,316 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:01,371 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-10-02 11:15:01,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:01,374 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-02 11:15:01,375 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:119, output treesize:65 [2019-10-02 11:15:01,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:02,160 WARN L191 SmtUtils]: Spent 751.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-10-02 11:15:02,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:04,883 WARN L191 SmtUtils]: Spent 1.74 s on a formula simplification that was a NOOP. DAG size: 37 [2019-10-02 11:15:07,830 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-10-02 11:15:14,731 WARN L838 $PredicateComparison]: unable to prove that (and (= 1 c_main_~index~0) (exists ((v_prenex_12 Int)) (let ((.cse0 (mod (+ v_prenex_12 4294967295) 4294967296))) (and (< .cse0 (mod (select (select |c_#memory_int| |c_main_~#array~0.base|) (+ (* 4 .cse0) |c_main_~#array~0.offset|)) 4294967296)) (<= 10000 (mod v_prenex_12 4294967296)) (< .cse0 10000)))) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#array~0.offset_BEFORE_CALL_3| Int) (|v_main_~#array~0.base_BEFORE_CALL_3| Int)) (let ((.cse1 (mod (+ v_prenex_15 4294967295) 4294967296)) (.cse2 (select |c_#memory_int| |v_main_~#array~0.base_BEFORE_CALL_3|))) (and (< .cse1 10000) (<= 10000 (mod v_prenex_15 4294967296)) (<= v_prenex_16 2) (< .cse1 (mod (select .cse2 (+ |v_main_~#array~0.offset_BEFORE_CALL_3| (* 4 .cse1))) 4294967296)) (let ((.cse3 (mod v_prenex_16 4294967296))) (< .cse3 (mod (select .cse2 (+ |v_main_~#array~0.offset_BEFORE_CALL_3| (* 4 .cse3))) 4294967296))) (<= 2 v_prenex_16)))) (exists ((v_prenex_11 Int)) (and (<= v_prenex_11 2) (let ((.cse4 (mod v_prenex_11 4294967296))) (< .cse4 (mod (select (select |c_#memory_int| |c_main_~#array~0.base|) (+ (* 4 .cse4) |c_main_~#array~0.offset|)) 4294967296))) (<= 2 v_prenex_11)))) is different from false [2019-10-02 11:15:17,465 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 36 [2019-10-02 11:15:17,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:17,476 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:15:17,477 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 11:15:17,483 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 11:15:17,485 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 51 [2019-10-02 11:15:17,486 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:15:17,493 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:15:17,493 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:17,559 INFO L567 ElimStorePlain]: treesize reduction 10, result has 79.2 percent of original size [2019-10-02 11:15:17,565 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:15:17,565 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:169, output treesize:17 [2019-10-02 11:15:21,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:23,440 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 6 trivial. 2 not checked. [2019-10-02 11:15:23,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:15:23,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 17] total 20 [2019-10-02 11:15:23,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 11:15:23,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 11:15:23,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=279, Unknown=3, NotChecked=34, Total=380 [2019-10-02 11:15:23,447 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 20 states. [2019-10-02 11:15:25,271 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-10-02 11:15:25,481 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 36 [2019-10-02 11:15:28,831 WARN L191 SmtUtils]: Spent 587.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-10-02 11:15:35,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:15:35,057 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2019-10-02 11:15:35,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-02 11:15:35,058 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 39 [2019-10-02 11:15:35,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:15:35,059 INFO L225 Difference]: With dead ends: 92 [2019-10-02 11:15:35,060 INFO L226 Difference]: Without dead ends: 67 [2019-10-02 11:15:35,062 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 22 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 27.7s TimeCoverageRelationStatistics Valid=182, Invalid=940, Unknown=4, NotChecked=64, Total=1190 [2019-10-02 11:15:35,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-02 11:15:35,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 52. [2019-10-02 11:15:35,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-02 11:15:35,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2019-10-02 11:15:35,072 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 39 [2019-10-02 11:15:35,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:15:35,072 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2019-10-02 11:15:35,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 11:15:35,072 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2019-10-02 11:15:35,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-02 11:15:35,074 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:15:35,074 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:15:35,074 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:15:35,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:15:35,074 INFO L82 PathProgramCache]: Analyzing trace with hash -799371957, now seen corresponding path program 4 times [2019-10-02 11:15:35,074 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:15:35,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:15:35,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:15:35,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:15:35,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:15:35,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:15:35,235 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 11:15:35,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:15:35,236 INFO L224 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-10-02 11:15:35,261 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 11:15:35,304 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 11:15:35,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:15:35,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 35 conjunts are in the unsatisfiable core [2019-10-02 11:15:35,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:15:35,332 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 41 treesize of output 37 [2019-10-02 11:15:35,332 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:35,367 INFO L567 ElimStorePlain]: treesize reduction 54, result has 33.3 percent of original size [2019-10-02 11:15:35,367 INFO L464 ElimStorePlain]: Eliminatee v_prenex_17 vanished before elimination [2019-10-02 11:15:35,368 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:15:35,368 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:85, output treesize:24 [2019-10-02 11:15:35,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:35,396 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:15:35,397 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:35,415 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:15:35,416 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 58 treesize of output 103 [2019-10-02 11:15:35,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:35,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:35,419 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:15:35,466 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-10-02 11:15:35,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:35,468 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-02 11:15:35,468 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-10-02 11:15:35,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:35,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:35,549 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:15:35,550 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 58 treesize of output 103 [2019-10-02 11:15:35,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:35,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:35,553 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:15:35,560 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:15:35,560 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:35,610 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-10-02 11:15:35,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:35,612 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-02 11:15:35,613 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-10-02 11:15:35,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:36,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:36,018 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:15:36,019 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:15:36,028 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:15:36,028 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 50 treesize of output 50 [2019-10-02 11:15:36,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:36,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:36,030 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:15:36,057 INFO L567 ElimStorePlain]: treesize reduction 27, result has 42.6 percent of original size [2019-10-02 11:15:36,058 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:15:36,059 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:103, output treesize:17 [2019-10-02 11:15:36,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:15:36,132 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 11:15:36,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:15:36,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15] total 18 [2019-10-02 11:15:36,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 11:15:36,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 11:15:36,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2019-10-02 11:15:36,138 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 18 states. [2019-10-02 11:15:45,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:15:45,642 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2019-10-02 11:15:45,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 11:15:45,642 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 49 [2019-10-02 11:15:45,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:15:45,643 INFO L225 Difference]: With dead ends: 110 [2019-10-02 11:15:45,643 INFO L226 Difference]: Without dead ends: 77 [2019-10-02 11:15:45,644 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 34 SyntacticMatches, 9 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2019-10-02 11:15:45,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-02 11:15:45,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 62. [2019-10-02 11:15:45,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-02 11:15:45,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2019-10-02 11:15:45,659 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 49 [2019-10-02 11:15:45,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:15:45,659 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2019-10-02 11:15:45,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 11:15:45,659 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2019-10-02 11:15:45,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-02 11:15:45,661 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:15:45,661 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:15:45,662 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:15:45,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:15:45,662 INFO L82 PathProgramCache]: Analyzing trace with hash 373790880, now seen corresponding path program 5 times [2019-10-02 11:15:45,662 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:15:45,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:15:45,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:15:45,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:15:45,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:15:45,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:15:45,834 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 8 proven. 49 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-02 11:15:45,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:15:45,835 INFO L224 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-10-02 11:15:45,861 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 11:16:05,966 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-10-02 11:16:05,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:16:05,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-02 11:16:05,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:16:06,005 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 41 treesize of output 37 [2019-10-02 11:16:06,006 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:16:06,060 INFO L567 ElimStorePlain]: treesize reduction 54, result has 33.3 percent of original size [2019-10-02 11:16:06,061 INFO L464 ElimStorePlain]: Eliminatee v_prenex_24 vanished before elimination [2019-10-02 11:16:06,061 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:16:06,062 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:85, output treesize:24 [2019-10-02 11:16:06,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:16:06,110 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:16:06,110 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:16:06,128 INFO L341 Elim1Store]: treesize reduction 53, result has 22.1 percent of original size [2019-10-02 11:16:06,128 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 54 [2019-10-02 11:16:06,129 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:16:06,160 INFO L567 ElimStorePlain]: treesize reduction 10, result has 80.4 percent of original size [2019-10-02 11:16:06,161 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-10-02 11:16:06,162 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:113, output treesize:28 [2019-10-02 11:16:06,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:16:06,227 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:16:06,228 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 62 treesize of output 113 [2019-10-02 11:16:06,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:16:06,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:16:06,230 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:16:06,234 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:16:06,234 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:16:06,283 INFO L567 ElimStorePlain]: treesize reduction 39, result has 65.5 percent of original size [2019-10-02 11:16:06,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:16:06,285 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-02 11:16:06,286 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:127, output treesize:71 [2019-10-02 11:16:06,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:16:06,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:16:06,878 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 47 treesize of output 27 [2019-10-02 11:16:06,878 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:16:06,881 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:16:06,881 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:16:06,896 INFO L567 ElimStorePlain]: treesize reduction 10, result has 58.3 percent of original size [2019-10-02 11:16:06,897 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:16:06,897 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:97, output treesize:14 [2019-10-02 11:16:06,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:16:07,013 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Stream closed [2019-10-02 11:16:07,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:16:07,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 18] total 21 [2019-10-02 11:16:07,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-02 11:16:07,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-02 11:16:07,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2019-10-02 11:16:07,034 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 21 states. [2019-10-02 11:16:17,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:16:17,956 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2019-10-02 11:16:17,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 11:16:17,956 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 59 [2019-10-02 11:16:17,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:16:17,958 INFO L225 Difference]: With dead ends: 128 [2019-10-02 11:16:17,958 INFO L226 Difference]: Without dead ends: 87 [2019-10-02 11:16:17,959 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 38 SyntacticMatches, 11 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2019-10-02 11:16:17,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-10-02 11:16:17,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 72. [2019-10-02 11:16:17,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-02 11:16:17,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2019-10-02 11:16:17,973 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 59 [2019-10-02 11:16:17,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:16:17,974 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2019-10-02 11:16:17,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-02 11:16:17,974 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2019-10-02 11:16:17,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-02 11:16:17,975 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:16:17,975 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:16:17,976 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:16:17,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:16:17,976 INFO L82 PathProgramCache]: Analyzing trace with hash 585396597, now seen corresponding path program 6 times [2019-10-02 11:16:17,976 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:16:17,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:16:17,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:16:17,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:16:17,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:16:18,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:16:18,155 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 10 proven. 64 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-10-02 11:16:18,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:16:18,156 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:16:18,188 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 11:16:43,370 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-10-02 11:16:43,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:16:43,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-02 11:16:43,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:16:43,448 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-02 11:16:43,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:16:43,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-02 11:16:43,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 11:16:43,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 11:16:43,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:16:43,456 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 12 states. [2019-10-02 11:16:43,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:16:43,843 INFO L93 Difference]: Finished difference Result 142 states and 148 transitions. [2019-10-02 11:16:43,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 11:16:43,843 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 69 [2019-10-02 11:16:43,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:16:43,844 INFO L225 Difference]: With dead ends: 142 [2019-10-02 11:16:43,845 INFO L226 Difference]: Without dead ends: 93 [2019-10-02 11:16:43,845 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:16:43,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-10-02 11:16:43,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 74. [2019-10-02 11:16:43,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-02 11:16:43,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2019-10-02 11:16:43,860 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 69 [2019-10-02 11:16:43,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:16:43,860 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2019-10-02 11:16:43,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 11:16:43,860 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2019-10-02 11:16:43,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-02 11:16:43,861 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:16:43,862 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:16:43,862 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:16:43,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:16:43,862 INFO L82 PathProgramCache]: Analyzing trace with hash 714043539, now seen corresponding path program 7 times [2019-10-02 11:16:43,862 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:16:43,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:16:43,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:16:43,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:16:43,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:16:43,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:16:44,054 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 10 proven. 81 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-10-02 11:16:44,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:16:44,055 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:16:44,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:16:44,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:16:44,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 46 conjunts are in the unsatisfiable core [2019-10-02 11:16:44,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:16:44,144 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:16:44,145 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:16:44,164 INFO L567 ElimStorePlain]: treesize reduction 10, result has 75.6 percent of original size [2019-10-02 11:16:44,167 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 17 treesize of output 13 [2019-10-02 11:16:44,167 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:16:44,174 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:16:44,175 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:16:44,176 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:85, output treesize:24 [2019-10-02 11:16:44,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:16:44,239 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:16:44,239 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 58 treesize of output 103 [2019-10-02 11:16:44,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:16:44,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:16:44,241 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:16:44,244 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:16:44,244 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:16:44,296 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-10-02 11:16:44,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:16:44,298 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-02 11:16:44,298 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-10-02 11:16:44,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:16:44,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:16:44,339 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:16:44,339 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:16:44,357 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:16:44,358 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 58 treesize of output 103 [2019-10-02 11:16:44,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:16:44,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:16:44,360 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:16:44,409 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-10-02 11:16:44,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:16:44,411 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-02 11:16:44,412 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-10-02 11:16:44,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:16:44,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:16:44,457 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:16:44,458 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:16:44,475 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:16:44,475 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 58 treesize of output 103 [2019-10-02 11:16:44,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:16:44,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:16:44,477 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:16:44,524 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-10-02 11:16:44,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:16:44,527 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-02 11:16:44,527 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-10-02 11:16:44,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:16:45,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:16:45,199 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 11:16:45,201 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 11:16:45,202 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2019-10-02 11:16:45,202 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:16:45,209 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:16:45,209 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:16:45,226 INFO L567 ElimStorePlain]: treesize reduction 10, result has 63.0 percent of original size [2019-10-02 11:16:45,226 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:16:45,227 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:103, output treesize:17 [2019-10-02 11:16:45,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:16:45,312 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 129 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-10-02 11:16:45,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:16:45,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 23 [2019-10-02 11:16:45,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 11:16:45,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 11:16:45,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2019-10-02 11:16:45,317 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 23 states. [2019-10-02 11:16:56,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:16:56,438 INFO L93 Difference]: Finished difference Result 152 states and 159 transitions. [2019-10-02 11:16:56,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-02 11:16:56,439 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 71 [2019-10-02 11:16:56,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:16:56,440 INFO L225 Difference]: With dead ends: 152 [2019-10-02 11:16:56,440 INFO L226 Difference]: Without dead ends: 103 [2019-10-02 11:16:56,442 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 47 SyntacticMatches, 14 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2019-10-02 11:16:56,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-10-02 11:16:56,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 84. [2019-10-02 11:16:56,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-10-02 11:16:56,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2019-10-02 11:16:56,458 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 71 [2019-10-02 11:16:56,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:16:56,458 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2019-10-02 11:16:56,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 11:16:56,458 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2019-10-02 11:16:56,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-02 11:16:56,460 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:16:56,460 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:16:56,460 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:16:56,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:16:56,460 INFO L82 PathProgramCache]: Analyzing trace with hash -597448344, now seen corresponding path program 8 times [2019-10-02 11:16:56,460 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:16:56,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:16:56,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:16:56,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:16:56,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:16:56,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:16:56,682 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 12 proven. 100 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-10-02 11:16:56,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:16:56,682 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:16:56,715 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:16:56,768 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:16:56,769 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:16:56,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 50 conjunts are in the unsatisfiable core [2019-10-02 11:16:56,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:16:56,811 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 41 treesize of output 37 [2019-10-02 11:16:56,812 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:16:56,854 INFO L567 ElimStorePlain]: treesize reduction 54, result has 33.3 percent of original size [2019-10-02 11:16:56,855 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_24| vanished before elimination [2019-10-02 11:16:56,855 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:16:56,855 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:85, output treesize:24 [2019-10-02 11:16:56,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:16:56,934 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:16:56,935 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 58 treesize of output 103 [2019-10-02 11:16:56,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:16:56,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:16:56,937 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:16:56,948 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:16:56,948 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:16:57,005 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-10-02 11:16:57,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:16:57,010 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-02 11:16:57,010 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-10-02 11:16:57,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:16:57,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:16:57,074 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:16:57,075 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:16:57,115 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:16:57,116 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 58 treesize of output 103 [2019-10-02 11:16:57,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:16:57,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:16:57,119 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:16:57,170 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-10-02 11:16:57,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:16:57,172 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-02 11:16:57,172 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-10-02 11:16:57,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:16:57,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:16:57,253 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:16:57,254 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 58 treesize of output 103 [2019-10-02 11:16:57,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:16:57,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:16:57,256 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:16:57,261 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:16:57,261 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:16:57,307 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-10-02 11:16:57,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:16:57,311 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-02 11:16:57,311 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-10-02 11:16:57,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:16:58,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:16:58,269 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:16:58,269 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:16:58,277 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:16:58,278 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 50 treesize of output 50 [2019-10-02 11:16:58,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:16:58,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:16:58,279 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:16:58,305 INFO L567 ElimStorePlain]: treesize reduction 27, result has 42.6 percent of original size [2019-10-02 11:16:58,306 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:16:58,306 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:103, output treesize:17 [2019-10-02 11:16:58,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:16:58,399 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-02 11:16:58,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:16:58,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21] total 25 [2019-10-02 11:16:58,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-02 11:16:58,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-02 11:16:58,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2019-10-02 11:16:58,410 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 25 states. [2019-10-02 11:17:16,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:16,055 INFO L93 Difference]: Finished difference Result 170 states and 177 transitions. [2019-10-02 11:17:16,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 11:17:16,056 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 81 [2019-10-02 11:17:16,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:16,057 INFO L225 Difference]: With dead ends: 170 [2019-10-02 11:17:16,058 INFO L226 Difference]: Without dead ends: 113 [2019-10-02 11:17:16,059 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 55 SyntacticMatches, 16 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=140, Invalid=852, Unknown=0, NotChecked=0, Total=992 [2019-10-02 11:17:16,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-10-02 11:17:16,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 94. [2019-10-02 11:17:16,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-10-02 11:17:16,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2019-10-02 11:17:16,075 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 81 [2019-10-02 11:17:16,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:16,075 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2019-10-02 11:17:16,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-02 11:17:16,075 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2019-10-02 11:17:16,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-02 11:17:16,077 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:16,077 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:16,077 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:16,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:16,078 INFO L82 PathProgramCache]: Analyzing trace with hash -124956739, now seen corresponding path program 9 times [2019-10-02 11:17:16,078 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:16,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:16,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:16,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:17:16,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:16,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:16,278 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 14 proven. 121 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-10-02 11:17:16,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:17:16,278 INFO L224 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-10-02 11:17:16,302 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 11:17:58,980 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-10-02 11:17:58,981 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:17:59,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-02 11:17:59,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:17:59,048 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:17:59,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:17:59,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-10-02 11:17:59,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 11:17:59,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 11:17:59,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-10-02 11:17:59,063 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 15 states. [2019-10-02 11:17:59,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:59,626 INFO L93 Difference]: Finished difference Result 184 states and 191 transitions. [2019-10-02 11:17:59,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 11:17:59,626 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 91 [2019-10-02 11:17:59,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:59,628 INFO L225 Difference]: With dead ends: 184 [2019-10-02 11:17:59,628 INFO L226 Difference]: Without dead ends: 119 [2019-10-02 11:17:59,628 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-10-02 11:17:59,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-10-02 11:17:59,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 96. [2019-10-02 11:17:59,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-10-02 11:17:59,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2019-10-02 11:17:59,645 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 91 [2019-10-02 11:17:59,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:59,645 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2019-10-02 11:17:59,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 11:17:59,645 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2019-10-02 11:17:59,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-02 11:17:59,647 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:59,647 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:59,647 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:59,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:59,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1641085861, now seen corresponding path program 10 times [2019-10-02 11:17:59,647 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:59,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:59,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:59,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:17:59,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:59,895 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 14 proven. 144 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-10-02 11:17:59,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:17:59,895 INFO L224 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-10-02 11:17:59,919 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 11:17:59,974 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 11:17:59,974 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:17:59,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 57 conjunts are in the unsatisfiable core [2019-10-02 11:17:59,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:17:59,992 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:17:59,993 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:18:00,016 INFO L567 ElimStorePlain]: treesize reduction 10, result has 75.6 percent of original size [2019-10-02 11:18:00,020 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 17 treesize of output 13 [2019-10-02 11:18:00,020 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:18:00,029 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:18:00,030 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:18:00,030 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:85, output treesize:24 [2019-10-02 11:18:00,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:18:00,084 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:18:00,085 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 58 treesize of output 103 [2019-10-02 11:18:00,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:18:00,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:18:00,087 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:18:00,095 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:18:00,095 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:18:00,141 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-10-02 11:18:00,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:18:00,143 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-02 11:18:00,143 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-10-02 11:18:00,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:18:00,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:18:00,192 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:18:00,192 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:18:00,211 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:18:00,211 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 58 treesize of output 103 [2019-10-02 11:18:00,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:18:00,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:18:00,213 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:18:00,262 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-10-02 11:18:00,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:18:00,263 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-02 11:18:00,264 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-10-02 11:18:00,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:18:00,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:18:00,348 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:18:00,349 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 58 treesize of output 103 [2019-10-02 11:18:00,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:18:00,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:18:00,352 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:18:00,356 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:18:00,356 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:18:00,405 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-10-02 11:18:00,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:18:00,407 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-02 11:18:00,407 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-10-02 11:18:00,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:18:00,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:18:00,479 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:18:00,479 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 58 treesize of output 103 [2019-10-02 11:18:00,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:18:00,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:18:00,481 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:18:00,484 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:18:00,484 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:18:00,534 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-10-02 11:18:00,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:18:00,536 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-02 11:18:00,537 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-10-02 11:18:00,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:18:01,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:18:01,819 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:18:01,819 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:18:01,827 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:18:01,828 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 50 treesize of output 50 [2019-10-02 11:18:01,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:18:01,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:18:01,829 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:18:01,857 INFO L567 ElimStorePlain]: treesize reduction 27, result has 42.6 percent of original size [2019-10-02 11:18:01,858 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:18:01,858 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:103, output treesize:17 [2019-10-02 11:18:01,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:18:01,975 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 0 proven. 236 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-10-02 11:18:01,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:18:01,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 23] total 28 [2019-10-02 11:18:01,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-02 11:18:01,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-02 11:18:01,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2019-10-02 11:18:01,980 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 28 states. [2019-10-02 11:18:17,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:17,899 INFO L93 Difference]: Finished difference Result 194 states and 202 transitions. [2019-10-02 11:18:17,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-02 11:18:17,900 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 93 [2019-10-02 11:18:17,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:17,902 INFO L225 Difference]: With dead ends: 194 [2019-10-02 11:18:17,902 INFO L226 Difference]: Without dead ends: 129 [2019-10-02 11:18:17,903 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 62 SyntacticMatches, 19 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=160, Invalid=1100, Unknown=0, NotChecked=0, Total=1260 [2019-10-02 11:18:17,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-10-02 11:18:17,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 106. [2019-10-02 11:18:17,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-10-02 11:18:17,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2019-10-02 11:18:17,916 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 93 [2019-10-02 11:18:17,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:17,917 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2019-10-02 11:18:17,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-02 11:18:17,917 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2019-10-02 11:18:17,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-02 11:18:17,918 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:17,918 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:17,919 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:17,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:17,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1452750160, now seen corresponding path program 11 times [2019-10-02 11:18:17,919 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:17,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:17,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:17,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:18:17,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:18,224 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 16 proven. 169 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-10-02 11:18:18,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:18:18,225 INFO L224 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-10-02 11:18:18,263 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 11:20:19,100 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2019-10-02 11:20:19,101 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:20:23,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 61 conjunts are in the unsatisfiable core [2019-10-02 11:20:23,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:20:23,525 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:20:23,525 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:20:23,546 INFO L567 ElimStorePlain]: treesize reduction 10, result has 75.6 percent of original size [2019-10-02 11:20:23,551 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 17 treesize of output 13 [2019-10-02 11:20:23,551 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:20:23,561 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:20:23,562 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:20:23,563 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:85, output treesize:24 [2019-10-02 11:20:23,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:20:23,606 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:20:23,606 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:20:23,626 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:20:23,626 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 58 treesize of output 103 [2019-10-02 11:20:23,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:20:23,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:20:23,628 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:20:23,677 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-10-02 11:20:23,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:20:23,680 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-02 11:20:23,680 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-10-02 11:20:23,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:20:23,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:20:23,745 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:20:23,746 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:20:23,770 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:20:23,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 58 treesize of output 103 [2019-10-02 11:20:23,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:20:23,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:20:23,772 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:20:23,818 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-10-02 11:20:23,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:20:23,821 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-02 11:20:23,821 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-10-02 11:20:23,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:20:23,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:20:23,916 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:20:23,916 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 58 treesize of output 103 [2019-10-02 11:20:23,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:20:23,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:20:23,918 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:20:23,921 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:20:23,921 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:20:23,968 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-10-02 11:20:23,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:20:23,970 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-02 11:20:23,970 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-10-02 11:20:23,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:20:24,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:20:24,021 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:20:24,021 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:20:24,039 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:20:24,040 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 58 treesize of output 103 [2019-10-02 11:20:24,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:20:24,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:20:24,042 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:20:24,092 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-10-02 11:20:24,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:20:24,094 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-02 11:20:24,094 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-10-02 11:20:24,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:20:27,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:20:27,613 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 11:20:27,614 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 11:20:27,615 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2019-10-02 11:20:27,615 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:20:27,621 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:20:27,621 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:20:27,641 INFO L567 ElimStorePlain]: treesize reduction 10, result has 63.0 percent of original size [2019-10-02 11:20:27,642 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:20:27,643 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:103, output treesize:17 [2019-10-02 11:20:27,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:20:27,770 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 8 proven. 293 refuted. 20 times theorem prover too weak. 104 trivial. 0 not checked. [2019-10-02 11:20:27,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:20:27,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 26] total 31 [2019-10-02 11:20:27,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-02 11:20:27,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-02 11:20:27,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=807, Unknown=1, NotChecked=0, Total=930 [2019-10-02 11:20:27,778 INFO L87 Difference]: Start difference. First operand 106 states and 107 transitions. Second operand 31 states. [2019-10-02 11:20:54,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:20:54,184 INFO L93 Difference]: Finished difference Result 212 states and 220 transitions. [2019-10-02 11:20:54,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-02 11:20:54,185 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 103 [2019-10-02 11:20:54,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:20:54,187 INFO L225 Difference]: With dead ends: 212 [2019-10-02 11:20:54,187 INFO L226 Difference]: Without dead ends: 139 [2019-10-02 11:20:54,188 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 70 SyntacticMatches, 20 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=191, Invalid=1290, Unknown=1, NotChecked=0, Total=1482 [2019-10-02 11:20:54,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-10-02 11:20:54,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 116. [2019-10-02 11:20:54,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-10-02 11:20:54,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 117 transitions. [2019-10-02 11:20:54,206 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 117 transitions. Word has length 103 [2019-10-02 11:20:54,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:20:54,207 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 117 transitions. [2019-10-02 11:20:54,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-02 11:20:54,207 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 117 transitions. [2019-10-02 11:20:54,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-02 11:20:54,208 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:20:54,208 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:20:54,209 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:20:54,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:20:54,209 INFO L82 PathProgramCache]: Analyzing trace with hash -282747259, now seen corresponding path program 12 times [2019-10-02 11:20:54,209 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:20:54,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:20:54,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:54,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:20:54,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:20:54,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:20:54,467 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 18 proven. 196 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2019-10-02 11:20:54,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:20:54,467 INFO L224 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-10-02 11:20:54,494 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 11:21:52,810 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2019-10-02 11:21:52,811 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:21:52,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-02 11:21:52,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:21:52,962 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-10-02 11:21:52,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:21:52,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-10-02 11:21:52,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 11:21:52,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 11:21:52,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-10-02 11:21:52,973 INFO L87 Difference]: Start difference. First operand 116 states and 117 transitions. Second operand 18 states. [2019-10-02 11:21:53,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:21:53,887 INFO L93 Difference]: Finished difference Result 226 states and 234 transitions. [2019-10-02 11:21:53,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 11:21:53,887 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 113 [2019-10-02 11:21:53,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:21:53,889 INFO L225 Difference]: With dead ends: 226 [2019-10-02 11:21:53,889 INFO L226 Difference]: Without dead ends: 145 [2019-10-02 11:21:53,889 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-10-02 11:21:53,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-10-02 11:21:53,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 118. [2019-10-02 11:21:53,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-10-02 11:21:53,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2019-10-02 11:21:53,916 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 113 [2019-10-02 11:21:53,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:21:53,917 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2019-10-02 11:21:53,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 11:21:53,917 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2019-10-02 11:21:53,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-02 11:21:53,919 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:21:53,919 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:21:53,919 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:21:53,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:21:53,920 INFO L82 PathProgramCache]: Analyzing trace with hash -530257757, now seen corresponding path program 13 times [2019-10-02 11:21:53,920 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:21:53,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:21:53,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:21:53,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:21:53,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:21:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:21:54,324 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 18 proven. 225 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2019-10-02 11:21:54,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:21:54,325 INFO L224 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-10-02 11:21:54,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:21:54,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:21:54,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 68 conjunts are in the unsatisfiable core [2019-10-02 11:21:54,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:21:54,542 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:21:54,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:21:54,573 INFO L567 ElimStorePlain]: treesize reduction 10, result has 75.6 percent of original size [2019-10-02 11:21:54,577 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 17 treesize of output 13 [2019-10-02 11:21:54,577 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:21:54,589 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:21:54,590 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:21:54,590 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:85, output treesize:24 [2019-10-02 11:21:54,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:21:54,666 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:21:54,667 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 58 treesize of output 103 [2019-10-02 11:21:54,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:21:54,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:21:54,668 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:21:54,672 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:21:54,673 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:21:54,719 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-10-02 11:21:54,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:21:54,720 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-02 11:21:54,721 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-10-02 11:21:54,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:21:54,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:21:54,816 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:21:54,817 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 58 treesize of output 103 [2019-10-02 11:21:54,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:21:54,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:21:54,818 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:21:54,835 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:21:54,835 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:21:54,878 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-10-02 11:21:54,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:21:54,879 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-02 11:21:54,880 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-10-02 11:21:54,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:21:54,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:21:54,963 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:21:54,964 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 58 treesize of output 103 [2019-10-02 11:21:54,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:21:54,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:21:54,965 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:21:54,968 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:21:54,969 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:21:55,022 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-10-02 11:21:55,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:21:55,023 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-02 11:21:55,023 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-10-02 11:21:55,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:21:55,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:21:55,103 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:21:55,104 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:21:55,118 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:21:55,119 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 58 treesize of output 103 [2019-10-02 11:21:55,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:21:55,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:21:55,120 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:21:55,177 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-10-02 11:21:55,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:21:55,178 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-02 11:21:55,178 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-10-02 11:21:55,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:21:55,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:21:55,265 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:21:55,266 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 58 treesize of output 103 [2019-10-02 11:21:55,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:21:55,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:21:55,267 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:21:55,271 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:21:55,271 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:21:55,325 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-10-02 11:21:55,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:21:55,326 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-02 11:21:55,326 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-10-02 11:21:55,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:21:57,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:21:57,277 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 11:21:57,278 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 11:21:57,279 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2019-10-02 11:21:57,279 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:21:57,294 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:21:57,295 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:21:57,315 INFO L567 ElimStorePlain]: treesize reduction 10, result has 63.0 percent of original size [2019-10-02 11:21:57,316 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:21:57,316 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:103, output treesize:17 [2019-10-02 11:21:57,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:21:57,456 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 0 proven. 375 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2019-10-02 11:21:57,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:21:57,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 27] total 33 [2019-10-02 11:21:57,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-02 11:21:57,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-02 11:21:57,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=935, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 11:21:57,461 INFO L87 Difference]: Start difference. First operand 118 states and 119 transitions. Second operand 33 states. [2019-10-02 11:22:21,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:22:21,768 INFO L93 Difference]: Finished difference Result 236 states and 245 transitions. [2019-10-02 11:22:21,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-02 11:22:21,772 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 115 [2019-10-02 11:22:21,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:22:21,774 INFO L225 Difference]: With dead ends: 236 [2019-10-02 11:22:21,774 INFO L226 Difference]: Without dead ends: 155 [2019-10-02 11:22:21,775 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 78 SyntacticMatches, 24 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=190, Invalid=1532, Unknown=0, NotChecked=0, Total=1722 [2019-10-02 11:22:21,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-10-02 11:22:21,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 128. [2019-10-02 11:22:21,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-10-02 11:22:21,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 129 transitions. [2019-10-02 11:22:21,794 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 129 transitions. Word has length 115 [2019-10-02 11:22:21,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:22:21,794 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 129 transitions. [2019-10-02 11:22:21,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-02 11:22:21,794 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 129 transitions. [2019-10-02 11:22:21,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-02 11:22:21,796 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:22:21,796 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:22:21,796 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:22:21,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:22:21,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1182440568, now seen corresponding path program 14 times [2019-10-02 11:22:21,796 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:22:21,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:22:21,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:22:21,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:22:21,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:22:21,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:22:22,168 INFO L134 CoverageAnalysis]: Checked inductivity of 656 backedges. 20 proven. 256 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-10-02 11:22:22,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:22:22,169 INFO L224 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-10-02 11:22:22,214 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:22:22,291 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:22:22,291 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:22:22,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 72 conjunts are in the unsatisfiable core [2019-10-02 11:22:22,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:22:22,317 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 41 treesize of output 37 [2019-10-02 11:22:22,318 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:22:22,351 INFO L567 ElimStorePlain]: treesize reduction 54, result has 33.3 percent of original size [2019-10-02 11:22:22,352 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_44| vanished before elimination [2019-10-02 11:22:22,352 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:22:22,353 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:85, output treesize:24 [2019-10-02 11:22:22,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:22:22,428 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:22:22,429 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 58 treesize of output 103 [2019-10-02 11:22:22,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:22:22,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:22:22,431 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:22:22,434 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:22:22,434 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:22:22,486 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-10-02 11:22:22,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:22:22,488 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-02 11:22:22,489 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-10-02 11:22:22,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:22:22,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:22:22,566 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:22:22,566 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:22:22,583 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:22:22,584 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 58 treesize of output 103 [2019-10-02 11:22:22,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:22:22,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:22:22,585 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:22:22,645 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-10-02 11:22:22,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:22:22,646 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-02 11:22:22,646 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-10-02 11:22:22,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:22:22,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:22:22,729 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:22:22,730 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:22:22,757 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:22:22,758 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 58 treesize of output 103 [2019-10-02 11:22:22,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:22:22,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:22:22,760 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:22:22,822 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-10-02 11:22:22,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:22:22,823 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-02 11:22:22,824 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-10-02 11:22:22,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:22:22,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:22:22,974 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:22:22,975 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 58 treesize of output 103 [2019-10-02 11:22:22,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:22:22,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:22:22,977 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:22:22,993 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:22:22,993 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:22:23,067 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-10-02 11:22:23,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:22:23,072 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-02 11:22:23,073 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-10-02 11:22:23,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:22:23,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:22:23,224 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:22:23,225 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 58 treesize of output 103 [2019-10-02 11:22:23,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:22:23,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:22:23,227 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:22:23,231 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:22:23,231 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:22:23,302 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-10-02 11:22:23,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:22:23,304 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-02 11:22:23,305 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-10-02 11:22:23,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:22:25,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:22:25,357 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:22:25,358 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:22:25,366 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:22:25,366 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 50 treesize of output 50 [2019-10-02 11:22:25,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:22:25,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:22:25,368 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:22:25,394 INFO L567 ElimStorePlain]: treesize reduction 27, result has 42.6 percent of original size [2019-10-02 11:22:25,395 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:22:25,395 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:103, output treesize:17 [2019-10-02 11:22:25,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:22:25,551 INFO L134 CoverageAnalysis]: Checked inductivity of 656 backedges. 0 proven. 446 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-10-02 11:22:25,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:22:25,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 29] total 35 [2019-10-02 11:22:25,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-02 11:22:25,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-02 11:22:25,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1060, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 11:22:25,561 INFO L87 Difference]: Start difference. First operand 128 states and 129 transitions. Second operand 35 states. [2019-10-02 11:22:48,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:22:48,313 INFO L93 Difference]: Finished difference Result 254 states and 263 transitions. [2019-10-02 11:22:48,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-02 11:22:48,313 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 125 [2019-10-02 11:22:48,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:22:48,315 INFO L225 Difference]: With dead ends: 254 [2019-10-02 11:22:48,315 INFO L226 Difference]: Without dead ends: 165 [2019-10-02 11:22:48,316 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 84 SyntacticMatches, 26 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=200, Invalid=1692, Unknown=0, NotChecked=0, Total=1892 [2019-10-02 11:22:48,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-10-02 11:22:48,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 138. [2019-10-02 11:22:48,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-10-02 11:22:48,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 139 transitions. [2019-10-02 11:22:48,340 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 139 transitions. Word has length 125 [2019-10-02 11:22:48,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:22:48,340 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 139 transitions. [2019-10-02 11:22:48,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-02 11:22:48,340 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 139 transitions. [2019-10-02 11:22:48,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-02 11:22:48,341 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:22:48,341 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:22:48,341 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:22:48,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:22:48,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1305017805, now seen corresponding path program 15 times [2019-10-02 11:22:48,342 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:22:48,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:22:48,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:22:48,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:22:48,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:22:48,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:22:48,674 INFO L134 CoverageAnalysis]: Checked inductivity of 773 backedges. 22 proven. 289 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2019-10-02 11:22:48,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:22:48,674 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:22:48,715 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 11:24:55,859 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-10-02 11:24:55,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:24:56,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 63 conjunts are in the unsatisfiable core [2019-10-02 11:24:56,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:24:56,524 INFO L134 CoverageAnalysis]: Checked inductivity of 773 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2019-10-02 11:24:56,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:24:56,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-10-02 11:24:56,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-02 11:24:56,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-02 11:24:56,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-10-02 11:24:56,533 INFO L87 Difference]: Start difference. First operand 138 states and 139 transitions. Second operand 21 states. [2019-10-02 11:24:57,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:24:57,769 INFO L93 Difference]: Finished difference Result 268 states and 277 transitions. [2019-10-02 11:24:57,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 11:24:57,773 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 135 [2019-10-02 11:24:57,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:24:57,775 INFO L225 Difference]: With dead ends: 268 [2019-10-02 11:24:57,775 INFO L226 Difference]: Without dead ends: 171 [2019-10-02 11:24:57,775 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 133 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-10-02 11:24:57,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-10-02 11:24:57,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 140. [2019-10-02 11:24:57,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-10-02 11:24:57,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 141 transitions. [2019-10-02 11:24:57,808 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 141 transitions. Word has length 135 [2019-10-02 11:24:57,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:24:57,808 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 141 transitions. [2019-10-02 11:24:57,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-02 11:24:57,809 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2019-10-02 11:24:57,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-02 11:24:57,811 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:24:57,811 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:24:57,811 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:24:57,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:24:57,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1038400875, now seen corresponding path program 16 times [2019-10-02 11:24:57,811 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:24:57,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:24:57,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:24:57,813 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:24:57,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:24:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:24:58,191 INFO L134 CoverageAnalysis]: Checked inductivity of 808 backedges. 22 proven. 324 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2019-10-02 11:24:58,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:24:58,192 INFO L224 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-10-02 11:24:58,226 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 11:24:58,302 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 11:24:58,302 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:24:58,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 79 conjunts are in the unsatisfiable core [2019-10-02 11:24:58,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:24:58,317 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:24:58,317 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:24:58,339 INFO L567 ElimStorePlain]: treesize reduction 10, result has 75.6 percent of original size [2019-10-02 11:24:58,343 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 17 treesize of output 13 [2019-10-02 11:24:58,343 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:24:58,353 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:24:58,353 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:24:58,354 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:85, output treesize:24 [2019-10-02 11:24:58,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:24:58,429 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:24:58,429 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 58 treesize of output 103 [2019-10-02 11:24:58,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:24:58,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:24:58,431 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:24:58,434 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:24:58,434 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:24:58,484 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-10-02 11:24:58,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:24:58,486 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-02 11:24:58,486 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-10-02 11:24:58,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:24:58,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:24:58,552 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:24:58,552 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:24:58,571 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:24:58,571 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 58 treesize of output 103 [2019-10-02 11:24:58,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:24:58,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:24:58,572 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:24:58,623 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-10-02 11:24:58,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:24:58,625 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-02 11:24:58,625 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-10-02 11:24:58,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:24:58,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:24:58,726 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:24:58,727 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 58 treesize of output 103 [2019-10-02 11:24:58,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:24:58,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:24:58,729 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:24:58,731 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:24:58,731 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:24:58,781 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-10-02 11:24:58,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:24:58,783 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-02 11:24:58,783 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-10-02 11:24:58,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:24:58,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:24:58,869 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:24:58,870 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 58 treesize of output 103 [2019-10-02 11:24:58,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:24:58,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:24:58,871 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:24:58,874 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:24:58,874 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:24:58,923 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-10-02 11:24:58,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:24:58,925 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-02 11:24:58,925 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-10-02 11:24:58,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:24:58,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:24:59,006 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:24:59,006 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:24:59,024 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:24:59,024 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 58 treesize of output 103 [2019-10-02 11:24:59,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:24:59,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:24:59,026 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:24:59,077 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-10-02 11:24:59,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:24:59,078 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-02 11:24:59,079 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-10-02 11:24:59,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:24:59,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:24:59,186 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:24:59,187 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 58 treesize of output 103 [2019-10-02 11:24:59,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:24:59,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:24:59,188 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:24:59,192 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:24:59,192 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:24:59,237 INFO L567 ElimStorePlain]: treesize reduction 35, result has 66.0 percent of original size [2019-10-02 11:24:59,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:24:59,239 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-02 11:24:59,239 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:65 [2019-10-02 11:24:59,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:25:02,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:25:02,501 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 11:25:02,503 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 11:25:02,503 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2019-10-02 11:25:02,504 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:25:02,506 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:25:02,506 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:25:02,526 INFO L567 ElimStorePlain]: treesize reduction 10, result has 63.0 percent of original size [2019-10-02 11:25:02,526 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:25:02,527 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:103, output treesize:17 [2019-10-02 11:25:02,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:25:02,709 INFO L134 CoverageAnalysis]: Checked inductivity of 808 backedges. 0 proven. 546 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2019-10-02 11:25:02,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:25:02,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 31] total 38 [2019-10-02 11:25:02,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-02 11:25:02,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-02 11:25:02,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1264, Unknown=0, NotChecked=0, Total=1406 [2019-10-02 11:25:02,715 INFO L87 Difference]: Start difference. First operand 140 states and 141 transitions. Second operand 38 states. [2019-10-02 11:25:34,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:25:34,851 INFO L93 Difference]: Finished difference Result 278 states and 288 transitions. [2019-10-02 11:25:34,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-02 11:25:34,851 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 137 [2019-10-02 11:25:34,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:25:34,852 INFO L225 Difference]: With dead ends: 278 [2019-10-02 11:25:34,852 INFO L226 Difference]: Without dead ends: 181 [2019-10-02 11:25:34,853 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 93 SyntacticMatches, 29 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 581 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=220, Invalid=2036, Unknown=0, NotChecked=0, Total=2256 [2019-10-02 11:25:34,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-10-02 11:25:34,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 150. [2019-10-02 11:25:34,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-10-02 11:25:34,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 151 transitions. [2019-10-02 11:25:34,881 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 151 transitions. Word has length 137 [2019-10-02 11:25:34,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:25:34,881 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 151 transitions. [2019-10-02 11:25:34,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-02 11:25:34,881 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2019-10-02 11:25:34,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-02 11:25:34,882 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:25:34,883 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 13, 13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:25:34,883 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:25:34,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:25:34,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1246019264, now seen corresponding path program 17 times [2019-10-02 11:25:34,883 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:25:34,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:25:34,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:25:34,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:25:34,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:25:34,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:25:35,261 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 24 proven. 361 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2019-10-02 11:25:35,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:25:35,262 INFO L224 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-10-02 11:25:35,303 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 11:28:18,899 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2019-10-02 11:28:18,899 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:28:18,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 84 conjunts are in the unsatisfiable core [2019-10-02 11:28:18,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:28:18,998 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 41 treesize of output 37 [2019-10-02 11:28:18,999 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:28:19,032 INFO L567 ElimStorePlain]: treesize reduction 54, result has 33.3 percent of original size [2019-10-02 11:28:19,033 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_57| vanished before elimination [2019-10-02 11:28:19,033 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:28:19,033 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:85, output treesize:24 [2019-10-02 11:28:19,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:28:19,113 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:28:19,119 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 55 treesize of output 54 [2019-10-02 11:28:19,119 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:28:19,122 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:28:19,123 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:28:19,149 INFO L567 ElimStorePlain]: treesize reduction 10, result has 80.4 percent of original size [2019-10-02 11:28:19,150 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-10-02 11:28:19,150 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:113, output treesize:28 [2019-10-02 11:28:19,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:28:19,199 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:28:19,200 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:28:19,219 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:28:19,219 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 62 treesize of output 113 [2019-10-02 11:28:19,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:28:19,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:28:19,220 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:28:19,295 INFO L567 ElimStorePlain]: treesize reduction 39, result has 65.5 percent of original size [2019-10-02 11:28:19,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:28:19,297 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-02 11:28:19,297 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:127, output treesize:71 [2019-10-02 11:28:19,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:28:21,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:28:21,407 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:28:21,407 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 62 treesize of output 113 [2019-10-02 11:28:21,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:28:21,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:28:21,409 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:28:21,412 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:28:21,412 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:28:21,473 INFO L567 ElimStorePlain]: treesize reduction 39, result has 65.5 percent of original size [2019-10-02 11:28:21,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:28:21,475 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-02 11:28:21,475 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:127, output treesize:71 [2019-10-02 11:28:21,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:28:23,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:28:23,703 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:28:23,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 113 [2019-10-02 11:28:23,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:28:23,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:28:23,706 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:28:23,714 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:28:23,714 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:28:23,764 INFO L567 ElimStorePlain]: treesize reduction 39, result has 65.5 percent of original size [2019-10-02 11:28:23,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:28:23,765 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-02 11:28:23,766 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:127, output treesize:71 [2019-10-02 11:28:23,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:28:23,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:28:23,906 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:28:23,907 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:28:23,930 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:28:23,931 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 62 treesize of output 113 [2019-10-02 11:28:23,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:28:23,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:28:23,933 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:28:23,997 INFO L567 ElimStorePlain]: treesize reduction 39, result has 65.5 percent of original size [2019-10-02 11:28:23,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:28:23,999 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-02 11:28:23,999 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:127, output treesize:71 [2019-10-02 11:28:23,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:28:24,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:28:24,129 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:28:24,129 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 62 treesize of output 113 [2019-10-02 11:28:24,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:28:24,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:28:24,131 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:28:24,134 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:28:24,134 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:28:24,186 INFO L567 ElimStorePlain]: treesize reduction 39, result has 65.5 percent of original size [2019-10-02 11:28:24,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:28:24,187 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-02 11:28:24,188 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:127, output treesize:71 [2019-10-02 11:28:24,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:28:27,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:28:27,463 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 47 treesize of output 27 [2019-10-02 11:28:27,464 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:28:27,467 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:28:27,467 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:28:27,485 INFO L567 ElimStorePlain]: treesize reduction 10, result has 58.3 percent of original size [2019-10-02 11:28:27,486 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:28:27,486 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:97, output treesize:14 [2019-10-02 11:28:27,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:28:27,797 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 0 proven. 643 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2019-10-02 11:28:27,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:28:27,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 34] total 41 [2019-10-02 11:28:27,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-02 11:28:27,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-02 11:28:27,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1483, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 11:28:27,808 INFO L87 Difference]: Start difference. First operand 150 states and 151 transitions. Second operand 41 states. [2019-10-02 11:28:49,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:28:49,036 INFO L93 Difference]: Finished difference Result 296 states and 306 transitions. [2019-10-02 11:28:49,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-02 11:28:49,037 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 147 [2019-10-02 11:28:49,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:28:49,038 INFO L225 Difference]: With dead ends: 296 [2019-10-02 11:28:49,038 INFO L226 Difference]: Without dead ends: 191 [2019-10-02 11:28:49,039 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 98 SyntacticMatches, 31 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 757 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=230, Invalid=2220, Unknown=0, NotChecked=0, Total=2450 [2019-10-02 11:28:49,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-10-02 11:28:49,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 160. [2019-10-02 11:28:49,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-10-02 11:28:49,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 161 transitions. [2019-10-02 11:28:49,063 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 161 transitions. Word has length 147 [2019-10-02 11:28:49,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:28:49,063 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 161 transitions. [2019-10-02 11:28:49,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-02 11:28:49,063 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2019-10-02 11:28:49,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-02 11:28:49,064 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:28:49,064 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 14, 14, 14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:28:49,065 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:28:49,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:28:49,065 INFO L82 PathProgramCache]: Analyzing trace with hash -551875179, now seen corresponding path program 18 times [2019-10-02 11:28:49,065 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:28:49,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:28:49,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:28:49,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:28:49,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:28:49,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:28:49,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1076 backedges. 26 proven. 400 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2019-10-02 11:28:49,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:28:49,515 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:28:49,561 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE