java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-tiling/pr3.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 21:50:17,730 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 21:50:17,733 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 21:50:17,752 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 21:50:17,752 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 21:50:17,754 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 21:50:17,756 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 21:50:17,766 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 21:50:17,771 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 21:50:17,774 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 21:50:17,776 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 21:50:17,778 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 21:50:17,778 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 21:50:17,780 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 21:50:17,782 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 21:50:17,783 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 21:50:17,785 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 21:50:17,786 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 21:50:17,787 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 21:50:17,792 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 21:50:17,797 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 21:50:17,798 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 21:50:17,800 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 21:50:17,801 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 21:50:17,803 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 21:50:17,804 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 21:50:17,804 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 21:50:17,806 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 21:50:17,807 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 21:50:17,808 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 21:50:17,808 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 21:50:17,809 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 21:50:17,809 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 21:50:17,810 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 21:50:17,812 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 21:50:17,812 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 21:50:17,813 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 21:50:17,813 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 21:50:17,813 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 21:50:17,814 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 21:50:17,815 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 21:50:17,816 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-14 21:50:17,849 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 21:50:17,849 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 21:50:17,850 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 21:50:17,855 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 21:50:17,856 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 21:50:17,856 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 21:50:17,856 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 21:50:17,856 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 21:50:17,856 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 21:50:17,857 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 21:50:17,857 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 21:50:17,857 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 21:50:17,857 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 21:50:17,857 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 21:50:17,858 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 21:50:17,858 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 21:50:17,858 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 21:50:17,859 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 21:50:17,859 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 21:50:17,860 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 21:50:17,860 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 21:50:17,860 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 21:50:17,860 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 21:50:17,861 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 21:50:17,861 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 21:50:17,861 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 21:50:17,861 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 21:50:17,861 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 21:50:17,861 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 21:50:18,179 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 21:50:18,199 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 21:50:18,203 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 21:50:18,204 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 21:50:18,205 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 21:50:18,205 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/pr3.c [2019-10-14 21:50:18,281 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b664b7cd5/3ff29143f8b34bc2ab499aa519ec4af6/FLAGbb56910a8 [2019-10-14 21:50:18,766 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 21:50:18,767 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/pr3.c [2019-10-14 21:50:18,773 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b664b7cd5/3ff29143f8b34bc2ab499aa519ec4af6/FLAGbb56910a8 [2019-10-14 21:50:19,114 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b664b7cd5/3ff29143f8b34bc2ab499aa519ec4af6 [2019-10-14 21:50:19,124 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 21:50:19,126 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 21:50:19,127 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 21:50:19,127 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 21:50:19,131 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 21:50:19,132 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:50:19" (1/1) ... [2019-10-14 21:50:19,135 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79c32c4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:19, skipping insertion in model container [2019-10-14 21:50:19,135 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:50:19" (1/1) ... [2019-10-14 21:50:19,142 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 21:50:19,166 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 21:50:19,377 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 21:50:19,382 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 21:50:19,410 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 21:50:19,523 INFO L192 MainTranslator]: Completed translation [2019-10-14 21:50:19,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:19 WrapperNode [2019-10-14 21:50:19,524 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 21:50:19,525 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 21:50:19,525 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 21:50:19,525 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 21:50:19,539 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:19" (1/1) ... [2019-10-14 21:50:19,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:19" (1/1) ... [2019-10-14 21:50:19,548 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:19" (1/1) ... [2019-10-14 21:50:19,548 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:19" (1/1) ... [2019-10-14 21:50:19,556 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:19" (1/1) ... [2019-10-14 21:50:19,562 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:19" (1/1) ... [2019-10-14 21:50:19,563 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:19" (1/1) ... [2019-10-14 21:50:19,566 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 21:50:19,566 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 21:50:19,566 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 21:50:19,567 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 21:50:19,567 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:19" (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-14 21:50:19,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 21:50:19,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 21:50:19,622 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-14 21:50:19,623 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 21:50:19,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 21:50:19,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-14 21:50:19,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-14 21:50:19,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 21:50:19,623 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 21:50:19,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-14 21:50:19,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 21:50:19,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 21:50:19,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 21:50:19,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 21:50:19,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 21:50:19,908 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 21:50:19,908 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-14 21:50:19,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:50:19 BoogieIcfgContainer [2019-10-14 21:50:19,910 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 21:50:19,911 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 21:50:19,911 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 21:50:19,914 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 21:50:19,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:50:19" (1/3) ... [2019-10-14 21:50:19,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@681f650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:50:19, skipping insertion in model container [2019-10-14 21:50:19,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:19" (2/3) ... [2019-10-14 21:50:19,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@681f650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:50:19, skipping insertion in model container [2019-10-14 21:50:19,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:50:19" (3/3) ... [2019-10-14 21:50:19,917 INFO L109 eAbstractionObserver]: Analyzing ICFG pr3.c [2019-10-14 21:50:19,941 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 21:50:19,954 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 21:50:19,967 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 21:50:19,992 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 21:50:19,993 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 21:50:19,993 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 21:50:19,993 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 21:50:19,993 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 21:50:19,993 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 21:50:19,993 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 21:50:19,994 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 21:50:20,013 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-10-14 21:50:20,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-14 21:50:20,019 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:20,020 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:20,022 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:20,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:20,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1453831941, now seen corresponding path program 1 times [2019-10-14 21:50:20,035 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:20,035 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839363750] [2019-10-14 21:50:20,036 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:20,036 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:20,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:20,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:20,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:20,294 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-14 21:50:20,296 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839363750] [2019-10-14 21:50:20,297 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:50:20,297 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 21:50:20,297 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100747160] [2019-10-14 21:50:20,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 21:50:20,303 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:20,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 21:50:20,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 21:50:20,320 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 6 states. [2019-10-14 21:50:20,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:20,559 INFO L93 Difference]: Finished difference Result 55 states and 71 transitions. [2019-10-14 21:50:20,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 21:50:20,561 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-10-14 21:50:20,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:20,574 INFO L225 Difference]: With dead ends: 55 [2019-10-14 21:50:20,574 INFO L226 Difference]: Without dead ends: 31 [2019-10-14 21:50:20,581 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-14 21:50:20,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-14 21:50:20,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-10-14 21:50:20,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-14 21:50:20,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2019-10-14 21:50:20,642 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 16 [2019-10-14 21:50:20,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:20,643 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-10-14 21:50:20,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 21:50:20,643 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2019-10-14 21:50:20,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-14 21:50:20,645 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:20,645 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:20,645 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:20,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:20,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1455678983, now seen corresponding path program 1 times [2019-10-14 21:50:20,646 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:20,647 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410974844] [2019-10-14 21:50:20,647 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:20,647 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:20,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:20,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:20,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:20,886 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-14 21:50:20,887 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410974844] [2019-10-14 21:50:20,887 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:50:20,887 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 21:50:20,888 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790808581] [2019-10-14 21:50:20,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 21:50:20,890 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:20,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 21:50:20,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-14 21:50:20,891 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 5 states. [2019-10-14 21:50:21,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:21,030 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2019-10-14 21:50:21,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 21:50:21,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-14 21:50:21,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:21,035 INFO L225 Difference]: With dead ends: 52 [2019-10-14 21:50:21,035 INFO L226 Difference]: Without dead ends: 35 [2019-10-14 21:50:21,036 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-14 21:50:21,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-14 21:50:21,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2019-10-14 21:50:21,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-14 21:50:21,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-10-14 21:50:21,046 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 16 [2019-10-14 21:50:21,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:21,046 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-10-14 21:50:21,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 21:50:21,047 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2019-10-14 21:50:21,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-14 21:50:21,048 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:21,050 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:21,050 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:21,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:21,051 INFO L82 PathProgramCache]: Analyzing trace with hash 363435001, now seen corresponding path program 1 times [2019-10-14 21:50:21,051 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:21,052 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414125015] [2019-10-14 21:50:21,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:21,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:21,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:21,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:21,459 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-14 21:50:21,460 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414125015] [2019-10-14 21:50:21,460 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970104870] [2019-10-14 21:50:21,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:21,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:21,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-14 21:50:21,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:21,651 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-14 21:50:21,652 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:21,664 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:21,666 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-14 21:50:21,667 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-10-14 21:50:21,705 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:21,706 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-10-14 21:50:21,707 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:21,718 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:21,719 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-14 21:50:21,720 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-10-14 21:50:21,732 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:21,735 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-10-14 21:50:21,736 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:21,744 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:21,744 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-14 21:50:21,745 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:11 [2019-10-14 21:50:21,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:21,830 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-14 21:50:21,831 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:21,831 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2019-10-14 21:50:21,831 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431285007] [2019-10-14 21:50:21,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-14 21:50:21,832 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:21,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-14 21:50:21,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-10-14 21:50:21,835 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 16 states. [2019-10-14 21:50:22,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:22,617 INFO L93 Difference]: Finished difference Result 103 states and 136 transitions. [2019-10-14 21:50:22,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-14 21:50:22,618 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-10-14 21:50:22,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:22,628 INFO L225 Difference]: With dead ends: 103 [2019-10-14 21:50:22,629 INFO L226 Difference]: Without dead ends: 87 [2019-10-14 21:50:22,630 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=220, Invalid=710, Unknown=0, NotChecked=0, Total=930 [2019-10-14 21:50:22,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-10-14 21:50:22,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 39. [2019-10-14 21:50:22,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-14 21:50:22,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2019-10-14 21:50:22,664 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 21 [2019-10-14 21:50:22,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:22,665 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2019-10-14 21:50:22,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-14 21:50:22,665 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2019-10-14 21:50:22,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-14 21:50:22,666 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:22,666 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:22,873 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:22,874 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:22,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:22,874 INFO L82 PathProgramCache]: Analyzing trace with hash 621600439, now seen corresponding path program 1 times [2019-10-14 21:50:22,874 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:22,874 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710687848] [2019-10-14 21:50:22,874 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:22,875 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:22,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:22,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:22,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:22,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:22,974 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710687848] [2019-10-14 21:50:22,974 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:50:22,974 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 21:50:22,975 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626979871] [2019-10-14 21:50:22,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 21:50:22,976 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:22,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 21:50:22,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 21:50:22,982 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand 5 states. [2019-10-14 21:50:23,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:23,093 INFO L93 Difference]: Finished difference Result 67 states and 84 transitions. [2019-10-14 21:50:23,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 21:50:23,095 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-10-14 21:50:23,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:23,097 INFO L225 Difference]: With dead ends: 67 [2019-10-14 21:50:23,097 INFO L226 Difference]: Without dead ends: 45 [2019-10-14 21:50:23,098 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 21:50:23,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-14 21:50:23,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2019-10-14 21:50:23,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-14 21:50:23,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2019-10-14 21:50:23,108 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 21 [2019-10-14 21:50:23,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:23,108 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2019-10-14 21:50:23,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 21:50:23,108 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2019-10-14 21:50:23,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-14 21:50:23,109 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:23,109 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:23,110 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:23,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:23,110 INFO L82 PathProgramCache]: Analyzing trace with hash 228573429, now seen corresponding path program 1 times [2019-10-14 21:50:23,110 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:23,110 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187213526] [2019-10-14 21:50:23,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:23,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:23,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:23,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:23,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:23,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:23,158 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187213526] [2019-10-14 21:50:23,159 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:50:23,159 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 21:50:23,159 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703480572] [2019-10-14 21:50:23,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 21:50:23,160 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:23,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 21:50:23,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 21:50:23,160 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand 5 states. [2019-10-14 21:50:23,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:23,274 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2019-10-14 21:50:23,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 21:50:23,275 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-10-14 21:50:23,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:23,276 INFO L225 Difference]: With dead ends: 67 [2019-10-14 21:50:23,276 INFO L226 Difference]: Without dead ends: 45 [2019-10-14 21:50:23,276 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 21:50:23,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-14 21:50:23,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2019-10-14 21:50:23,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-14 21:50:23,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2019-10-14 21:50:23,284 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 21 [2019-10-14 21:50:23,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:23,285 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2019-10-14 21:50:23,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 21:50:23,285 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2019-10-14 21:50:23,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-14 21:50:23,286 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:23,286 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:23,286 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:23,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:23,287 INFO L82 PathProgramCache]: Analyzing trace with hash 929638007, now seen corresponding path program 1 times [2019-10-14 21:50:23,287 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:23,287 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770338580] [2019-10-14 21:50:23,288 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:23,288 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:23,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:23,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:23,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:23,487 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-14 21:50:23,488 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770338580] [2019-10-14 21:50:23,488 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248070266] [2019-10-14 21:50:23,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:23,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:23,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-14 21:50:23,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:23,554 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-14 21:50:23,554 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:23,562 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:23,563 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:23,563 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-10-14 21:50:23,581 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2019-10-14 21:50:23,585 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:23,590 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:23,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:23,597 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2019-10-14 21:50:23,598 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:23,603 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:23,604 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:23,613 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:23,614 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:23,615 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:31 [2019-10-14 21:50:23,642 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:23,643 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:23,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:23,658 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:23,658 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-10-14 21:50:23,659 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:23,677 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:23,677 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:23,677 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-10-14 21:50:23,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:23,748 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-14 21:50:23,749 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:23,749 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2019-10-14 21:50:23,749 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162273015] [2019-10-14 21:50:23,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-14 21:50:23,750 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:23,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-14 21:50:23,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-10-14 21:50:23,751 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand 16 states. [2019-10-14 21:50:24,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:24,339 INFO L93 Difference]: Finished difference Result 78 states and 98 transitions. [2019-10-14 21:50:24,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-14 21:50:24,340 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-10-14 21:50:24,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:24,342 INFO L225 Difference]: With dead ends: 78 [2019-10-14 21:50:24,342 INFO L226 Difference]: Without dead ends: 76 [2019-10-14 21:50:24,343 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2019-10-14 21:50:24,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-14 21:50:24,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 53. [2019-10-14 21:50:24,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-14 21:50:24,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2019-10-14 21:50:24,354 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 21 [2019-10-14 21:50:24,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:24,354 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2019-10-14 21:50:24,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-14 21:50:24,354 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2019-10-14 21:50:24,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-14 21:50:24,356 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:24,357 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:24,563 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:24,563 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:24,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:24,563 INFO L82 PathProgramCache]: Analyzing trace with hash -755212347, now seen corresponding path program 1 times [2019-10-14 21:50:24,564 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:24,564 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912782798] [2019-10-14 21:50:24,564 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:24,564 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:24,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:24,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:24,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:24,629 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:24,629 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912782798] [2019-10-14 21:50:24,629 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:50:24,630 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 21:50:24,630 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901939170] [2019-10-14 21:50:24,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 21:50:24,630 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:24,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 21:50:24,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:50:24,631 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand 4 states. [2019-10-14 21:50:24,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:24,691 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2019-10-14 21:50:24,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 21:50:24,692 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-10-14 21:50:24,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:24,693 INFO L225 Difference]: With dead ends: 81 [2019-10-14 21:50:24,693 INFO L226 Difference]: Without dead ends: 59 [2019-10-14 21:50:24,693 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:50:24,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-14 21:50:24,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2019-10-14 21:50:24,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-14 21:50:24,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2019-10-14 21:50:24,703 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 26 [2019-10-14 21:50:24,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:24,704 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2019-10-14 21:50:24,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 21:50:24,704 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2019-10-14 21:50:24,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-14 21:50:24,705 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:24,705 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:24,706 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:24,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:24,707 INFO L82 PathProgramCache]: Analyzing trace with hash -607690423, now seen corresponding path program 1 times [2019-10-14 21:50:24,707 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:24,707 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310514869] [2019-10-14 21:50:24,707 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:24,707 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:24,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:24,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:24,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:24,760 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:24,761 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310514869] [2019-10-14 21:50:24,761 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:50:24,762 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 21:50:24,762 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283764653] [2019-10-14 21:50:24,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 21:50:24,763 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:24,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 21:50:24,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:50:24,765 INFO L87 Difference]: Start difference. First operand 53 states and 64 transitions. Second operand 4 states. [2019-10-14 21:50:24,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:24,838 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2019-10-14 21:50:24,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 21:50:24,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-10-14 21:50:24,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:24,839 INFO L225 Difference]: With dead ends: 75 [2019-10-14 21:50:24,839 INFO L226 Difference]: Without dead ends: 53 [2019-10-14 21:50:24,840 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:50:24,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-14 21:50:24,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2019-10-14 21:50:24,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-14 21:50:24,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2019-10-14 21:50:24,848 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 26 [2019-10-14 21:50:24,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:24,848 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2019-10-14 21:50:24,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 21:50:24,848 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2019-10-14 21:50:24,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-14 21:50:24,849 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:24,850 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:24,850 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:24,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:24,850 INFO L82 PathProgramCache]: Analyzing trace with hash 860723994, now seen corresponding path program 1 times [2019-10-14 21:50:24,850 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:24,851 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063580899] [2019-10-14 21:50:24,851 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:24,851 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:24,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:24,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:25,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:25,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:25,048 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:25,048 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063580899] [2019-10-14 21:50:25,048 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817005624] [2019-10-14 21:50:25,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:25,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:25,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-14 21:50:25,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:25,144 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-14 21:50:25,144 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:25,151 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:25,152 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-14 21:50:25,152 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-10-14 21:50:25,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:25,182 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-10-14 21:50:25,183 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:25,189 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:25,190 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-14 21:50:25,190 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2019-10-14 21:50:25,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:25,255 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:25,256 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:25,256 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2019-10-14 21:50:25,256 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459014088] [2019-10-14 21:50:25,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-14 21:50:25,257 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:25,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-14 21:50:25,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-10-14 21:50:25,258 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand 16 states. [2019-10-14 21:50:26,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:26,013 INFO L93 Difference]: Finished difference Result 120 states and 152 transitions. [2019-10-14 21:50:26,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-14 21:50:26,014 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-10-14 21:50:26,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:26,015 INFO L225 Difference]: With dead ends: 120 [2019-10-14 21:50:26,016 INFO L226 Difference]: Without dead ends: 104 [2019-10-14 21:50:26,017 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=238, Invalid=818, Unknown=0, NotChecked=0, Total=1056 [2019-10-14 21:50:26,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-10-14 21:50:26,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 58. [2019-10-14 21:50:26,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-14 21:50:26,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2019-10-14 21:50:26,028 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 30 [2019-10-14 21:50:26,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:26,028 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2019-10-14 21:50:26,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-14 21:50:26,029 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2019-10-14 21:50:26,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-14 21:50:26,030 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:26,030 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:26,234 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:26,234 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:26,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:26,235 INFO L82 PathProgramCache]: Analyzing trace with hash 43075544, now seen corresponding path program 1 times [2019-10-14 21:50:26,235 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:26,235 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023021461] [2019-10-14 21:50:26,236 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:26,236 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:26,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:26,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:26,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:26,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:26,278 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-14 21:50:26,279 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023021461] [2019-10-14 21:50:26,279 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:50:26,279 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 21:50:26,279 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261615175] [2019-10-14 21:50:26,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 21:50:26,280 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:26,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 21:50:26,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 21:50:26,281 INFO L87 Difference]: Start difference. First operand 58 states and 71 transitions. Second operand 5 states. [2019-10-14 21:50:26,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:26,368 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2019-10-14 21:50:26,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 21:50:26,368 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-10-14 21:50:26,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:26,369 INFO L225 Difference]: With dead ends: 91 [2019-10-14 21:50:26,370 INFO L226 Difference]: Without dead ends: 67 [2019-10-14 21:50:26,370 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 21:50:26,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-14 21:50:26,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 58. [2019-10-14 21:50:26,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-14 21:50:26,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2019-10-14 21:50:26,380 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 30 [2019-10-14 21:50:26,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:26,380 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2019-10-14 21:50:26,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 21:50:26,381 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2019-10-14 21:50:26,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-14 21:50:26,382 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:26,382 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:26,382 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:26,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:26,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1645868198, now seen corresponding path program 1 times [2019-10-14 21:50:26,383 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:26,383 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124767366] [2019-10-14 21:50:26,383 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:26,383 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:26,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:26,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:26,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:26,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:26,530 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:26,531 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124767366] [2019-10-14 21:50:26,531 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093883014] [2019-10-14 21:50:26,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:26,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:26,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-14 21:50:26,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:26,660 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-14 21:50:26,661 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:26,668 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:26,668 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:26,669 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-10-14 21:50:26,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:26,700 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-10-14 21:50:26,700 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:26,707 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:26,707 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:26,707 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-10-14 21:50:26,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:26,887 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:26,887 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:26,890 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2019-10-14 21:50:26,890 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036164309] [2019-10-14 21:50:26,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-14 21:50:26,891 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:26,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-14 21:50:26,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2019-10-14 21:50:26,892 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand 20 states. [2019-10-14 21:50:27,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:27,596 INFO L93 Difference]: Finished difference Result 131 states and 157 transitions. [2019-10-14 21:50:27,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-14 21:50:27,596 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2019-10-14 21:50:27,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:27,598 INFO L225 Difference]: With dead ends: 131 [2019-10-14 21:50:27,598 INFO L226 Difference]: Without dead ends: 129 [2019-10-14 21:50:27,599 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=178, Invalid=878, Unknown=0, NotChecked=0, Total=1056 [2019-10-14 21:50:27,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-10-14 21:50:27,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 102. [2019-10-14 21:50:27,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-10-14 21:50:27,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 124 transitions. [2019-10-14 21:50:27,619 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 124 transitions. Word has length 30 [2019-10-14 21:50:27,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:27,619 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 124 transitions. [2019-10-14 21:50:27,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-14 21:50:27,619 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 124 transitions. [2019-10-14 21:50:27,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-14 21:50:27,621 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:27,621 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:27,825 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:27,825 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:27,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:27,825 INFO L82 PathProgramCache]: Analyzing trace with hash 541288908, now seen corresponding path program 1 times [2019-10-14 21:50:27,826 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:27,826 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715752225] [2019-10-14 21:50:27,826 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:27,826 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:27,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:27,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:27,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:27,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:27,859 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-14 21:50:27,859 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715752225] [2019-10-14 21:50:27,860 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:50:27,860 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 21:50:27,860 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836807550] [2019-10-14 21:50:27,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 21:50:27,861 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:27,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 21:50:27,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:50:27,861 INFO L87 Difference]: Start difference. First operand 102 states and 124 transitions. Second operand 4 states. [2019-10-14 21:50:27,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:27,926 INFO L93 Difference]: Finished difference Result 126 states and 151 transitions. [2019-10-14 21:50:27,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 21:50:27,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-10-14 21:50:27,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:27,928 INFO L225 Difference]: With dead ends: 126 [2019-10-14 21:50:27,928 INFO L226 Difference]: Without dead ends: 102 [2019-10-14 21:50:27,929 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:50:27,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-10-14 21:50:27,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-10-14 21:50:27,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-10-14 21:50:27,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 122 transitions. [2019-10-14 21:50:27,944 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 122 transitions. Word has length 35 [2019-10-14 21:50:27,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:27,944 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 122 transitions. [2019-10-14 21:50:27,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 21:50:27,944 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 122 transitions. [2019-10-14 21:50:27,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-14 21:50:27,946 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:27,946 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:27,946 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:27,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:27,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1365472462, now seen corresponding path program 1 times [2019-10-14 21:50:27,947 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:27,947 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441815488] [2019-10-14 21:50:27,947 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:27,947 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:27,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:27,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:27,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:27,982 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-14 21:50:27,982 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441815488] [2019-10-14 21:50:27,983 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:50:27,983 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 21:50:27,983 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588902359] [2019-10-14 21:50:27,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 21:50:27,984 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:27,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 21:50:27,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:50:27,984 INFO L87 Difference]: Start difference. First operand 102 states and 122 transitions. Second operand 4 states. [2019-10-14 21:50:28,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:28,062 INFO L93 Difference]: Finished difference Result 121 states and 142 transitions. [2019-10-14 21:50:28,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 21:50:28,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-10-14 21:50:28,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:28,064 INFO L225 Difference]: With dead ends: 121 [2019-10-14 21:50:28,064 INFO L226 Difference]: Without dead ends: 97 [2019-10-14 21:50:28,064 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:50:28,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-10-14 21:50:28,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2019-10-14 21:50:28,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-10-14 21:50:28,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 114 transitions. [2019-10-14 21:50:28,081 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 114 transitions. Word has length 35 [2019-10-14 21:50:28,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:28,081 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 114 transitions. [2019-10-14 21:50:28,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 21:50:28,082 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 114 transitions. [2019-10-14 21:50:28,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-14 21:50:28,083 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:28,083 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:28,083 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:28,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:28,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1380382439, now seen corresponding path program 2 times [2019-10-14 21:50:28,084 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:28,084 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591945286] [2019-10-14 21:50:28,084 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:28,085 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:28,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:28,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:28,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:28,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:28,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:28,227 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 21:50:28,228 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591945286] [2019-10-14 21:50:28,228 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914559021] [2019-10-14 21:50:28,228 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:28,275 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 21:50:28,276 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:50:28,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-14 21:50:28,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:28,315 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-14 21:50:28,315 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:28,325 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:28,325 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:28,326 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2019-10-14 21:50:28,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:28,541 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 21:50:28,541 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:28,541 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-10-14 21:50:28,541 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604820003] [2019-10-14 21:50:28,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-14 21:50:28,543 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:28,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-14 21:50:28,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2019-10-14 21:50:28,544 INFO L87 Difference]: Start difference. First operand 96 states and 114 transitions. Second operand 18 states. [2019-10-14 21:50:29,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:29,402 INFO L93 Difference]: Finished difference Result 188 states and 223 transitions. [2019-10-14 21:50:29,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-14 21:50:29,402 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 39 [2019-10-14 21:50:29,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:29,404 INFO L225 Difference]: With dead ends: 188 [2019-10-14 21:50:29,404 INFO L226 Difference]: Without dead ends: 159 [2019-10-14 21:50:29,406 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=197, Invalid=795, Unknown=0, NotChecked=0, Total=992 [2019-10-14 21:50:29,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-10-14 21:50:29,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 129. [2019-10-14 21:50:29,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-10-14 21:50:29,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 153 transitions. [2019-10-14 21:50:29,436 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 153 transitions. Word has length 39 [2019-10-14 21:50:29,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:29,436 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 153 transitions. [2019-10-14 21:50:29,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-14 21:50:29,436 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 153 transitions. [2019-10-14 21:50:29,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-14 21:50:29,438 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:29,439 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:29,642 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:29,643 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:29,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:29,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1889855529, now seen corresponding path program 1 times [2019-10-14 21:50:29,643 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:29,643 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715803027] [2019-10-14 21:50:29,643 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:29,643 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:29,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:29,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:29,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:29,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:29,766 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 21:50:29,767 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715803027] [2019-10-14 21:50:29,767 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936831027] [2019-10-14 21:50:29,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:29,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:29,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-14 21:50:29,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:29,880 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-14 21:50:29,881 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:29,885 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:29,885 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:29,886 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-10-14 21:50:30,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:30,076 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 21:50:30,076 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:30,077 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2019-10-14 21:50:30,077 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691379281] [2019-10-14 21:50:30,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-14 21:50:30,078 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:30,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-14 21:50:30,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2019-10-14 21:50:30,078 INFO L87 Difference]: Start difference. First operand 129 states and 153 transitions. Second operand 21 states. [2019-10-14 21:50:31,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:31,022 INFO L93 Difference]: Finished difference Result 222 states and 258 transitions. [2019-10-14 21:50:31,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-14 21:50:31,022 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 39 [2019-10-14 21:50:31,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:31,024 INFO L225 Difference]: With dead ends: 222 [2019-10-14 21:50:31,024 INFO L226 Difference]: Without dead ends: 220 [2019-10-14 21:50:31,026 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=206, Invalid=1126, Unknown=0, NotChecked=0, Total=1332 [2019-10-14 21:50:31,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-10-14 21:50:31,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 170. [2019-10-14 21:50:31,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-10-14 21:50:31,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 200 transitions. [2019-10-14 21:50:31,049 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 200 transitions. Word has length 39 [2019-10-14 21:50:31,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:31,050 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 200 transitions. [2019-10-14 21:50:31,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-14 21:50:31,050 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 200 transitions. [2019-10-14 21:50:31,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-14 21:50:31,051 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:31,051 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:31,254 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:31,255 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:31,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:31,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1442834938, now seen corresponding path program 3 times [2019-10-14 21:50:31,256 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:31,256 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502190028] [2019-10-14 21:50:31,256 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:31,256 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:31,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:31,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:31,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:31,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:31,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:31,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:31,604 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 19 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-14 21:50:31,604 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502190028] [2019-10-14 21:50:31,605 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900871221] [2019-10-14 21:50:31,605 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:31,695 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-14 21:50:31,695 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:50:31,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-14 21:50:31,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:31,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 21:50:31,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:31,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:31,960 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-14 21:50:31,963 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:31,963 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2019-10-14 21:50:31,963 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756581570] [2019-10-14 21:50:31,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-14 21:50:31,964 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:31,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-14 21:50:31,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2019-10-14 21:50:31,966 INFO L87 Difference]: Start difference. First operand 170 states and 200 transitions. Second operand 19 states. [2019-10-14 21:50:32,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:32,422 INFO L93 Difference]: Finished difference Result 322 states and 370 transitions. [2019-10-14 21:50:32,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-14 21:50:32,427 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2019-10-14 21:50:32,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:32,429 INFO L225 Difference]: With dead ends: 322 [2019-10-14 21:50:32,429 INFO L226 Difference]: Without dead ends: 192 [2019-10-14 21:50:32,430 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=144, Invalid=506, Unknown=0, NotChecked=0, Total=650 [2019-10-14 21:50:32,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-10-14 21:50:32,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 179. [2019-10-14 21:50:32,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-10-14 21:50:32,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 208 transitions. [2019-10-14 21:50:32,450 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 208 transitions. Word has length 48 [2019-10-14 21:50:32,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:32,451 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 208 transitions. [2019-10-14 21:50:32,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-14 21:50:32,451 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 208 transitions. [2019-10-14 21:50:32,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-14 21:50:32,452 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:32,452 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:32,655 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:32,656 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:32,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:32,656 INFO L82 PathProgramCache]: Analyzing trace with hash 926233367, now seen corresponding path program 1 times [2019-10-14 21:50:32,656 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:32,656 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013913902] [2019-10-14 21:50:32,657 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:32,657 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:32,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:32,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:32,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:32,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:32,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:32,691 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-14 21:50:32,691 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013913902] [2019-10-14 21:50:32,691 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:50:32,691 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 21:50:32,692 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121330176] [2019-10-14 21:50:32,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 21:50:32,692 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:32,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 21:50:32,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:50:32,693 INFO L87 Difference]: Start difference. First operand 179 states and 208 transitions. Second operand 4 states. [2019-10-14 21:50:32,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:32,770 INFO L93 Difference]: Finished difference Result 218 states and 253 transitions. [2019-10-14 21:50:32,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 21:50:32,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-10-14 21:50:32,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:32,773 INFO L225 Difference]: With dead ends: 218 [2019-10-14 21:50:32,773 INFO L226 Difference]: Without dead ends: 152 [2019-10-14 21:50:32,775 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:50:32,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-10-14 21:50:32,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 149. [2019-10-14 21:50:32,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-10-14 21:50:32,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 171 transitions. [2019-10-14 21:50:32,793 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 171 transitions. Word has length 49 [2019-10-14 21:50:32,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:32,794 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 171 transitions. [2019-10-14 21:50:32,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 21:50:32,794 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 171 transitions. [2019-10-14 21:50:32,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-14 21:50:32,795 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:32,795 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:32,795 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:32,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:32,795 INFO L82 PathProgramCache]: Analyzing trace with hash 14766060, now seen corresponding path program 4 times [2019-10-14 21:50:32,796 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:32,796 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143196371] [2019-10-14 21:50:32,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:32,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:32,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:32,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:32,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:32,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:32,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:32,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:32,980 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 9 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-14 21:50:32,981 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143196371] [2019-10-14 21:50:32,981 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049946813] [2019-10-14 21:50:32,981 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:33,048 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-14 21:50:33,048 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:50:33,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-14 21:50:33,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:33,124 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-14 21:50:33,124 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:33,134 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:33,135 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-14 21:50:33,135 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-10-14 21:50:33,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:33,162 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-10-14 21:50:33,163 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:33,175 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:33,176 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-14 21:50:33,176 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-10-14 21:50:33,183 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:33,185 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-10-14 21:50:33,185 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:33,197 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:33,197 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-14 21:50:33,198 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:31 [2019-10-14 21:50:33,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:33,546 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 9 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-14 21:50:33,546 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:33,547 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2019-10-14 21:50:33,547 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352872263] [2019-10-14 21:50:33,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-14 21:50:33,547 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:33,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-14 21:50:33,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2019-10-14 21:50:33,548 INFO L87 Difference]: Start difference. First operand 149 states and 171 transitions. Second operand 24 states. [2019-10-14 21:50:34,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:34,941 INFO L93 Difference]: Finished difference Result 238 states and 270 transitions. [2019-10-14 21:50:34,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-14 21:50:34,942 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 53 [2019-10-14 21:50:34,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:34,944 INFO L225 Difference]: With dead ends: 238 [2019-10-14 21:50:34,944 INFO L226 Difference]: Without dead ends: 222 [2019-10-14 21:50:34,945 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 47 SyntacticMatches, 7 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=288, Invalid=1518, Unknown=0, NotChecked=0, Total=1806 [2019-10-14 21:50:34,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-10-14 21:50:34,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 154. [2019-10-14 21:50:34,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-10-14 21:50:34,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 177 transitions. [2019-10-14 21:50:34,966 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 177 transitions. Word has length 53 [2019-10-14 21:50:34,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:34,966 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 177 transitions. [2019-10-14 21:50:34,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-14 21:50:34,966 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 177 transitions. [2019-10-14 21:50:34,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-14 21:50:34,967 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:34,968 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:35,170 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:35,171 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:35,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:35,172 INFO L82 PathProgramCache]: Analyzing trace with hash 922444076, now seen corresponding path program 2 times [2019-10-14 21:50:35,172 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:35,172 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441738264] [2019-10-14 21:50:35,173 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:35,173 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:35,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:35,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:35,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:35,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:35,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:35,361 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 9 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-14 21:50:35,362 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441738264] [2019-10-14 21:50:35,362 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995995997] [2019-10-14 21:50:35,362 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:35,426 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 21:50:35,426 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:50:35,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-14 21:50:35,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:35,514 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-14 21:50:35,514 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:35,521 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:35,521 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-14 21:50:35,522 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-10-14 21:50:35,548 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:35,549 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-10-14 21:50:35,549 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:35,556 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:35,556 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-14 21:50:35,557 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-10-14 21:50:35,561 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:35,562 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-10-14 21:50:35,562 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:35,569 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:35,569 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:35,569 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-10-14 21:50:35,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:35,906 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 9 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-14 21:50:35,907 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:35,907 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2019-10-14 21:50:35,907 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34420838] [2019-10-14 21:50:35,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-14 21:50:35,908 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:35,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-14 21:50:35,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2019-10-14 21:50:35,909 INFO L87 Difference]: Start difference. First operand 154 states and 177 transitions. Second operand 25 states. [2019-10-14 21:50:38,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:38,904 INFO L93 Difference]: Finished difference Result 332 states and 390 transitions. [2019-10-14 21:50:38,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-14 21:50:38,906 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 53 [2019-10-14 21:50:38,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:38,908 INFO L225 Difference]: With dead ends: 332 [2019-10-14 21:50:38,908 INFO L226 Difference]: Without dead ends: 302 [2019-10-14 21:50:38,910 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 46 SyntacticMatches, 7 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1139 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=605, Invalid=3951, Unknown=0, NotChecked=0, Total=4556 [2019-10-14 21:50:38,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-10-14 21:50:38,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 198. [2019-10-14 21:50:38,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-10-14 21:50:38,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 229 transitions. [2019-10-14 21:50:38,945 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 229 transitions. Word has length 53 [2019-10-14 21:50:38,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:38,945 INFO L462 AbstractCegarLoop]: Abstraction has 198 states and 229 transitions. [2019-10-14 21:50:38,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-14 21:50:38,946 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 229 transitions. [2019-10-14 21:50:38,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-14 21:50:38,949 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:38,949 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:39,152 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:39,155 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:39,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:39,156 INFO L82 PathProgramCache]: Analyzing trace with hash -604096212, now seen corresponding path program 1 times [2019-10-14 21:50:39,156 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:39,156 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69636185] [2019-10-14 21:50:39,156 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:39,156 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:39,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:39,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:39,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:39,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:39,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:39,353 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-14 21:50:39,353 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69636185] [2019-10-14 21:50:39,353 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248527073] [2019-10-14 21:50:39,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:39,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:39,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-14 21:50:39,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:39,474 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-14 21:50:39,474 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:39,481 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:39,482 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:39,482 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-10-14 21:50:39,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:39,508 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-10-14 21:50:39,509 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:39,515 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:39,516 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:39,516 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-10-14 21:50:39,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:39,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:39,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:39,558 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:39,558 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-10-14 21:50:39,558 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:39,567 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:39,567 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:39,568 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-10-14 21:50:39,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:39,952 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-14 21:50:39,953 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:39,953 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 27 [2019-10-14 21:50:39,953 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854491869] [2019-10-14 21:50:39,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-14 21:50:39,954 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:39,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-14 21:50:39,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=594, Unknown=0, NotChecked=0, Total=702 [2019-10-14 21:50:39,954 INFO L87 Difference]: Start difference. First operand 198 states and 229 transitions. Second operand 27 states. [2019-10-14 21:50:41,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:41,510 INFO L93 Difference]: Finished difference Result 274 states and 317 transitions. [2019-10-14 21:50:41,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-14 21:50:41,510 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 53 [2019-10-14 21:50:41,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:41,512 INFO L225 Difference]: With dead ends: 274 [2019-10-14 21:50:41,513 INFO L226 Difference]: Without dead ends: 272 [2019-10-14 21:50:41,517 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 45 SyntacticMatches, 7 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=371, Invalid=2385, Unknown=0, NotChecked=0, Total=2756 [2019-10-14 21:50:41,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-10-14 21:50:41,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 220. [2019-10-14 21:50:41,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-10-14 21:50:41,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 259 transitions. [2019-10-14 21:50:41,561 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 259 transitions. Word has length 53 [2019-10-14 21:50:41,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:41,561 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 259 transitions. [2019-10-14 21:50:41,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-14 21:50:41,562 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 259 transitions. [2019-10-14 21:50:41,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-14 21:50:41,563 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:41,564 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:41,777 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:41,777 INFO L410 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:41,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:41,777 INFO L82 PathProgramCache]: Analyzing trace with hash 2102304903, now seen corresponding path program 5 times [2019-10-14 21:50:41,778 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:41,778 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296502176] [2019-10-14 21:50:41,778 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:41,778 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:41,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:41,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:41,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:41,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:41,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:41,985 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-14 21:50:41,986 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296502176] [2019-10-14 21:50:41,986 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422582981] [2019-10-14 21:50:41,986 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:42,074 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-10-14 21:50:42,074 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:50:42,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-14 21:50:42,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:42,124 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-14 21:50:42,124 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:42,130 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:42,130 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:42,131 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-10-14 21:50:42,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:42,162 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-10-14 21:50:42,163 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:42,170 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:42,171 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:42,171 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-10-14 21:50:42,236 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:42,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:42,239 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:42,241 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:42,241 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 43 [2019-10-14 21:50:42,242 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:42,256 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:42,257 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-14 21:50:42,257 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:31 [2019-10-14 21:50:42,265 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:42,267 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:42,268 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:42,269 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:42,269 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 40 [2019-10-14 21:50:42,270 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:42,279 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:42,279 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:42,280 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2019-10-14 21:50:42,315 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:42,316 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:42,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:42,319 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:42,320 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:42,321 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:42,322 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:42,323 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 40 [2019-10-14 21:50:42,323 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:42,330 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:42,330 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:42,331 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2019-10-14 21:50:42,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:42,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:42,983 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-14 21:50:42,984 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:42,984 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 30 [2019-10-14 21:50:42,984 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593662339] [2019-10-14 21:50:42,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-14 21:50:42,985 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:42,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-14 21:50:42,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=772, Unknown=0, NotChecked=0, Total=870 [2019-10-14 21:50:42,985 INFO L87 Difference]: Start difference. First operand 220 states and 259 transitions. Second operand 30 states.