java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_sentinel.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 17:47:15,967 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 17:47:15,970 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 17:47:15,988 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 17:47:15,989 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 17:47:15,991 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 17:47:15,992 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 17:47:16,002 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 17:47:16,006 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 17:47:16,010 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 17:47:16,012 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 17:47:16,014 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 17:47:16,014 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 17:47:16,016 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 17:47:16,019 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 17:47:16,020 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 17:47:16,022 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 17:47:16,022 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 17:47:16,024 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 17:47:16,029 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 17:47:16,034 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 17:47:16,037 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 17:47:16,040 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 17:47:16,041 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 17:47:16,043 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 17:47:16,044 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 17:47:16,044 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 17:47:16,046 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 17:47:16,047 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 17:47:16,048 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 17:47:16,048 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 17:47:16,049 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 17:47:16,050 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 17:47:16,051 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 17:47:16,053 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 17:47:16,053 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 17:47:16,054 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 17:47:16,054 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 17:47:16,054 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 17:47:16,055 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 17:47:16,056 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 17:47:16,057 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-13 17:47:16,091 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 17:47:16,091 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 17:47:16,096 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 17:47:16,097 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 17:47:16,097 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 17:47:16,097 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 17:47:16,097 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 17:47:16,098 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 17:47:16,098 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 17:47:16,098 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 17:47:16,098 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 17:47:16,098 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 17:47:16,099 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 17:47:16,099 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 17:47:16,099 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 17:47:16,099 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 17:47:16,099 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 17:47:16,100 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 17:47:16,100 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 17:47:16,101 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 17:47:16,101 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 17:47:16,101 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 17:47:16,101 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 17:47:16,102 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 17:47:16,102 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 17:47:16,102 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 17:47:16,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 17:47:16,103 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 17:47:16,103 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 17:47:16,406 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 17:47:16,424 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 17:47:16,427 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 17:47:16,429 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 17:47:16,429 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 17:47:16,430 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_sentinel.i.v+cfa-reducer.c [2019-10-13 17:47:16,504 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87b6c7dc3/e736409b71e742c8ad76262a406eb675/FLAG3be02a766 [2019-10-13 17:47:16,999 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 17:47:17,001 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_sentinel.i.v+cfa-reducer.c [2019-10-13 17:47:17,008 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87b6c7dc3/e736409b71e742c8ad76262a406eb675/FLAG3be02a766 [2019-10-13 17:47:17,395 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87b6c7dc3/e736409b71e742c8ad76262a406eb675 [2019-10-13 17:47:17,406 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 17:47:17,407 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 17:47:17,408 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 17:47:17,409 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 17:47:17,412 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 17:47:17,413 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:47:17" (1/1) ... [2019-10-13 17:47:17,416 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f69be82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:47:17, skipping insertion in model container [2019-10-13 17:47:17,417 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:47:17" (1/1) ... [2019-10-13 17:47:17,425 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 17:47:17,450 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 17:47:17,634 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 17:47:17,639 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 17:47:17,659 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 17:47:17,677 INFO L192 MainTranslator]: Completed translation [2019-10-13 17:47:17,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:47:17 WrapperNode [2019-10-13 17:47:17,678 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 17:47:17,678 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 17:47:17,678 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 17:47:17,679 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 17:47:17,779 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:47:17" (1/1) ... [2019-10-13 17:47:17,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:47:17" (1/1) ... [2019-10-13 17:47:17,786 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:47:17" (1/1) ... [2019-10-13 17:47:17,787 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:47:17" (1/1) ... [2019-10-13 17:47:17,796 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:47:17" (1/1) ... [2019-10-13 17:47:17,801 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:47:17" (1/1) ... [2019-10-13 17:47:17,802 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:47:17" (1/1) ... [2019-10-13 17:47:17,804 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 17:47:17,804 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 17:47:17,805 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 17:47:17,805 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 17:47:17,806 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:47:17" (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-13 17:47:17,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 17:47:17,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 17:47:17,856 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 17:47:17,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 17:47:17,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 17:47:17,857 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 17:47:17,857 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 17:47:17,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 17:47:17,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 17:47:17,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 17:47:17,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 17:47:17,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 17:47:17,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 17:47:18,119 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 17:47:18,120 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 17:47:18,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:47:18 BoogieIcfgContainer [2019-10-13 17:47:18,122 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 17:47:18,124 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 17:47:18,124 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 17:47:18,133 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 17:47:18,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:47:17" (1/3) ... [2019-10-13 17:47:18,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@127fc740 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:47:18, skipping insertion in model container [2019-10-13 17:47:18,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:47:17" (2/3) ... [2019-10-13 17:47:18,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@127fc740 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:47:18, skipping insertion in model container [2019-10-13 17:47:18,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:47:18" (3/3) ... [2019-10-13 17:47:18,137 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_sentinel.i.v+cfa-reducer.c [2019-10-13 17:47:18,147 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 17:47:18,158 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 17:47:18,179 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 17:47:18,201 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 17:47:18,201 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 17:47:18,201 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 17:47:18,201 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 17:47:18,202 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 17:47:18,202 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 17:47:18,202 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 17:47:18,202 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 17:47:18,218 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-10-13 17:47:18,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 17:47:18,223 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:47:18,224 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:47:18,226 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:47:18,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:47:18,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1429065311, now seen corresponding path program 1 times [2019-10-13 17:47:18,238 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:47:18,239 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240403466] [2019-10-13 17:47:18,239 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:18,239 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:18,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:47:18,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:18,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:18,425 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-13 17:47:18,426 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240403466] [2019-10-13 17:47:18,427 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 17:47:18,427 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 17:47:18,427 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144764554] [2019-10-13 17:47:18,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 17:47:18,432 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:47:18,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 17:47:18,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 17:47:18,453 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2019-10-13 17:47:18,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:47:18,574 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2019-10-13 17:47:18,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 17:47:18,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-13 17:47:18,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:47:18,589 INFO L225 Difference]: With dead ends: 30 [2019-10-13 17:47:18,590 INFO L226 Difference]: Without dead ends: 15 [2019-10-13 17:47:18,596 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 17:47:18,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-10-13 17:47:18,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-10-13 17:47:18,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-13 17:47:18,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-10-13 17:47:18,652 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2019-10-13 17:47:18,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:47:18,653 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-10-13 17:47:18,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 17:47:18,653 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-10-13 17:47:18,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 17:47:18,656 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:47:18,656 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:47:18,657 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:47:18,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:47:18,658 INFO L82 PathProgramCache]: Analyzing trace with hash 399010521, now seen corresponding path program 1 times [2019-10-13 17:47:18,659 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:47:18,660 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529639867] [2019-10-13 17:47:18,661 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:18,661 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:18,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:47:18,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:18,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:18,784 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-13 17:47:18,785 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529639867] [2019-10-13 17:47:18,785 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 17:47:18,786 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 17:47:18,786 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594727863] [2019-10-13 17:47:18,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 17:47:18,788 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:47:18,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 17:47:18,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 17:47:18,789 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 4 states. [2019-10-13 17:47:18,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:47:18,844 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2019-10-13 17:47:18,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 17:47:18,845 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-13 17:47:18,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:47:18,847 INFO L225 Difference]: With dead ends: 24 [2019-10-13 17:47:18,847 INFO L226 Difference]: Without dead ends: 17 [2019-10-13 17:47:18,848 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-13 17:47:18,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-10-13 17:47:18,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-10-13 17:47:18,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-10-13 17:47:18,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-10-13 17:47:18,855 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 13 [2019-10-13 17:47:18,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:47:18,855 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-10-13 17:47:18,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 17:47:18,856 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-10-13 17:47:18,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 17:47:18,856 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:47:18,857 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:47:18,857 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:47:18,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:47:18,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1207654839, now seen corresponding path program 1 times [2019-10-13 17:47:18,858 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:47:18,858 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088634033] [2019-10-13 17:47:18,858 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:18,859 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:18,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:47:18,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:18,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:18,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 17:47:18,966 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088634033] [2019-10-13 17:47:18,967 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 17:47:18,967 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 17:47:18,967 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696753347] [2019-10-13 17:47:18,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 17:47:18,968 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:47:18,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 17:47:18,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-13 17:47:18,969 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 6 states. [2019-10-13 17:47:19,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:47:19,061 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-10-13 17:47:19,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 17:47:19,061 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-10-13 17:47:19,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:47:19,062 INFO L225 Difference]: With dead ends: 21 [2019-10-13 17:47:19,062 INFO L226 Difference]: Without dead ends: 18 [2019-10-13 17:47:19,063 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-13 17:47:19,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-10-13 17:47:19,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-13 17:47:19,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-13 17:47:19,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-10-13 17:47:19,072 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 15 [2019-10-13 17:47:19,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:47:19,073 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-10-13 17:47:19,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 17:47:19,074 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-10-13 17:47:19,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 17:47:19,075 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:47:19,075 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:47:19,075 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:47:19,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:47:19,076 INFO L82 PathProgramCache]: Analyzing trace with hash 913042234, now seen corresponding path program 1 times [2019-10-13 17:47:19,076 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:47:19,077 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903404136] [2019-10-13 17:47:19,077 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:19,077 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:19,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:47:19,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:19,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:19,181 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 17:47:19,182 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903404136] [2019-10-13 17:47:19,182 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602647202] [2019-10-13 17:47:19,182 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-13 17:47:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:19,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 17:47:19,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:47:19,287 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 17:47:19,287 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:47:19,287 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2019-10-13 17:47:19,288 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280176749] [2019-10-13 17:47:19,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 17:47:19,289 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:47:19,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 17:47:19,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 17:47:19,290 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 6 states. [2019-10-13 17:47:19,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:47:19,362 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-10-13 17:47:19,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 17:47:19,362 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-10-13 17:47:19,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:47:19,363 INFO L225 Difference]: With dead ends: 30 [2019-10-13 17:47:19,363 INFO L226 Difference]: Without dead ends: 21 [2019-10-13 17:47:19,364 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 17:47:19,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-13 17:47:19,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-10-13 17:47:19,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-13 17:47:19,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-10-13 17:47:19,370 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2019-10-13 17:47:19,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:47:19,370 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-10-13 17:47:19,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 17:47:19,370 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-10-13 17:47:19,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 17:47:19,371 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:47:19,371 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:47:19,576 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:19,578 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:47:19,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:47:19,578 INFO L82 PathProgramCache]: Analyzing trace with hash 598752024, now seen corresponding path program 2 times [2019-10-13 17:47:19,578 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:47:19,579 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450626226] [2019-10-13 17:47:19,579 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:19,579 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:19,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:47:19,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:19,672 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 17:47:19,672 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450626226] [2019-10-13 17:47:19,672 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919873204] [2019-10-13 17:47:19,672 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 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-13 17:47:19,737 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-13 17:47:19,738 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 17:47:19,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 17:47:19,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:47:19,761 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 17:47:19,761 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:47:19,762 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-10-13 17:47:19,762 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69554489] [2019-10-13 17:47:19,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 17:47:19,763 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:47:19,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 17:47:19,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-13 17:47:19,765 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 7 states. [2019-10-13 17:47:19,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:47:19,824 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2019-10-13 17:47:19,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 17:47:19,824 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-10-13 17:47:19,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:47:19,825 INFO L225 Difference]: With dead ends: 32 [2019-10-13 17:47:19,825 INFO L226 Difference]: Without dead ends: 23 [2019-10-13 17:47:19,826 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-13 17:47:19,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-10-13 17:47:19,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-10-13 17:47:19,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-13 17:47:19,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2019-10-13 17:47:19,831 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 19 [2019-10-13 17:47:19,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:47:19,831 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2019-10-13 17:47:19,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 17:47:19,832 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2019-10-13 17:47:19,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 17:47:19,832 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:47:19,833 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:47:20,040 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:20,041 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:47:20,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:47:20,041 INFO L82 PathProgramCache]: Analyzing trace with hash -786429066, now seen corresponding path program 3 times [2019-10-13 17:47:20,042 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:47:20,042 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995626301] [2019-10-13 17:47:20,042 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:20,043 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:20,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:47:20,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:20,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:20,117 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 17:47:20,117 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995626301] [2019-10-13 17:47:20,118 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424386657] [2019-10-13 17:47:20,118 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 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-13 17:47:20,198 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-13 17:47:20,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 17:47:20,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-13 17:47:20,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:47:20,275 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-10-13 17:47:20,275 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:47:20,283 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:47:20,284 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 17:47:20,284 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-10-13 17:47:20,324 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:47:20,324 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2019-10-13 17:47:20,325 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-13 17:47:20,336 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:47:20,338 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 17:47:20,339 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:23 [2019-10-13 17:47:20,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:20,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:20,431 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-13 17:47:20,433 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:47:20,434 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-10-13 17:47:20,434 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801645234] [2019-10-13 17:47:20,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 17:47:20,435 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:47:20,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 17:47:20,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-10-13 17:47:20,435 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 12 states. [2019-10-13 17:47:20,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:47:20,567 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-10-13 17:47:20,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 17:47:20,567 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-10-13 17:47:20,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:47:20,568 INFO L225 Difference]: With dead ends: 37 [2019-10-13 17:47:20,569 INFO L226 Difference]: Without dead ends: 27 [2019-10-13 17:47:20,569 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-10-13 17:47:20,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-13 17:47:20,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-10-13 17:47:20,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-13 17:47:20,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-10-13 17:47:20,577 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 21 [2019-10-13 17:47:20,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:47:20,577 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-10-13 17:47:20,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 17:47:20,578 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-10-13 17:47:20,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 17:47:20,580 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:47:20,580 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:47:20,780 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:20,781 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:47:20,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:47:20,782 INFO L82 PathProgramCache]: Analyzing trace with hash -547382633, now seen corresponding path program 4 times [2019-10-13 17:47:20,782 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:47:20,782 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327766635] [2019-10-13 17:47:20,783 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:20,783 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:20,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:47:20,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:20,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:20,895 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 17:47:20,896 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327766635] [2019-10-13 17:47:20,896 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910287303] [2019-10-13 17:47:20,896 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 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-13 17:47:20,944 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 17:47:20,945 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 17:47:20,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 17:47:20,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:47:20,962 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 17:47:20,963 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:47:20,963 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2019-10-13 17:47:20,963 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795764762] [2019-10-13 17:47:20,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 17:47:20,964 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:47:20,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 17:47:20,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-10-13 17:47:20,965 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 9 states. [2019-10-13 17:47:21,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:47:21,024 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2019-10-13 17:47:21,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 17:47:21,024 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-10-13 17:47:21,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:47:21,025 INFO L225 Difference]: With dead ends: 40 [2019-10-13 17:47:21,025 INFO L226 Difference]: Without dead ends: 29 [2019-10-13 17:47:21,026 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-10-13 17:47:21,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-13 17:47:21,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-10-13 17:47:21,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-13 17:47:21,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-10-13 17:47:21,031 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 25 [2019-10-13 17:47:21,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:47:21,032 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-10-13 17:47:21,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 17:47:21,032 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-10-13 17:47:21,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 17:47:21,032 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:47:21,033 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:47:21,233 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:21,234 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:47:21,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:47:21,235 INFO L82 PathProgramCache]: Analyzing trace with hash -96654219, now seen corresponding path program 5 times [2019-10-13 17:47:21,235 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:47:21,236 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417844937] [2019-10-13 17:47:21,236 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:21,237 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:21,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:47:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:21,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:21,353 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 17:47:21,353 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417844937] [2019-10-13 17:47:21,353 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324661789] [2019-10-13 17:47:21,354 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 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-13 17:47:21,415 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-10-13 17:47:21,415 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 17:47:21,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-13 17:47:21,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:47:21,438 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 17:47:21,439 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:47:21,439 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2019-10-13 17:47:21,439 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006218088] [2019-10-13 17:47:21,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 17:47:21,440 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:47:21,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 17:47:21,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-10-13 17:47:21,441 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 10 states. [2019-10-13 17:47:21,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:47:21,504 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-10-13 17:47:21,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 17:47:21,506 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-10-13 17:47:21,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:47:21,507 INFO L225 Difference]: With dead ends: 42 [2019-10-13 17:47:21,507 INFO L226 Difference]: Without dead ends: 31 [2019-10-13 17:47:21,507 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-10-13 17:47:21,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-13 17:47:21,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-10-13 17:47:21,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-13 17:47:21,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-10-13 17:47:21,518 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 27 [2019-10-13 17:47:21,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:47:21,523 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-10-13 17:47:21,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 17:47:21,523 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-10-13 17:47:21,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 17:47:21,524 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:47:21,525 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:47:21,730 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:21,731 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:47:21,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:47:21,731 INFO L82 PathProgramCache]: Analyzing trace with hash -738345261, now seen corresponding path program 6 times [2019-10-13 17:47:21,731 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:47:21,731 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238952219] [2019-10-13 17:47:21,731 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:21,731 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:21,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:47:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:21,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:21,836 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 17:47:21,836 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238952219] [2019-10-13 17:47:21,836 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934851494] [2019-10-13 17:47:21,837 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE 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-13 17:47:21,888 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-10-13 17:47:21,889 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 17:47:21,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-13 17:47:21,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:47:21,913 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-10-13 17:47:21,913 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:47:21,920 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:47:21,921 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 17:47:21,921 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-10-13 17:47:22,030 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:47:22,031 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 59 [2019-10-13 17:47:22,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:22,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:22,034 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:47:22,053 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:47:22,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:22,059 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-10-13 17:47:22,060 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:237 [2019-10-13 17:47:22,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:22,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:22,194 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 17:47:22,194 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:47:22,194 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2019-10-13 17:47:22,194 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377940345] [2019-10-13 17:47:22,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-13 17:47:22,195 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:47:22,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-13 17:47:22,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-10-13 17:47:22,196 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 17 states. [2019-10-13 17:47:22,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:47:22,405 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2019-10-13 17:47:22,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-13 17:47:22,405 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2019-10-13 17:47:22,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:47:22,406 INFO L225 Difference]: With dead ends: 47 [2019-10-13 17:47:22,406 INFO L226 Difference]: Without dead ends: 35 [2019-10-13 17:47:22,407 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-10-13 17:47:22,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-13 17:47:22,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-10-13 17:47:22,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-13 17:47:22,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2019-10-13 17:47:22,412 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 29 [2019-10-13 17:47:22,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:47:22,413 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2019-10-13 17:47:22,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-13 17:47:22,413 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2019-10-13 17:47:22,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-13 17:47:22,414 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:47:22,414 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:47:22,620 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:22,621 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:47:22,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:47:22,621 INFO L82 PathProgramCache]: Analyzing trace with hash -742544204, now seen corresponding path program 7 times [2019-10-13 17:47:22,622 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:47:22,622 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652416751] [2019-10-13 17:47:22,622 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:22,623 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:22,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:47:22,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:22,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:22,759 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 17:47:22,760 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652416751] [2019-10-13 17:47:22,760 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72204541] [2019-10-13 17:47:22,760 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 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-13 17:47:22,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:22,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-13 17:47:22,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:47:22,847 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 17:47:22,847 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:47:22,848 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2019-10-13 17:47:22,848 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602204748] [2019-10-13 17:47:22,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 17:47:22,848 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:47:22,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 17:47:22,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-10-13 17:47:22,849 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 12 states. [2019-10-13 17:47:22,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:47:22,901 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2019-10-13 17:47:22,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 17:47:22,902 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2019-10-13 17:47:22,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:47:22,902 INFO L225 Difference]: With dead ends: 50 [2019-10-13 17:47:22,902 INFO L226 Difference]: Without dead ends: 37 [2019-10-13 17:47:22,903 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-10-13 17:47:22,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-13 17:47:22,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-10-13 17:47:22,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-13 17:47:22,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-10-13 17:47:22,909 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 33 [2019-10-13 17:47:22,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:47:22,909 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-10-13 17:47:22,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 17:47:22,909 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-10-13 17:47:22,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-13 17:47:22,910 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:47:22,910 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:47:23,120 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:23,121 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:47:23,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:47:23,121 INFO L82 PathProgramCache]: Analyzing trace with hash 399671442, now seen corresponding path program 8 times [2019-10-13 17:47:23,121 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:47:23,122 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133136282] [2019-10-13 17:47:23,122 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:23,123 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:23,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:47:23,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:23,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:23,292 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 17:47:23,292 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133136282] [2019-10-13 17:47:23,293 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133549079] [2019-10-13 17:47:23,293 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 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-13 17:47:23,361 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-13 17:47:23,362 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 17:47:23,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-13 17:47:23,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:47:23,397 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 17:47:23,397 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:47:23,397 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2019-10-13 17:47:23,397 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635772222] [2019-10-13 17:47:23,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-13 17:47:23,399 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:47:23,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-13 17:47:23,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-10-13 17:47:23,400 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 13 states. [2019-10-13 17:47:23,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:47:23,480 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2019-10-13 17:47:23,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 17:47:23,480 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 35 [2019-10-13 17:47:23,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:47:23,483 INFO L225 Difference]: With dead ends: 52 [2019-10-13 17:47:23,485 INFO L226 Difference]: Without dead ends: 39 [2019-10-13 17:47:23,486 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-10-13 17:47:23,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-13 17:47:23,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-10-13 17:47:23,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-13 17:47:23,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-10-13 17:47:23,496 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 35 [2019-10-13 17:47:23,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:47:23,496 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-10-13 17:47:23,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-13 17:47:23,498 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-10-13 17:47:23,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-13 17:47:23,498 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:47:23,499 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:47:23,699 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:23,700 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:47:23,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:47:23,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1442720528, now seen corresponding path program 9 times [2019-10-13 17:47:23,700 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:47:23,700 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184834973] [2019-10-13 17:47:23,700 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:23,701 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:23,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:47:23,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:23,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:23,816 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 17:47:23,817 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184834973] [2019-10-13 17:47:23,817 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620413082] [2019-10-13 17:47:23,817 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 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-13 17:47:23,879 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-13 17:47:23,880 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 17:47:23,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-13 17:47:23,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:47:23,913 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-10-13 17:47:23,914 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:47:23,919 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:47:23,920 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 17:47:23,920 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-10-13 17:47:24,103 INFO L341 Elim1Store]: treesize reduction 10, result has 87.3 percent of original size [2019-10-13 17:47:24,104 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 83 [2019-10-13 17:47:24,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:24,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:24,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:24,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:24,110 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:47:24,207 INFO L567 ElimStorePlain]: treesize reduction 8, result has 91.9 percent of original size [2019-10-13 17:47:24,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:24,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:24,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:24,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:24,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:24,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:24,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:24,221 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 17:47:24,221 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:91 [2019-10-13 17:47:24,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:24,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:24,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:24,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:24,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:24,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:24,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:24,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:24,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:24,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:24,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:24,382 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-10-13 17:47:24,382 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:47:24,383 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2019-10-13 17:47:24,383 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339092775] [2019-10-13 17:47:24,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-13 17:47:24,383 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:47:24,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-13 17:47:24,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2019-10-13 17:47:24,384 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 22 states. [2019-10-13 17:47:24,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:47:24,706 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2019-10-13 17:47:24,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-13 17:47:24,707 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 37 [2019-10-13 17:47:24,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:47:24,708 INFO L225 Difference]: With dead ends: 57 [2019-10-13 17:47:24,708 INFO L226 Difference]: Without dead ends: 43 [2019-10-13 17:47:24,709 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2019-10-13 17:47:24,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-13 17:47:24,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-10-13 17:47:24,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-13 17:47:24,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-10-13 17:47:24,714 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 37 [2019-10-13 17:47:24,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:47:24,714 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-10-13 17:47:24,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-13 17:47:24,714 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2019-10-13 17:47:24,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-13 17:47:24,715 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:47:24,715 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:47:24,918 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:24,919 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:47:24,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:47:24,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1202556527, now seen corresponding path program 10 times [2019-10-13 17:47:24,920 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:47:24,920 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627550056] [2019-10-13 17:47:24,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:24,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:24,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:47:24,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:25,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:25,036 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-13 17:47:25,036 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627550056] [2019-10-13 17:47:25,037 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636778344] [2019-10-13 17:47:25,037 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 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-13 17:47:25,093 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 17:47:25,094 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 17:47:25,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-13 17:47:25,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:47:25,126 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-13 17:47:25,127 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:47:25,127 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 15 [2019-10-13 17:47:25,127 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735789960] [2019-10-13 17:47:25,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-13 17:47:25,128 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:47:25,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-13 17:47:25,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2019-10-13 17:47:25,129 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 15 states. [2019-10-13 17:47:25,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:47:25,217 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2019-10-13 17:47:25,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 17:47:25,217 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2019-10-13 17:47:25,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:47:25,218 INFO L225 Difference]: With dead ends: 60 [2019-10-13 17:47:25,219 INFO L226 Difference]: Without dead ends: 45 [2019-10-13 17:47:25,219 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2019-10-13 17:47:25,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-13 17:47:25,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-10-13 17:47:25,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-13 17:47:25,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-10-13 17:47:25,226 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 41 [2019-10-13 17:47:25,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:47:25,226 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-10-13 17:47:25,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-13 17:47:25,226 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-10-13 17:47:25,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-13 17:47:25,227 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:47:25,227 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:47:25,433 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:25,434 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:47:25,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:47:25,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1556314257, now seen corresponding path program 11 times [2019-10-13 17:47:25,434 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:47:25,434 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160979387] [2019-10-13 17:47:25,435 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:25,435 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:25,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:47:25,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:25,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:25,607 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-13 17:47:25,608 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160979387] [2019-10-13 17:47:25,608 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445213670] [2019-10-13 17:47:25,608 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-13 17:47:25,690 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-10-13 17:47:25,690 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 17:47:25,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-13 17:47:25,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:47:25,713 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-13 17:47:25,714 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:47:25,714 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 16 [2019-10-13 17:47:25,714 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878394826] [2019-10-13 17:47:25,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-13 17:47:25,715 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:47:25,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-13 17:47:25,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2019-10-13 17:47:25,715 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 16 states. [2019-10-13 17:47:25,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:47:25,800 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2019-10-13 17:47:25,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 17:47:25,801 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2019-10-13 17:47:25,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:47:25,802 INFO L225 Difference]: With dead ends: 62 [2019-10-13 17:47:25,802 INFO L226 Difference]: Without dead ends: 47 [2019-10-13 17:47:25,802 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2019-10-13 17:47:25,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-13 17:47:25,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-10-13 17:47:25,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-13 17:47:25,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2019-10-13 17:47:25,807 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 43 [2019-10-13 17:47:25,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:47:25,808 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2019-10-13 17:47:25,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-13 17:47:25,808 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2019-10-13 17:47:25,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-13 17:47:25,809 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:47:25,809 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:47:26,013 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:26,013 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:47:26,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:47:26,014 INFO L82 PathProgramCache]: Analyzing trace with hash 2079890893, now seen corresponding path program 12 times [2019-10-13 17:47:26,014 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:47:26,015 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357393981] [2019-10-13 17:47:26,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:26,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:26,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:47:26,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:26,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:26,166 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-13 17:47:26,166 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357393981] [2019-10-13 17:47:26,166 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128630441] [2019-10-13 17:47:26,167 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:26,259 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-10-13 17:47:26,259 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 17:47:26,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-13 17:47:26,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:47:26,290 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-10-13 17:47:26,290 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:47:26,295 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:47:26,295 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 17:47:26,295 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-10-13 17:47:27,715 INFO L341 Elim1Store]: treesize reduction 17, result has 88.6 percent of original size [2019-10-13 17:47:27,716 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 150 [2019-10-13 17:47:27,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:27,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:27,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:27,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:27,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:27,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:27,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:27,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:27,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:27,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:27,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:27,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:27,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:27,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:27,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:27,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:27,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:27,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:27,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:27,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:27,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:27,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:27,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:27,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:27,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:27,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:27,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:27,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:27,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:27,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:27,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:27,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:27,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:27,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:27,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:27,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:27,746 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:47:27,959 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 42 [2019-10-13 17:47:27,959 INFO L567 ElimStorePlain]: treesize reduction 523, result has 16.3 percent of original size [2019-10-13 17:47:27,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:27,966 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 12 dim-0 vars, and 1 xjuncts. [2019-10-13 17:47:27,966 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:67, output treesize:545 [2019-10-13 17:47:28,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:28,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:28,167 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-10-13 17:47:28,167 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:47:28,167 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 27 [2019-10-13 17:47:28,168 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753834144] [2019-10-13 17:47:28,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-13 17:47:28,168 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:47:28,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-13 17:47:28,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=550, Unknown=3, NotChecked=0, Total=702 [2019-10-13 17:47:28,169 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 27 states. [2019-10-13 17:47:30,774 WARN L191 SmtUtils]: Spent 815.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-10-13 17:47:33,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:47:33,034 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-10-13 17:47:33,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-13 17:47:33,034 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 45 [2019-10-13 17:47:33,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:47:33,036 INFO L225 Difference]: With dead ends: 67 [2019-10-13 17:47:33,036 INFO L226 Difference]: Without dead ends: 51 [2019-10-13 17:47:33,037 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=195, Invalid=855, Unknown=6, NotChecked=0, Total=1056 [2019-10-13 17:47:33,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-13 17:47:33,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-10-13 17:47:33,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-13 17:47:33,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-10-13 17:47:33,043 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 45 [2019-10-13 17:47:33,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:47:33,044 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-10-13 17:47:33,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-13 17:47:33,044 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-10-13 17:47:33,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-13 17:47:33,044 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:47:33,045 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:47:33,245 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:33,246 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:47:33,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:47:33,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1240057554, now seen corresponding path program 13 times [2019-10-13 17:47:33,246 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:47:33,247 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631629575] [2019-10-13 17:47:33,247 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:33,247 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:33,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:47:33,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:33,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:33,417 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-13 17:47:33,418 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631629575] [2019-10-13 17:47:33,418 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775760003] [2019-10-13 17:47:33,418 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:33,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:33,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-13 17:47:33,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:47:33,494 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-13 17:47:33,494 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:47:33,495 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 18 [2019-10-13 17:47:33,495 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063692090] [2019-10-13 17:47:33,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-13 17:47:33,496 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:47:33,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-13 17:47:33,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2019-10-13 17:47:33,496 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 18 states. [2019-10-13 17:47:33,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:47:33,613 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2019-10-13 17:47:33,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-13 17:47:33,613 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 49 [2019-10-13 17:47:33,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:47:33,614 INFO L225 Difference]: With dead ends: 70 [2019-10-13 17:47:33,614 INFO L226 Difference]: Without dead ends: 53 [2019-10-13 17:47:33,615 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2019-10-13 17:47:33,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-13 17:47:33,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-10-13 17:47:33,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-13 17:47:33,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2019-10-13 17:47:33,625 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 49 [2019-10-13 17:47:33,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:47:33,625 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2019-10-13 17:47:33,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-13 17:47:33,625 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2019-10-13 17:47:33,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-13 17:47:33,626 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:47:33,626 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:47:33,836 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:33,837 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:47:33,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:47:33,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1198756108, now seen corresponding path program 14 times [2019-10-13 17:47:33,838 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:47:33,838 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020760291] [2019-10-13 17:47:33,838 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:33,839 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:33,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:47:33,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:34,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:34,011 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-13 17:47:34,011 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020760291] [2019-10-13 17:47:34,011 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155221032] [2019-10-13 17:47:34,011 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:34,064 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-13 17:47:34,064 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 17:47:34,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-13 17:47:34,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:47:34,085 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-13 17:47:34,085 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:47:34,085 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 19 [2019-10-13 17:47:34,086 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873509621] [2019-10-13 17:47:34,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-13 17:47:34,086 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:47:34,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-13 17:47:34,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2019-10-13 17:47:34,087 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 19 states. [2019-10-13 17:47:34,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:47:34,157 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2019-10-13 17:47:34,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-13 17:47:34,158 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51 [2019-10-13 17:47:34,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:47:34,158 INFO L225 Difference]: With dead ends: 72 [2019-10-13 17:47:34,159 INFO L226 Difference]: Without dead ends: 55 [2019-10-13 17:47:34,159 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2019-10-13 17:47:34,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-13 17:47:34,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2019-10-13 17:47:34,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-13 17:47:34,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2019-10-13 17:47:34,165 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 51 [2019-10-13 17:47:34,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:47:34,165 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2019-10-13 17:47:34,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-13 17:47:34,166 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2019-10-13 17:47:34,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-13 17:47:34,166 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:47:34,167 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:47:34,370 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:34,371 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:47:34,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:47:34,372 INFO L82 PathProgramCache]: Analyzing trace with hash -153458326, now seen corresponding path program 15 times [2019-10-13 17:47:34,372 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:47:34,372 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147494274] [2019-10-13 17:47:34,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:34,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:34,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:47:34,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:34,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:34,594 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-13 17:47:34,594 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147494274] [2019-10-13 17:47:34,594 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046849019] [2019-10-13 17:47:34,595 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:34,660 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-13 17:47:34,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 17:47:34,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 37 conjunts are in the unsatisfiable core [2019-10-13 17:47:34,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:47:34,695 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-10-13 17:47:34,695 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:47:34,704 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:47:34,704 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 17:47:34,705 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-10-13 17:47:35,281 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2019-10-13 17:47:35,282 INFO L341 Elim1Store]: treesize reduction 62, result has 71.9 percent of original size [2019-10-13 17:47:35,282 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 67 treesize of output 181 [2019-10-13 17:47:35,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,339 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:47:35,534 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 32 [2019-10-13 17:47:35,535 INFO L567 ElimStorePlain]: treesize reduction 1251, result has 5.2 percent of original size [2019-10-13 17:47:35,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,537 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 17:47:35,537 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:73, output treesize:67 [2019-10-13 17:47:35,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:35,696 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-10-13 17:47:35,697 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:47:35,697 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 32 [2019-10-13 17:47:35,697 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916216794] [2019-10-13 17:47:35,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-13 17:47:35,698 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:47:35,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-13 17:47:35,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=796, Unknown=0, NotChecked=0, Total=992 [2019-10-13 17:47:35,700 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 32 states. [2019-10-13 17:47:36,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:47:36,172 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2019-10-13 17:47:36,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-13 17:47:36,173 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 53 [2019-10-13 17:47:36,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:47:36,173 INFO L225 Difference]: With dead ends: 77 [2019-10-13 17:47:36,174 INFO L226 Difference]: Without dead ends: 59 [2019-10-13 17:47:36,174 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=206, Invalid=916, Unknown=0, NotChecked=0, Total=1122 [2019-10-13 17:47:36,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-13 17:47:36,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-10-13 17:47:36,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-13 17:47:36,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2019-10-13 17:47:36,179 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 53 [2019-10-13 17:47:36,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:47:36,180 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2019-10-13 17:47:36,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-13 17:47:36,180 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2019-10-13 17:47:36,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-13 17:47:36,181 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:47:36,181 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:47:36,381 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:36,382 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:47:36,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:47:36,383 INFO L82 PathProgramCache]: Analyzing trace with hash 523064203, now seen corresponding path program 16 times [2019-10-13 17:47:36,383 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:47:36,384 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157917545] [2019-10-13 17:47:36,384 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:36,384 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:36,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:47:36,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:36,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:36,600 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-13 17:47:36,600 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157917545] [2019-10-13 17:47:36,600 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804565004] [2019-10-13 17:47:36,601 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:36,664 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 17:47:36,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 17:47:36,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-13 17:47:36,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:47:36,678 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-13 17:47:36,678 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:47:36,678 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 21 [2019-10-13 17:47:36,679 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163668167] [2019-10-13 17:47:36,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-13 17:47:36,679 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:47:36,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-13 17:47:36,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2019-10-13 17:47:36,680 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 21 states. [2019-10-13 17:47:36,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:47:36,759 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2019-10-13 17:47:36,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-13 17:47:36,759 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 57 [2019-10-13 17:47:36,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:47:36,760 INFO L225 Difference]: With dead ends: 80 [2019-10-13 17:47:36,760 INFO L226 Difference]: Without dead ends: 61 [2019-10-13 17:47:36,761 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2019-10-13 17:47:36,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-13 17:47:36,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-10-13 17:47:36,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-13 17:47:36,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2019-10-13 17:47:36,774 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 57 [2019-10-13 17:47:36,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:47:36,775 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2019-10-13 17:47:36,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-13 17:47:36,775 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2019-10-13 17:47:36,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-13 17:47:36,776 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:47:36,776 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:47:36,976 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:36,977 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:47:36,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:47:36,977 INFO L82 PathProgramCache]: Analyzing trace with hash -660869783, now seen corresponding path program 17 times [2019-10-13 17:47:36,977 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:47:36,977 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205196283] [2019-10-13 17:47:36,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:36,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:36,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:47:36,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:37,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:37,219 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-13 17:47:37,220 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205196283] [2019-10-13 17:47:37,220 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548564845] [2019-10-13 17:47:37,220 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:37,461 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-10-13 17:47:37,461 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 17:47:37,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-13 17:47:37,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:47:37,479 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-13 17:47:37,480 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:47:37,480 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 22 [2019-10-13 17:47:37,480 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122725039] [2019-10-13 17:47:37,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-13 17:47:37,481 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:47:37,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-13 17:47:37,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=250, Unknown=0, NotChecked=0, Total=462 [2019-10-13 17:47:37,481 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 22 states. [2019-10-13 17:47:37,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:47:37,560 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2019-10-13 17:47:37,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-13 17:47:37,560 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 59 [2019-10-13 17:47:37,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:47:37,561 INFO L225 Difference]: With dead ends: 82 [2019-10-13 17:47:37,561 INFO L226 Difference]: Without dead ends: 63 [2019-10-13 17:47:37,561 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=212, Invalid=250, Unknown=0, NotChecked=0, Total=462 [2019-10-13 17:47:37,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-13 17:47:37,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-10-13 17:47:37,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-13 17:47:37,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2019-10-13 17:47:37,569 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 59 [2019-10-13 17:47:37,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:47:37,569 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2019-10-13 17:47:37,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-13 17:47:37,570 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2019-10-13 17:47:37,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-13 17:47:37,570 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:47:37,571 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:47:37,775 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:37,775 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:47:37,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:47:37,776 INFO L82 PathProgramCache]: Analyzing trace with hash -255096889, now seen corresponding path program 18 times [2019-10-13 17:47:37,777 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:47:37,777 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667837229] [2019-10-13 17:47:37,777 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:37,778 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:37,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:47:37,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:38,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:38,028 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-13 17:47:38,029 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667837229] [2019-10-13 17:47:38,029 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487992820] [2019-10-13 17:47:38,029 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:38,235 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-10-13 17:47:38,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 17:47:38,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 47 conjunts are in the unsatisfiable core [2019-10-13 17:47:38,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:47:38,286 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-10-13 17:47:38,286 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:47:38,293 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:47:38,293 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 17:47:38,294 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-10-13 17:47:38,934 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 67 [2019-10-13 17:47:38,934 INFO L341 Elim1Store]: treesize reduction 112, result has 57.7 percent of original size [2019-10-13 17:47:38,935 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 71 treesize of output 179 [2019-10-13 17:47:38,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:38,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:38,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:38,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:38,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:38,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:38,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:38,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:38,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:38,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:38,941 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:47:39,030 INFO L567 ElimStorePlain]: treesize reduction 135, result has 34.5 percent of original size [2019-10-13 17:47:39,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:39,031 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 17:47:39,032 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:77, output treesize:71 [2019-10-13 17:47:39,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:39,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:39,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:39,315 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 35 proven. 42 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-10-13 17:47:39,316 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:47:39,316 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 39 [2019-10-13 17:47:39,316 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022317054] [2019-10-13 17:47:39,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-13 17:47:39,317 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:47:39,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-13 17:47:39,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=1179, Unknown=0, NotChecked=0, Total=1482 [2019-10-13 17:47:39,319 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 39 states. [2019-10-13 17:47:40,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:47:40,369 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2019-10-13 17:47:40,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-13 17:47:40,371 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 61 [2019-10-13 17:47:40,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:47:40,372 INFO L225 Difference]: With dead ends: 88 [2019-10-13 17:47:40,372 INFO L226 Difference]: Without dead ends: 68 [2019-10-13 17:47:40,378 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=405, Invalid=2457, Unknown=0, NotChecked=0, Total=2862 [2019-10-13 17:47:40,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-13 17:47:40,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-10-13 17:47:40,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-13 17:47:40,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2019-10-13 17:47:40,382 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 61 [2019-10-13 17:47:40,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:47:40,383 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2019-10-13 17:47:40,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-13 17:47:40,383 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2019-10-13 17:47:40,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-13 17:47:40,383 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:47:40,384 INFO L380 BasicCegarLoop]: trace histogram [20, 20, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:47:40,587 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:40,588 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:47:40,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:47:40,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1190794106, now seen corresponding path program 19 times [2019-10-13 17:47:40,589 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:47:40,589 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305394240] [2019-10-13 17:47:40,590 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:40,590 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:40,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:47:40,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:40,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:40,883 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-13 17:47:40,884 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305394240] [2019-10-13 17:47:40,884 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019387828] [2019-10-13 17:47:40,884 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:40,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:40,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-13 17:47:40,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:47:40,989 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-13 17:47:40,989 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:47:40,989 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 25 [2019-10-13 17:47:40,989 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606950142] [2019-10-13 17:47:40,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-13 17:47:40,990 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:47:40,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-13 17:47:40,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=322, Unknown=0, NotChecked=0, Total=600 [2019-10-13 17:47:40,991 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 25 states. [2019-10-13 17:47:41,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:47:41,099 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2019-10-13 17:47:41,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-13 17:47:41,100 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 67 [2019-10-13 17:47:41,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:47:41,101 INFO L225 Difference]: With dead ends: 92 [2019-10-13 17:47:41,101 INFO L226 Difference]: Without dead ends: 71 [2019-10-13 17:47:41,101 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=278, Invalid=322, Unknown=0, NotChecked=0, Total=600 [2019-10-13 17:47:41,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-13 17:47:41,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-10-13 17:47:41,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-13 17:47:41,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2019-10-13 17:47:41,106 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 67 [2019-10-13 17:47:41,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:47:41,106 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2019-10-13 17:47:41,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-13 17:47:41,106 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2019-10-13 17:47:41,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-13 17:47:41,107 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:47:41,107 INFO L380 BasicCegarLoop]: trace histogram [21, 21, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:47:41,311 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:41,312 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:47:41,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:47:41,312 INFO L82 PathProgramCache]: Analyzing trace with hash -837007132, now seen corresponding path program 20 times [2019-10-13 17:47:41,312 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:47:41,312 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586870247] [2019-10-13 17:47:41,313 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:41,313 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:41,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:47:41,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:41,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:41,631 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-13 17:47:41,631 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586870247] [2019-10-13 17:47:41,631 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156030085] [2019-10-13 17:47:41,631 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:41,715 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-13 17:47:41,716 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 17:47:41,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-13 17:47:41,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:47:41,732 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-13 17:47:41,733 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:47:41,733 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 26 [2019-10-13 17:47:41,733 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407978477] [2019-10-13 17:47:41,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-13 17:47:41,734 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:47:41,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-13 17:47:41,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=348, Unknown=0, NotChecked=0, Total=650 [2019-10-13 17:47:41,734 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 26 states. [2019-10-13 17:47:41,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:47:41,872 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2019-10-13 17:47:41,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-13 17:47:41,872 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 69 [2019-10-13 17:47:41,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:47:41,873 INFO L225 Difference]: With dead ends: 94 [2019-10-13 17:47:41,873 INFO L226 Difference]: Without dead ends: 73 [2019-10-13 17:47:41,874 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=302, Invalid=348, Unknown=0, NotChecked=0, Total=650 [2019-10-13 17:47:41,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-10-13 17:47:41,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2019-10-13 17:47:41,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-13 17:47:41,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2019-10-13 17:47:41,879 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 69 [2019-10-13 17:47:41,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:47:41,879 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2019-10-13 17:47:41,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-13 17:47:41,880 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2019-10-13 17:47:41,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-13 17:47:41,880 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:47:41,880 INFO L380 BasicCegarLoop]: trace histogram [22, 22, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:47:42,084 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:42,084 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:47:42,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:47:42,085 INFO L82 PathProgramCache]: Analyzing trace with hash -150141502, now seen corresponding path program 21 times [2019-10-13 17:47:42,085 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:47:42,085 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767687364] [2019-10-13 17:47:42,086 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:42,086 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:42,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:47:42,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:42,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:42,420 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-13 17:47:42,421 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767687364] [2019-10-13 17:47:42,421 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238837525] [2019-10-13 17:47:42,421 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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:42,528 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-10-13 17:47:42,528 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 17:47:42,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 47 conjunts are in the unsatisfiable core [2019-10-13 17:47:42,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:47:42,556 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-10-13 17:47:42,557 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:47:42,562 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:47:42,563 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 17:47:42,563 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-10-13 17:47:43,450 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 78 [2019-10-13 17:47:43,451 INFO L341 Elim1Store]: treesize reduction 170, result has 51.6 percent of original size [2019-10-13 17:47:43,452 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 81 treesize of output 211 [2019-10-13 17:47:43,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:43,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:43,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:43,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:43,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:43,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:43,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:43,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:43,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:43,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:43,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:43,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:43,460 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:47:43,547 INFO L567 ElimStorePlain]: treesize reduction 150, result has 35.1 percent of original size [2019-10-13 17:47:43,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:43,551 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 17:47:43,551 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:87, output treesize:81 [2019-10-13 17:47:43,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:43,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:43,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:44,090 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2019-10-13 17:47:44,095 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:47:44,095 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 19] total 43 [2019-10-13 17:47:44,096 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968868801] [2019-10-13 17:47:44,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-13 17:47:44,097 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:47:44,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-13 17:47:44,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=1449, Unknown=0, NotChecked=0, Total=1806 [2019-10-13 17:47:44,099 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 43 states. [2019-10-13 17:47:45,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:47:45,095 INFO L93 Difference]: Finished difference Result 99 states and 102 transitions. [2019-10-13 17:47:45,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-13 17:47:45,096 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 71 [2019-10-13 17:47:45,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:47:45,097 INFO L225 Difference]: With dead ends: 99 [2019-10-13 17:47:45,097 INFO L226 Difference]: Without dead ends: 77 [2019-10-13 17:47:45,098 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=367, Invalid=1613, Unknown=0, NotChecked=0, Total=1980 [2019-10-13 17:47:45,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-13 17:47:45,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-10-13 17:47:45,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-13 17:47:45,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2019-10-13 17:47:45,103 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 71 [2019-10-13 17:47:45,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:47:45,103 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2019-10-13 17:47:45,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-13 17:47:45,103 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2019-10-13 17:47:45,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-13 17:47:45,104 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:47:45,104 INFO L380 BasicCegarLoop]: trace histogram [23, 23, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:47:45,308 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:45,308 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:47:45,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:47:45,309 INFO L82 PathProgramCache]: Analyzing trace with hash -30548381, now seen corresponding path program 22 times [2019-10-13 17:47:45,309 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:47:45,310 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912145413] [2019-10-13 17:47:45,310 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:45,310 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:45,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:47:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:45,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:45,633 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-13 17:47:45,634 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912145413] [2019-10-13 17:47:45,634 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133046558] [2019-10-13 17:47:45,634 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:45,740 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 17:47:45,740 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 17:47:45,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-13 17:47:45,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:47:45,762 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-13 17:47:45,763 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:47:45,763 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 28 [2019-10-13 17:47:45,763 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548059814] [2019-10-13 17:47:45,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-13 17:47:45,764 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:47:45,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-13 17:47:45,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=403, Unknown=0, NotChecked=0, Total=756 [2019-10-13 17:47:45,764 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 28 states. [2019-10-13 17:47:45,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:47:45,902 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2019-10-13 17:47:45,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-13 17:47:45,903 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 75 [2019-10-13 17:47:45,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:47:45,903 INFO L225 Difference]: With dead ends: 102 [2019-10-13 17:47:45,904 INFO L226 Difference]: Without dead ends: 79 [2019-10-13 17:47:45,904 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=353, Invalid=403, Unknown=0, NotChecked=0, Total=756 [2019-10-13 17:47:45,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-10-13 17:47:45,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2019-10-13 17:47:45,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-10-13 17:47:45,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2019-10-13 17:47:45,908 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 75 [2019-10-13 17:47:45,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:47:45,909 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2019-10-13 17:47:45,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-13 17:47:45,909 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2019-10-13 17:47:45,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-13 17:47:45,909 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:47:45,910 INFO L380 BasicCegarLoop]: trace histogram [24, 24, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:47:46,110 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:46,111 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:47:46,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:47:46,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1505166143, now seen corresponding path program 23 times [2019-10-13 17:47:46,112 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:47:46,112 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169584834] [2019-10-13 17:47:46,112 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:46,112 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:46,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:47:46,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:46,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:46,487 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-13 17:47:46,487 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169584834] [2019-10-13 17:47:46,487 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073704381] [2019-10-13 17:47:46,487 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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:46,846 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2019-10-13 17:47:46,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 17:47:46,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-13 17:47:46,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:47:46,864 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-13 17:47:46,865 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:47:46,865 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 29 [2019-10-13 17:47:46,865 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388881501] [2019-10-13 17:47:46,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-13 17:47:46,865 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:47:46,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-13 17:47:46,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=432, Unknown=0, NotChecked=0, Total=812 [2019-10-13 17:47:46,866 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 29 states. [2019-10-13 17:47:47,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:47:47,005 INFO L93 Difference]: Finished difference Result 104 states and 106 transitions. [2019-10-13 17:47:47,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-13 17:47:47,006 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 77 [2019-10-13 17:47:47,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:47:47,006 INFO L225 Difference]: With dead ends: 104 [2019-10-13 17:47:47,007 INFO L226 Difference]: Without dead ends: 81 [2019-10-13 17:47:47,007 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=380, Invalid=432, Unknown=0, NotChecked=0, Total=812 [2019-10-13 17:47:47,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-10-13 17:47:47,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2019-10-13 17:47:47,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-13 17:47:47,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2019-10-13 17:47:47,012 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 77 [2019-10-13 17:47:47,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:47:47,012 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2019-10-13 17:47:47,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-13 17:47:47,012 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2019-10-13 17:47:47,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-13 17:47:47,013 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:47:47,013 INFO L380 BasicCegarLoop]: trace histogram [25, 25, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:47:47,217 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:47,217 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:47:47,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:47:47,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1273627745, now seen corresponding path program 24 times [2019-10-13 17:47:47,218 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:47:47,218 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820487516] [2019-10-13 17:47:47,218 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:47,218 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:47,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:47:47,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:47,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:47,558 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-13 17:47:47,558 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820487516] [2019-10-13 17:47:47,558 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923064137] [2019-10-13 17:47:47,558 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:48,154 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2019-10-13 17:47:48,154 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 17:47:48,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 52 conjunts are in the unsatisfiable core [2019-10-13 17:47:48,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:47:48,177 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-10-13 17:47:48,178 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:47:48,184 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:47:48,184 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 17:47:48,185 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-10-13 17:47:49,290 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 89 [2019-10-13 17:47:49,290 INFO L341 Elim1Store]: treesize reduction 240, result has 46.5 percent of original size [2019-10-13 17:47:49,291 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 91 treesize of output 243 [2019-10-13 17:47:49,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:49,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:49,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:49,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:49,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:49,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:49,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:49,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:49,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:49,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:49,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:49,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:49,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:49,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:49,299 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:47:49,379 INFO L567 ElimStorePlain]: treesize reduction 149, result has 37.9 percent of original size [2019-10-13 17:47:49,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:49,381 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 17:47:49,381 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:97, output treesize:91 [2019-10-13 17:47:49,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:49,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:49,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:50,059 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2019-10-13 17:47:50,059 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:47:50,060 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 21] total 48 [2019-10-13 17:47:50,060 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331397710] [2019-10-13 17:47:50,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-13 17:47:50,060 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:47:50,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-13 17:47:50,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=1814, Unknown=0, NotChecked=0, Total=2256 [2019-10-13 17:47:50,061 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 48 states. [2019-10-13 17:47:51,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:47:51,042 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2019-10-13 17:47:51,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-13 17:47:51,042 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 79 [2019-10-13 17:47:51,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:47:51,044 INFO L225 Difference]: With dead ends: 109 [2019-10-13 17:47:51,044 INFO L226 Difference]: Without dead ends: 85 [2019-10-13 17:47:51,045 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=452, Invalid=1998, Unknown=0, NotChecked=0, Total=2450 [2019-10-13 17:47:51,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-10-13 17:47:51,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2019-10-13 17:47:51,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-10-13 17:47:51,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2019-10-13 17:47:51,049 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 79 [2019-10-13 17:47:51,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:47:51,049 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2019-10-13 17:47:51,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-13 17:47:51,050 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2019-10-13 17:47:51,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-13 17:47:51,050 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:47:51,050 INFO L380 BasicCegarLoop]: trace histogram [26, 26, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:47:51,251 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:51,251 INFO L410 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:47:51,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:47:51,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1438388992, now seen corresponding path program 25 times [2019-10-13 17:47:51,252 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:47:51,252 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716222917] [2019-10-13 17:47:51,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:51,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:51,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:47:51,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:51,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:51,621 INFO L134 CoverageAnalysis]: Checked inductivity of 766 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-10-13 17:47:51,621 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716222917] [2019-10-13 17:47:51,621 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624831314] [2019-10-13 17:47:51,622 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:51,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:51,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-13 17:47:51,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:47:51,759 INFO L134 CoverageAnalysis]: Checked inductivity of 766 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-10-13 17:47:51,759 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:47:51,760 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 31 [2019-10-13 17:47:51,760 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421899744] [2019-10-13 17:47:51,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-13 17:47:51,760 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:47:51,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-13 17:47:51,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=493, Unknown=0, NotChecked=0, Total=930 [2019-10-13 17:47:51,761 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 31 states. [2019-10-13 17:47:51,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:47:51,896 INFO L93 Difference]: Finished difference Result 112 states and 114 transitions. [2019-10-13 17:47:51,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-13 17:47:51,896 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 83 [2019-10-13 17:47:51,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:47:51,897 INFO L225 Difference]: With dead ends: 112 [2019-10-13 17:47:51,897 INFO L226 Difference]: Without dead ends: 87 [2019-10-13 17:47:51,898 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=437, Invalid=493, Unknown=0, NotChecked=0, Total=930 [2019-10-13 17:47:51,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-10-13 17:47:51,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2019-10-13 17:47:51,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-10-13 17:47:51,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2019-10-13 17:47:51,903 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 83 [2019-10-13 17:47:51,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:47:51,903 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2019-10-13 17:47:51,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-13 17:47:51,903 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2019-10-13 17:47:51,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-13 17:47:51,904 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:47:51,904 INFO L380 BasicCegarLoop]: trace histogram [27, 27, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:47:52,104 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:52,105 INFO L410 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:47:52,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:47:52,105 INFO L82 PathProgramCache]: Analyzing trace with hash 687469406, now seen corresponding path program 26 times [2019-10-13 17:47:52,106 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:47:52,106 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140143513] [2019-10-13 17:47:52,106 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:52,106 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:52,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:47:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:52,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:52,606 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-10-13 17:47:52,606 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140143513] [2019-10-13 17:47:52,606 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222900675] [2019-10-13 17:47:52,607 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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:52,745 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-13 17:47:52,746 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 17:47:52,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-13 17:47:52,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:47:52,770 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-10-13 17:47:52,770 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:47:52,770 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 32 [2019-10-13 17:47:52,771 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800808659] [2019-10-13 17:47:52,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-13 17:47:52,771 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:47:52,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-13 17:47:52,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=467, Invalid=525, Unknown=0, NotChecked=0, Total=992 [2019-10-13 17:47:52,772 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand 32 states. [2019-10-13 17:47:52,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:47:52,918 INFO L93 Difference]: Finished difference Result 114 states and 116 transitions. [2019-10-13 17:47:52,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-13 17:47:52,918 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 85 [2019-10-13 17:47:52,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:47:52,920 INFO L225 Difference]: With dead ends: 114 [2019-10-13 17:47:52,920 INFO L226 Difference]: Without dead ends: 89 [2019-10-13 17:47:52,921 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=467, Invalid=525, Unknown=0, NotChecked=0, Total=992 [2019-10-13 17:47:52,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-13 17:47:52,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2019-10-13 17:47:52,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-13 17:47:52,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2019-10-13 17:47:52,931 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 85 [2019-10-13 17:47:52,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:47:52,931 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2019-10-13 17:47:52,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-13 17:47:52,932 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2019-10-13 17:47:52,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-13 17:47:52,933 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:47:52,933 INFO L380 BasicCegarLoop]: trace histogram [28, 28, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:47:53,137 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:53,138 INFO L410 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:47:53,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:47:53,138 INFO L82 PathProgramCache]: Analyzing trace with hash 608252988, now seen corresponding path program 27 times [2019-10-13 17:47:53,138 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:47:53,138 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833407662] [2019-10-13 17:47:53,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:53,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:53,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:47:53,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:53,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:53,719 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-10-13 17:47:53,720 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833407662] [2019-10-13 17:47:53,720 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363908657] [2019-10-13 17:47:53,720 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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:53,880 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-10-13 17:47:53,880 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 17:47:53,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 65 conjunts are in the unsatisfiable core [2019-10-13 17:47:53,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:47:53,967 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-10-13 17:47:53,967 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:47:53,974 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:47:53,974 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 17:47:53,975 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-10-13 17:47:55,008 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:55,010 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:55,013 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:55,015 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:55,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:55,023 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:55,024 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:55,025 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:55,075 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:47:55,076 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 36 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 83 treesize of output 131 [2019-10-13 17:47:55,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:55,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:55,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:55,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:55,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:55,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:55,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:55,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:55,080 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:47:55,108 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:47:55,108 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 17:47:55,109 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:89, output treesize:67 [2019-10-13 17:47:55,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:55,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:56,397 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2019-10-13 17:47:56,398 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:47:56,398 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 26] total 56 [2019-10-13 17:47:56,398 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981552621] [2019-10-13 17:47:56,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-10-13 17:47:56,399 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:47:56,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-10-13 17:47:56,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=617, Invalid=2463, Unknown=0, NotChecked=0, Total=3080 [2019-10-13 17:47:56,400 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 56 states. [2019-10-13 17:47:58,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:47:58,145 INFO L93 Difference]: Finished difference Result 119 states and 122 transitions. [2019-10-13 17:47:58,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-10-13 17:47:58,145 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 87 [2019-10-13 17:47:58,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:47:58,146 INFO L225 Difference]: With dead ends: 119 [2019-10-13 17:47:58,147 INFO L226 Difference]: Without dead ends: 93 [2019-10-13 17:47:58,150 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1916 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1499, Invalid=5811, Unknown=0, NotChecked=0, Total=7310 [2019-10-13 17:47:58,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-10-13 17:47:58,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2019-10-13 17:47:58,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-10-13 17:47:58,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2019-10-13 17:47:58,154 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 87 [2019-10-13 17:47:58,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:47:58,154 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2019-10-13 17:47:58,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-10-13 17:47:58,154 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2019-10-13 17:47:58,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-13 17:47:58,155 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:47:58,155 INFO L380 BasicCegarLoop]: trace histogram [29, 29, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:47:58,356 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:58,357 INFO L410 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:47:58,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:47:58,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1434133923, now seen corresponding path program 28 times [2019-10-13 17:47:58,358 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:47:58,358 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509224026] [2019-10-13 17:47:58,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:58,359 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:58,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:47:58,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:58,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:58,796 INFO L134 CoverageAnalysis]: Checked inductivity of 951 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-10-13 17:47:58,796 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509224026] [2019-10-13 17:47:58,796 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953784872] [2019-10-13 17:47:58,796 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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:58,970 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 17:47:58,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 17:47:58,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-13 17:47:58,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:47:58,991 INFO L134 CoverageAnalysis]: Checked inductivity of 951 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-10-13 17:47:58,992 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:47:58,992 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32] total 34 [2019-10-13 17:47:58,992 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031876118] [2019-10-13 17:47:58,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-13 17:47:58,992 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:47:58,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-13 17:47:58,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=530, Invalid=592, Unknown=0, NotChecked=0, Total=1122 [2019-10-13 17:47:58,993 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 34 states. [2019-10-13 17:47:59,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:47:59,151 INFO L93 Difference]: Finished difference Result 122 states and 124 transitions. [2019-10-13 17:47:59,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-13 17:47:59,152 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 91 [2019-10-13 17:47:59,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:47:59,153 INFO L225 Difference]: With dead ends: 122 [2019-10-13 17:47:59,153 INFO L226 Difference]: Without dead ends: 95 [2019-10-13 17:47:59,154 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=530, Invalid=592, Unknown=0, NotChecked=0, Total=1122 [2019-10-13 17:47:59,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-10-13 17:47:59,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-10-13 17:47:59,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-10-13 17:47:59,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2019-10-13 17:47:59,161 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 91 [2019-10-13 17:47:59,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:47:59,161 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2019-10-13 17:47:59,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-13 17:47:59,162 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2019-10-13 17:47:59,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-13 17:47:59,162 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:47:59,162 INFO L380 BasicCegarLoop]: trace histogram [30, 30, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:47:59,370 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:59,371 INFO L410 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:47:59,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:47:59,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1124302011, now seen corresponding path program 29 times [2019-10-13 17:47:59,372 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:47:59,372 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078233833] [2019-10-13 17:47:59,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:59,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:59,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:47:59,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:59,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-10-13 17:47:59,859 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078233833] [2019-10-13 17:47:59,859 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22594652] [2019-10-13 17:47:59,859 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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true