java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-tiling/pr4.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 21:50:22,113 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 21:50:22,117 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 21:50:22,131 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 21:50:22,131 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 21:50:22,132 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 21:50:22,134 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 21:50:22,135 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 21:50:22,137 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 21:50:22,138 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 21:50:22,139 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 21:50:22,140 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 21:50:22,140 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 21:50:22,141 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 21:50:22,142 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 21:50:22,143 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 21:50:22,144 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 21:50:22,145 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 21:50:22,147 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 21:50:22,149 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 21:50:22,150 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 21:50:22,151 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 21:50:22,152 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 21:50:22,153 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 21:50:22,155 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 21:50:22,159 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 21:50:22,159 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 21:50:22,160 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 21:50:22,161 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 21:50:22,162 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 21:50:22,162 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 21:50:22,163 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 21:50:22,163 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 21:50:22,164 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 21:50:22,168 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 21:50:22,168 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 21:50:22,169 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 21:50:22,169 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 21:50:22,169 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 21:50:22,173 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 21:50:22,174 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 21:50:22,175 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 21:50:22,197 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 21:50:22,198 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 21:50:22,199 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 21:50:22,199 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 21:50:22,200 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 21:50:22,200 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 21:50:22,201 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 21:50:22,201 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 21:50:22,201 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 21:50:22,201 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 21:50:22,201 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 21:50:22,202 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 21:50:22,202 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 21:50:22,202 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 21:50:22,202 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 21:50:22,202 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 21:50:22,203 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 21:50:22,203 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 21:50:22,203 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 21:50:22,203 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 21:50:22,203 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 21:50:22,204 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 21:50:22,204 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 21:50:22,204 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 21:50:22,204 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 21:50:22,204 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 21:50:22,205 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 21:50:22,205 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 21:50:22,205 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 21:50:22,469 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 21:50:22,491 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 21:50:22,495 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 21:50:22,497 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 21:50:22,497 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 21:50:22,498 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/pr4.c [2019-10-14 21:50:22,578 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75f0a7eed/56f729a013924fa297e2e2fd34d0b2a3/FLAGc9001ab22 [2019-10-14 21:50:23,027 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 21:50:23,028 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/pr4.c [2019-10-14 21:50:23,035 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75f0a7eed/56f729a013924fa297e2e2fd34d0b2a3/FLAGc9001ab22 [2019-10-14 21:50:23,399 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75f0a7eed/56f729a013924fa297e2e2fd34d0b2a3 [2019-10-14 21:50:23,414 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 21:50:23,416 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 21:50:23,416 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 21:50:23,417 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 21:50:23,420 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 21:50:23,421 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:50:23" (1/1) ... [2019-10-14 21:50:23,423 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fbe7af2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:23, skipping insertion in model container [2019-10-14 21:50:23,424 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:50:23" (1/1) ... [2019-10-14 21:50:23,431 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 21:50:23,451 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 21:50:23,641 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 21:50:23,654 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 21:50:23,681 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 21:50:23,699 INFO L192 MainTranslator]: Completed translation [2019-10-14 21:50:23,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:23 WrapperNode [2019-10-14 21:50:23,700 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 21:50:23,700 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 21:50:23,701 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 21:50:23,701 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 21:50:23,803 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:23" (1/1) ... [2019-10-14 21:50:23,803 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:23" (1/1) ... [2019-10-14 21:50:23,810 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:23" (1/1) ... [2019-10-14 21:50:23,810 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:23" (1/1) ... [2019-10-14 21:50:23,819 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:23" (1/1) ... [2019-10-14 21:50:23,825 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:23" (1/1) ... [2019-10-14 21:50:23,827 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:23" (1/1) ... [2019-10-14 21:50:23,829 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 21:50:23,830 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 21:50:23,830 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 21:50:23,831 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 21:50:23,832 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 21:50:23,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 21:50:23,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 21:50:23,892 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-14 21:50:23,893 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 21:50:23,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 21:50:23,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-14 21:50:23,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-14 21:50:23,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 21:50:23,893 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 21:50:23,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-14 21:50:23,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 21:50:23,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 21:50:23,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 21:50:23,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 21:50:23,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 21:50:24,220 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 21:50:24,220 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-14 21:50:24,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:50:24 BoogieIcfgContainer [2019-10-14 21:50:24,222 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 21:50:24,223 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 21:50:24,223 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 21:50:24,226 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 21:50:24,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:50:23" (1/3) ... [2019-10-14 21:50:24,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35a0dfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:50:24, skipping insertion in model container [2019-10-14 21:50:24,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:50:23" (2/3) ... [2019-10-14 21:50:24,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35a0dfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:50:24, skipping insertion in model container [2019-10-14 21:50:24,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:50:24" (3/3) ... [2019-10-14 21:50:24,230 INFO L109 eAbstractionObserver]: Analyzing ICFG pr4.c [2019-10-14 21:50:24,239 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 21:50:24,248 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 21:50:24,259 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 21:50:24,285 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 21:50:24,285 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 21:50:24,285 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 21:50:24,285 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 21:50:24,285 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 21:50:24,286 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 21:50:24,286 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 21:50:24,286 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 21:50:24,305 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-10-14 21:50:24,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-14 21:50:24,312 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:24,313 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:24,315 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:24,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:24,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1387739323, now seen corresponding path program 1 times [2019-10-14 21:50:24,326 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:24,327 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30507880] [2019-10-14 21:50:24,327 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:24,327 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:24,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:24,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:24,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:24,608 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30507880] [2019-10-14 21:50:24,609 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:50:24,609 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 21:50:24,610 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831745625] [2019-10-14 21:50:24,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 21:50:24,614 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:24,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 21:50:24,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 21:50:24,627 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 6 states. [2019-10-14 21:50:24,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:24,920 INFO L93 Difference]: Finished difference Result 56 states and 73 transitions. [2019-10-14 21:50:24,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 21:50:24,922 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-10-14 21:50:24,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:24,933 INFO L225 Difference]: With dead ends: 56 [2019-10-14 21:50:24,933 INFO L226 Difference]: Without dead ends: 32 [2019-10-14 21:50:24,937 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-14 21:50:24,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-14 21:50:24,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-10-14 21:50:24,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-14 21:50:24,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2019-10-14 21:50:24,983 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 16 [2019-10-14 21:50:24,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:24,984 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2019-10-14 21:50:24,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 21:50:24,984 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2019-10-14 21:50:24,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-14 21:50:24,985 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:24,986 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:24,986 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:24,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:24,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1385892281, now seen corresponding path program 1 times [2019-10-14 21:50:24,987 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:24,987 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759003604] [2019-10-14 21:50:24,987 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:24,988 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:24,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:25,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:25,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:25,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:25,207 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759003604] [2019-10-14 21:50:25,208 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:50:25,208 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 21:50:25,208 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644306378] [2019-10-14 21:50:25,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 21:50:25,210 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:25,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 21:50:25,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-14 21:50:25,212 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand 5 states. [2019-10-14 21:50:25,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:25,382 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2019-10-14 21:50:25,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 21:50:25,383 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-14 21:50:25,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:25,387 INFO L225 Difference]: With dead ends: 54 [2019-10-14 21:50:25,387 INFO L226 Difference]: Without dead ends: 37 [2019-10-14 21:50:25,388 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-14 21:50:25,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-14 21:50:25,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2019-10-14 21:50:25,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-14 21:50:25,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2019-10-14 21:50:25,397 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 16 [2019-10-14 21:50:25,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:25,397 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2019-10-14 21:50:25,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 21:50:25,398 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2019-10-14 21:50:25,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 21:50:25,399 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:25,399 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:25,399 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:25,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:25,400 INFO L82 PathProgramCache]: Analyzing trace with hash 830594452, now seen corresponding path program 1 times [2019-10-14 21:50:25,400 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:25,400 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672007330] [2019-10-14 21:50:25,400 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:25,400 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:25,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:25,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:25,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:25,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:25,823 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672007330] [2019-10-14 21:50:25,823 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705093128] [2019-10-14 21:50:25,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:25,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:25,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-14 21:50:25,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:25,984 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-14 21:50:25,984 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:25,998 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:26,000 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:26,000 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-10-14 21:50:26,045 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:26,046 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-10-14 21:50:26,047 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:26,058 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:26,059 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:26,060 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-10-14 21:50:26,068 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:26,069 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-10-14 21:50:26,070 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:26,080 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:26,081 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:26,081 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-10-14 21:50:26,089 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:26,090 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-10-14 21:50:26,091 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:26,098 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:26,099 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:26,100 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:11 [2019-10-14 21:50:26,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:26,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:26,171 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:26,171 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2019-10-14 21:50:26,172 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323506305] [2019-10-14 21:50:26,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-14 21:50:26,173 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:26,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-14 21:50:26,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-10-14 21:50:26,174 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 16 states. [2019-10-14 21:50:26,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:26,959 INFO L93 Difference]: Finished difference Result 107 states and 144 transitions. [2019-10-14 21:50:26,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-14 21:50:26,960 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-10-14 21:50:26,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:26,963 INFO L225 Difference]: With dead ends: 107 [2019-10-14 21:50:26,963 INFO L226 Difference]: Without dead ends: 91 [2019-10-14 21:50:26,964 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=220, Invalid=710, Unknown=0, NotChecked=0, Total=930 [2019-10-14 21:50:26,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-10-14 21:50:26,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 41. [2019-10-14 21:50:26,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-14 21:50:26,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2019-10-14 21:50:26,982 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 22 [2019-10-14 21:50:26,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:26,983 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2019-10-14 21:50:26,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-14 21:50:26,983 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2019-10-14 21:50:26,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 21:50:26,984 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:26,984 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:27,187 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:27,188 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:27,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:27,188 INFO L82 PathProgramCache]: Analyzing trace with hash 243788438, now seen corresponding path program 1 times [2019-10-14 21:50:27,189 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:27,189 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473183497] [2019-10-14 21:50:27,190 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:27,190 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:27,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:27,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:27,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:27,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:27,282 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473183497] [2019-10-14 21:50:27,282 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:50:27,282 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 21:50:27,283 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706171290] [2019-10-14 21:50:27,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 21:50:27,285 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:27,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 21:50:27,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 21:50:27,286 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand 5 states. [2019-10-14 21:50:27,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:27,417 INFO L93 Difference]: Finished difference Result 70 states and 90 transitions. [2019-10-14 21:50:27,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 21:50:27,419 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-10-14 21:50:27,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:27,420 INFO L225 Difference]: With dead ends: 70 [2019-10-14 21:50:27,420 INFO L226 Difference]: Without dead ends: 47 [2019-10-14 21:50:27,421 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 21:50:27,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-14 21:50:27,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2019-10-14 21:50:27,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-14 21:50:27,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2019-10-14 21:50:27,430 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 22 [2019-10-14 21:50:27,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:27,430 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2019-10-14 21:50:27,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 21:50:27,430 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2019-10-14 21:50:27,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 21:50:27,431 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:27,431 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:27,431 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:27,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:27,432 INFO L82 PathProgramCache]: Analyzing trace with hash -149238572, now seen corresponding path program 1 times [2019-10-14 21:50:27,432 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:27,432 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369373326] [2019-10-14 21:50:27,432 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:27,433 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:27,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:27,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:27,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:27,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:27,480 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369373326] [2019-10-14 21:50:27,480 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:50:27,480 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 21:50:27,480 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908738990] [2019-10-14 21:50:27,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 21:50:27,481 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:27,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 21:50:27,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 21:50:27,482 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand 5 states. [2019-10-14 21:50:27,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:27,581 INFO L93 Difference]: Finished difference Result 70 states and 88 transitions. [2019-10-14 21:50:27,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 21:50:27,582 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-10-14 21:50:27,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:27,583 INFO L225 Difference]: With dead ends: 70 [2019-10-14 21:50:27,584 INFO L226 Difference]: Without dead ends: 47 [2019-10-14 21:50:27,584 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 21:50:27,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-14 21:50:27,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2019-10-14 21:50:27,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-14 21:50:27,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2019-10-14 21:50:27,591 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 22 [2019-10-14 21:50:27,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:27,591 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2019-10-14 21:50:27,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 21:50:27,592 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2019-10-14 21:50:27,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 21:50:27,593 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:27,593 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:27,593 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:27,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:27,593 INFO L82 PathProgramCache]: Analyzing trace with hash 551826006, now seen corresponding path program 1 times [2019-10-14 21:50:27,594 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:27,594 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442395371] [2019-10-14 21:50:27,594 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:27,594 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:27,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:27,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:27,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:27,775 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442395371] [2019-10-14 21:50:27,775 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316522076] [2019-10-14 21:50:27,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:27,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:27,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-14 21:50:27,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:27,840 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-14 21:50:27,840 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:27,847 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:27,848 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:27,848 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-10-14 21:50:27,860 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2019-10-14 21:50:27,864 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:27,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:27,870 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:27,874 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2019-10-14 21:50:27,874 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:27,879 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:27,879 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:27,895 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:27,895 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:27,896 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:19 [2019-10-14 21:50:27,920 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2019-10-14 21:50:27,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:27,923 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:27,925 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:27,928 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:27,930 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2019-10-14 21:50:27,931 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:27,935 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:27,936 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:27,943 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:27,943 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:27,943 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:31 [2019-10-14 21:50:27,968 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:27,970 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:27,971 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:27,972 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:27,972 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-10-14 21:50:27,973 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:27,980 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:27,981 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:27,981 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-10-14 21:50:28,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:28,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:28,056 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:28,056 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2019-10-14 21:50:28,056 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368021797] [2019-10-14 21:50:28,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-14 21:50:28,057 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:28,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-14 21:50:28,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-10-14 21:50:28,058 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand 16 states. [2019-10-14 21:50:28,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:28,619 INFO L93 Difference]: Finished difference Result 84 states and 109 transitions. [2019-10-14 21:50:28,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-14 21:50:28,619 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-10-14 21:50:28,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:28,621 INFO L225 Difference]: With dead ends: 84 [2019-10-14 21:50:28,622 INFO L226 Difference]: Without dead ends: 82 [2019-10-14 21:50:28,623 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 17 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2019-10-14 21:50:28,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-10-14 21:50:28,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 51. [2019-10-14 21:50:28,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-14 21:50:28,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2019-10-14 21:50:28,632 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 65 transitions. Word has length 22 [2019-10-14 21:50:28,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:28,633 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 65 transitions. [2019-10-14 21:50:28,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-14 21:50:28,633 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2019-10-14 21:50:28,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-14 21:50:28,634 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:28,634 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:28,842 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:28,843 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:28,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:28,843 INFO L82 PathProgramCache]: Analyzing trace with hash -927487005, now seen corresponding path program 1 times [2019-10-14 21:50:28,843 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:28,843 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865974399] [2019-10-14 21:50:28,843 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:28,844 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:28,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:28,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:28,942 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:28,945 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865974399] [2019-10-14 21:50:28,945 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:50:28,945 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 21:50:28,945 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400145712] [2019-10-14 21:50:28,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 21:50:28,946 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:28,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 21:50:28,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:50:28,947 INFO L87 Difference]: Start difference. First operand 51 states and 65 transitions. Second operand 4 states. [2019-10-14 21:50:29,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:29,069 INFO L93 Difference]: Finished difference Result 80 states and 101 transitions. [2019-10-14 21:50:29,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 21:50:29,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-10-14 21:50:29,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:29,070 INFO L225 Difference]: With dead ends: 80 [2019-10-14 21:50:29,070 INFO L226 Difference]: Without dead ends: 57 [2019-10-14 21:50:29,071 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:50:29,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-14 21:50:29,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2019-10-14 21:50:29,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-14 21:50:29,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2019-10-14 21:50:29,079 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 28 [2019-10-14 21:50:29,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:29,080 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2019-10-14 21:50:29,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 21:50:29,080 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2019-10-14 21:50:29,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-14 21:50:29,081 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:29,081 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:29,082 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:29,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:29,082 INFO L82 PathProgramCache]: Analyzing trace with hash -344073693, now seen corresponding path program 1 times [2019-10-14 21:50:29,082 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:29,082 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980220418] [2019-10-14 21:50:29,083 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:29,083 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:29,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:29,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:29,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:29,170 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:29,171 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980220418] [2019-10-14 21:50:29,171 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:50:29,171 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 21:50:29,171 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033592967] [2019-10-14 21:50:29,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 21:50:29,172 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:29,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 21:50:29,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:50:29,173 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand 4 states. [2019-10-14 21:50:29,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:29,290 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2019-10-14 21:50:29,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 21:50:29,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-10-14 21:50:29,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:29,292 INFO L225 Difference]: With dead ends: 73 [2019-10-14 21:50:29,293 INFO L226 Difference]: Without dead ends: 50 [2019-10-14 21:50:29,294 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:50:29,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-14 21:50:29,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2019-10-14 21:50:29,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-14 21:50:29,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2019-10-14 21:50:29,302 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 28 [2019-10-14 21:50:29,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:29,302 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2019-10-14 21:50:29,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 21:50:29,302 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2019-10-14 21:50:29,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-14 21:50:29,303 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:29,303 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:29,304 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:29,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:29,304 INFO L82 PathProgramCache]: Analyzing trace with hash -183866139, now seen corresponding path program 1 times [2019-10-14 21:50:29,304 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:29,304 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067296620] [2019-10-14 21:50:29,305 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:29,305 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:29,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:29,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:29,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:29,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:29,435 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:29,436 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067296620] [2019-10-14 21:50:29,436 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505841842] [2019-10-14 21:50:29,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:29,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:29,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-14 21:50:29,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:29,558 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-14 21:50:29,558 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:29,570 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:29,571 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:29,572 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-10-14 21:50:29,607 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:29,608 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-10-14 21:50:29,609 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:29,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:29,620 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:29,620 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-10-14 21:50:29,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:29,628 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-10-14 21:50:29,628 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:29,639 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:29,639 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:29,640 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 [2019-10-14 21:50:29,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:29,768 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:29,769 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:29,769 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2019-10-14 21:50:29,769 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465883332] [2019-10-14 21:50:29,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-14 21:50:29,770 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:29,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-14 21:50:29,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-10-14 21:50:29,771 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 18 states. [2019-10-14 21:50:33,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:33,151 INFO L93 Difference]: Finished difference Result 146 states and 184 transitions. [2019-10-14 21:50:33,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-14 21:50:33,152 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 31 [2019-10-14 21:50:33,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:33,154 INFO L225 Difference]: With dead ends: 146 [2019-10-14 21:50:33,154 INFO L226 Difference]: Without dead ends: 121 [2019-10-14 21:50:33,156 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=328, Invalid=1232, Unknown=0, NotChecked=0, Total=1560 [2019-10-14 21:50:33,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-10-14 21:50:33,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 72. [2019-10-14 21:50:33,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-14 21:50:33,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2019-10-14 21:50:33,170 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 86 transitions. Word has length 31 [2019-10-14 21:50:33,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:33,171 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 86 transitions. [2019-10-14 21:50:33,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-14 21:50:33,171 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2019-10-14 21:50:33,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-14 21:50:33,173 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:33,173 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:33,380 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:33,381 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:33,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:33,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1823363683, now seen corresponding path program 1 times [2019-10-14 21:50:33,382 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:33,382 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615511364] [2019-10-14 21:50:33,383 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:33,383 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:33,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:33,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:33,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:33,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:33,532 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:33,532 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615511364] [2019-10-14 21:50:33,533 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367349659] [2019-10-14 21:50:33,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:33,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:33,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-14 21:50:33,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:33,646 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-14 21:50:33,646 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:33,655 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:33,656 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:33,656 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-10-14 21:50:33,685 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:33,687 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-10-14 21:50:33,688 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:33,700 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:33,700 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:33,700 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-10-14 21:50:33,730 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:33,732 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:33,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:33,736 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:33,737 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-10-14 21:50:33,737 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:33,746 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:33,747 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:33,747 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-10-14 21:50:33,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:33,871 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:33,872 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:33,872 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 17 [2019-10-14 21:50:33,872 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72863320] [2019-10-14 21:50:33,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-14 21:50:33,873 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:33,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-14 21:50:33,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-10-14 21:50:33,874 INFO L87 Difference]: Start difference. First operand 72 states and 86 transitions. Second operand 17 states. [2019-10-14 21:50:34,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:34,733 INFO L93 Difference]: Finished difference Result 174 states and 210 transitions. [2019-10-14 21:50:34,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-14 21:50:34,733 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2019-10-14 21:50:34,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:34,734 INFO L225 Difference]: With dead ends: 174 [2019-10-14 21:50:34,734 INFO L226 Difference]: Without dead ends: 158 [2019-10-14 21:50:34,735 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=186, Invalid=626, Unknown=0, NotChecked=0, Total=812 [2019-10-14 21:50:34,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-10-14 21:50:34,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 72. [2019-10-14 21:50:34,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-14 21:50:34,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2019-10-14 21:50:34,758 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 86 transitions. Word has length 31 [2019-10-14 21:50:34,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:34,759 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 86 transitions. [2019-10-14 21:50:34,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-14 21:50:34,759 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2019-10-14 21:50:34,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-14 21:50:34,760 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:34,762 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:34,963 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:34,963 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:34,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:34,964 INFO L82 PathProgramCache]: Analyzing trace with hash -2048901787, now seen corresponding path program 1 times [2019-10-14 21:50:34,965 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:34,965 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21396730] [2019-10-14 21:50:34,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:34,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:34,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:34,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:35,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:35,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:35,089 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:35,090 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21396730] [2019-10-14 21:50:35,090 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175391121] [2019-10-14 21:50:35,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:35,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:35,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-14 21:50:35,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:35,175 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-14 21:50:35,176 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:35,182 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:35,183 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:35,183 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-10-14 21:50:35,211 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:35,212 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-10-14 21:50:35,213 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:35,223 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:35,224 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:35,224 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-10-14 21:50:35,251 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:35,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:35,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:35,254 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:35,254 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-10-14 21:50:35,255 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:35,261 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:35,262 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:35,262 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-10-14 21:50:35,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:35,423 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:50:35,424 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:35,424 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 21 [2019-10-14 21:50:35,424 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396845420] [2019-10-14 21:50:35,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-14 21:50:35,425 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:35,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-14 21:50:35,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2019-10-14 21:50:35,426 INFO L87 Difference]: Start difference. First operand 72 states and 86 transitions. Second operand 21 states. [2019-10-14 21:50:36,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:36,255 INFO L93 Difference]: Finished difference Result 156 states and 185 transitions. [2019-10-14 21:50:36,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-14 21:50:36,255 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 31 [2019-10-14 21:50:36,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:36,257 INFO L225 Difference]: With dead ends: 156 [2019-10-14 21:50:36,257 INFO L226 Difference]: Without dead ends: 154 [2019-10-14 21:50:36,258 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=189, Invalid=933, Unknown=0, NotChecked=0, Total=1122 [2019-10-14 21:50:36,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-10-14 21:50:36,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 122. [2019-10-14 21:50:36,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-10-14 21:50:36,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 147 transitions. [2019-10-14 21:50:36,295 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 147 transitions. Word has length 31 [2019-10-14 21:50:36,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:36,296 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 147 transitions. [2019-10-14 21:50:36,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-14 21:50:36,296 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 147 transitions. [2019-10-14 21:50:36,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-14 21:50:36,297 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:36,298 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:36,502 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:36,503 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:36,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:36,504 INFO L82 PathProgramCache]: Analyzing trace with hash 739082614, now seen corresponding path program 1 times [2019-10-14 21:50:36,504 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:36,504 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362357216] [2019-10-14 21:50:36,505 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:36,505 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:36,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:36,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:36,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:36,545 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-14 21:50:36,546 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362357216] [2019-10-14 21:50:36,546 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:50:36,546 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 21:50:36,546 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475075431] [2019-10-14 21:50:36,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 21:50:36,548 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:36,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 21:50:36,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:50:36,549 INFO L87 Difference]: Start difference. First operand 122 states and 147 transitions. Second operand 4 states. [2019-10-14 21:50:36,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:36,634 INFO L93 Difference]: Finished difference Result 148 states and 177 transitions. [2019-10-14 21:50:36,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 21:50:36,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-10-14 21:50:36,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:36,636 INFO L225 Difference]: With dead ends: 148 [2019-10-14 21:50:36,636 INFO L226 Difference]: Without dead ends: 123 [2019-10-14 21:50:36,637 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:50:36,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-10-14 21:50:36,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2019-10-14 21:50:36,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-10-14 21:50:36,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 145 transitions. [2019-10-14 21:50:36,675 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 145 transitions. Word has length 37 [2019-10-14 21:50:36,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:36,675 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 145 transitions. [2019-10-14 21:50:36,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 21:50:36,676 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 145 transitions. [2019-10-14 21:50:36,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-14 21:50:36,685 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:36,685 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:36,685 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:36,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:36,686 INFO L82 PathProgramCache]: Analyzing trace with hash -2055358474, now seen corresponding path program 2 times [2019-10-14 21:50:36,686 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:36,686 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431647879] [2019-10-14 21:50:36,686 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:36,687 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:36,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:36,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:36,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:36,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:36,740 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-14 21:50:36,740 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431647879] [2019-10-14 21:50:36,740 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:50:36,741 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 21:50:36,741 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975701311] [2019-10-14 21:50:36,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 21:50:36,742 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:36,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 21:50:36,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:50:36,743 INFO L87 Difference]: Start difference. First operand 122 states and 145 transitions. Second operand 4 states. [2019-10-14 21:50:36,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:36,836 INFO L93 Difference]: Finished difference Result 124 states and 146 transitions. [2019-10-14 21:50:36,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 21:50:36,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-10-14 21:50:36,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:36,838 INFO L225 Difference]: With dead ends: 124 [2019-10-14 21:50:36,838 INFO L226 Difference]: Without dead ends: 99 [2019-10-14 21:50:36,839 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:50:36,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-10-14 21:50:36,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-10-14 21:50:36,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-14 21:50:36,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 117 transitions. [2019-10-14 21:50:36,863 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 117 transitions. Word has length 37 [2019-10-14 21:50:36,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:36,863 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 117 transitions. [2019-10-14 21:50:36,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 21:50:36,863 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 117 transitions. [2019-10-14 21:50:36,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-14 21:50:36,864 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:36,864 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:36,865 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:36,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:36,865 INFO L82 PathProgramCache]: Analyzing trace with hash -68187980, now seen corresponding path program 2 times [2019-10-14 21:50:36,865 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:36,866 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108954487] [2019-10-14 21:50:36,866 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:36,866 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:36,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:36,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:37,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:37,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:37,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:37,044 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 21:50:37,044 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108954487] [2019-10-14 21:50:37,045 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524758441] [2019-10-14 21:50:37,045 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:37,105 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 21:50:37,105 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:50:37,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-14 21:50:37,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:37,162 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-14 21:50:37,162 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:37,176 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:37,177 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:37,177 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-10-14 21:50:37,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:37,213 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-10-14 21:50:37,214 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:37,225 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:37,226 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:37,227 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:31 [2019-10-14 21:50:37,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:37,490 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 21:50:37,491 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:37,491 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2019-10-14 21:50:37,491 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963773539] [2019-10-14 21:50:37,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-14 21:50:37,492 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:37,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-14 21:50:37,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2019-10-14 21:50:37,493 INFO L87 Difference]: Start difference. First operand 99 states and 117 transitions. Second operand 21 states. [2019-10-14 21:50:38,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:38,907 INFO L93 Difference]: Finished difference Result 242 states and 295 transitions. [2019-10-14 21:50:38,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-14 21:50:38,908 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2019-10-14 21:50:38,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:38,910 INFO L225 Difference]: With dead ends: 242 [2019-10-14 21:50:38,910 INFO L226 Difference]: Without dead ends: 212 [2019-10-14 21:50:38,911 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=336, Invalid=1470, Unknown=0, NotChecked=0, Total=1806 [2019-10-14 21:50:38,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-10-14 21:50:38,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 150. [2019-10-14 21:50:38,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-10-14 21:50:38,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 182 transitions. [2019-10-14 21:50:38,935 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 182 transitions. Word has length 40 [2019-10-14 21:50:38,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:38,936 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 182 transitions. [2019-10-14 21:50:38,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-14 21:50:38,936 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 182 transitions. [2019-10-14 21:50:38,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-14 21:50:38,937 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:38,937 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:39,141 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:39,141 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:39,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:39,142 INFO L82 PathProgramCache]: Analyzing trace with hash -577661070, now seen corresponding path program 1 times [2019-10-14 21:50:39,142 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:39,143 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161132904] [2019-10-14 21:50:39,143 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:39,143 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:39,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:39,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:39,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:39,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:39,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:39,287 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 21:50:39,287 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161132904] [2019-10-14 21:50:39,287 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472507551] [2019-10-14 21:50:39,287 INFO L94 rtionOrderModulation]: Keeping assertion order 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-14 21:50:39,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:39,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-14 21:50:39,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:39,393 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-14 21:50:39,394 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:39,401 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:39,402 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:39,402 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-10-14 21:50:39,422 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:39,423 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-10-14 21:50:39,424 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:39,431 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:39,432 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:39,432 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-10-14 21:50:39,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:39,627 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 21:50:39,628 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:39,628 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2019-10-14 21:50:39,628 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550523372] [2019-10-14 21:50:39,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-14 21:50:39,629 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:39,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-14 21:50:39,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2019-10-14 21:50:39,630 INFO L87 Difference]: Start difference. First operand 150 states and 182 transitions. Second operand 18 states. [2019-10-14 21:50:40,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:40,726 INFO L93 Difference]: Finished difference Result 348 states and 426 transitions. [2019-10-14 21:50:40,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-14 21:50:40,727 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 40 [2019-10-14 21:50:40,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:40,729 INFO L225 Difference]: With dead ends: 348 [2019-10-14 21:50:40,729 INFO L226 Difference]: Without dead ends: 318 [2019-10-14 21:50:40,730 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=277, Invalid=1129, Unknown=0, NotChecked=0, Total=1406 [2019-10-14 21:50:40,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-10-14 21:50:40,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 131. [2019-10-14 21:50:40,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-10-14 21:50:40,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 161 transitions. [2019-10-14 21:50:40,752 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 161 transitions. Word has length 40 [2019-10-14 21:50:40,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:40,753 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 161 transitions. [2019-10-14 21:50:40,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-14 21:50:40,753 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 161 transitions. [2019-10-14 21:50:40,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-14 21:50:40,753 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:40,753 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:40,956 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:40,957 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:40,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:40,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1318015414, now seen corresponding path program 1 times [2019-10-14 21:50:40,958 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:40,958 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812168236] [2019-10-14 21:50:40,959 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:40,959 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:40,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:40,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:40,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:41,005 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-14 21:50:41,005 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812168236] [2019-10-14 21:50:41,005 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:50:41,005 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 21:50:41,006 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270444666] [2019-10-14 21:50:41,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 21:50:41,006 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:41,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 21:50:41,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 21:50:41,007 INFO L87 Difference]: Start difference. First operand 131 states and 161 transitions. Second operand 5 states. [2019-10-14 21:50:41,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:41,140 INFO L93 Difference]: Finished difference Result 200 states and 247 transitions. [2019-10-14 21:50:41,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 21:50:41,140 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-10-14 21:50:41,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:41,143 INFO L225 Difference]: With dead ends: 200 [2019-10-14 21:50:41,144 INFO L226 Difference]: Without dead ends: 158 [2019-10-14 21:50:41,145 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 21:50:41,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-10-14 21:50:41,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 137. [2019-10-14 21:50:41,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-10-14 21:50:41,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 168 transitions. [2019-10-14 21:50:41,168 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 168 transitions. Word has length 40 [2019-10-14 21:50:41,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:41,169 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 168 transitions. [2019-10-14 21:50:41,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 21:50:41,170 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 168 transitions. [2019-10-14 21:50:41,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-14 21:50:41,170 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:41,170 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:41,171 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:41,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:41,171 INFO L82 PathProgramCache]: Analyzing trace with hash 808542324, now seen corresponding path program 1 times [2019-10-14 21:50:41,171 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:41,171 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111988110] [2019-10-14 21:50:41,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:41,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:41,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:41,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:41,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:41,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:41,316 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 21:50:41,316 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111988110] [2019-10-14 21:50:41,316 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176214131] [2019-10-14 21:50:41,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:41,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:41,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-14 21:50:41,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:41,410 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-14 21:50:41,411 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:41,416 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:41,417 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:41,417 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-10-14 21:50:41,448 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:41,449 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-10-14 21:50:41,449 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:41,455 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:41,455 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:41,456 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-10-14 21:50:41,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:41,690 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 21:50:41,691 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:41,691 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2019-10-14 21:50:41,691 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386754918] [2019-10-14 21:50:41,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-14 21:50:41,691 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:41,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-14 21:50:41,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2019-10-14 21:50:41,692 INFO L87 Difference]: Start difference. First operand 137 states and 168 transitions. Second operand 22 states. [2019-10-14 21:50:42,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:42,778 INFO L93 Difference]: Finished difference Result 255 states and 306 transitions. [2019-10-14 21:50:42,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-14 21:50:42,779 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2019-10-14 21:50:42,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:42,781 INFO L225 Difference]: With dead ends: 255 [2019-10-14 21:50:42,781 INFO L226 Difference]: Without dead ends: 253 [2019-10-14 21:50:42,782 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=233, Invalid=1249, Unknown=0, NotChecked=0, Total=1482 [2019-10-14 21:50:42,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-10-14 21:50:42,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 201. [2019-10-14 21:50:42,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-10-14 21:50:42,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 245 transitions. [2019-10-14 21:50:42,811 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 245 transitions. Word has length 40 [2019-10-14 21:50:42,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:42,812 INFO L462 AbstractCegarLoop]: Abstraction has 201 states and 245 transitions. [2019-10-14 21:50:42,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-14 21:50:42,812 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 245 transitions. [2019-10-14 21:50:42,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-14 21:50:42,813 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:42,813 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:43,016 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:43,017 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:43,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:43,018 INFO L82 PathProgramCache]: Analyzing trace with hash 754664901, now seen corresponding path program 3 times [2019-10-14 21:50:43,018 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:43,018 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349065462] [2019-10-14 21:50:43,018 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:43,019 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:43,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:43,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:43,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:43,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:43,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:43,138 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-14 21:50:43,139 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349065462] [2019-10-14 21:50:43,139 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328936613] [2019-10-14 21:50:43,139 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-14 21:50:43,194 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-14 21:50:43,195 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:50:43,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-14 21:50:43,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:43,232 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-14 21:50:43,233 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:43,237 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:43,237 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:43,237 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-10-14 21:50:43,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:43,484 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-14 21:50:43,484 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:43,485 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2019-10-14 21:50:43,485 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93454264] [2019-10-14 21:50:43,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-14 21:50:43,486 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:43,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-14 21:50:43,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2019-10-14 21:50:43,486 INFO L87 Difference]: Start difference. First operand 201 states and 245 transitions. Second operand 20 states. [2019-10-14 21:50:46,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:46,684 INFO L93 Difference]: Finished difference Result 337 states and 405 transitions. [2019-10-14 21:50:46,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-14 21:50:46,685 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 49 [2019-10-14 21:50:46,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:46,687 INFO L225 Difference]: With dead ends: 337 [2019-10-14 21:50:46,687 INFO L226 Difference]: Without dead ends: 289 [2019-10-14 21:50:46,689 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=355, Invalid=1625, Unknown=0, NotChecked=0, Total=1980 [2019-10-14 21:50:46,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-10-14 21:50:46,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 227. [2019-10-14 21:50:46,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-10-14 21:50:46,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 273 transitions. [2019-10-14 21:50:46,725 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 273 transitions. Word has length 49 [2019-10-14 21:50:46,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:46,726 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 273 transitions. [2019-10-14 21:50:46,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-14 21:50:46,726 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 273 transitions. [2019-10-14 21:50:46,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-14 21:50:46,727 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:46,727 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:46,930 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:46,931 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:46,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:46,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1414196423, now seen corresponding path program 2 times [2019-10-14 21:50:46,932 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:46,932 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849641403] [2019-10-14 21:50:46,933 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:46,933 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:46,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:46,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:47,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:47,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:47,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:47,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:47,073 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-14 21:50:47,074 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849641403] [2019-10-14 21:50:47,074 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662770596] [2019-10-14 21:50:47,074 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:47,134 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 21:50:47,134 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:50:47,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-14 21:50:47,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:47,165 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-14 21:50:47,166 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:47,170 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:47,170 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:47,170 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-10-14 21:50:47,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:47,448 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-14 21:50:47,448 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:47,448 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2019-10-14 21:50:47,448 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763793906] [2019-10-14 21:50:47,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-14 21:50:47,449 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:47,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-14 21:50:47,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2019-10-14 21:50:47,450 INFO L87 Difference]: Start difference. First operand 227 states and 273 transitions. Second operand 23 states. [2019-10-14 21:50:49,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:49,237 INFO L93 Difference]: Finished difference Result 438 states and 529 transitions. [2019-10-14 21:50:49,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-14 21:50:49,237 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 49 [2019-10-14 21:50:49,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:49,240 INFO L225 Difference]: With dead ends: 438 [2019-10-14 21:50:49,240 INFO L226 Difference]: Without dead ends: 436 [2019-10-14 21:50:49,245 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=336, Invalid=2016, Unknown=0, NotChecked=0, Total=2352 [2019-10-14 21:50:49,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-10-14 21:50:49,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 323. [2019-10-14 21:50:49,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-10-14 21:50:49,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 394 transitions. [2019-10-14 21:50:49,301 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 394 transitions. Word has length 49 [2019-10-14 21:50:49,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:49,302 INFO L462 AbstractCegarLoop]: Abstraction has 323 states and 394 transitions. [2019-10-14 21:50:49,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-14 21:50:49,302 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 394 transitions. [2019-10-14 21:50:49,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-14 21:50:49,303 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:49,303 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:49,508 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:49,508 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:49,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:49,509 INFO L82 PathProgramCache]: Analyzing trace with hash -396413684, now seen corresponding path program 1 times [2019-10-14 21:50:49,509 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:49,509 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327025102] [2019-10-14 21:50:49,510 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:49,510 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:49,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:49,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:49,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:49,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:49,550 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-14 21:50:49,551 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327025102] [2019-10-14 21:50:49,551 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:50:49,551 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 21:50:49,551 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737753600] [2019-10-14 21:50:49,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 21:50:49,552 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:49,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 21:50:49,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:50:49,552 INFO L87 Difference]: Start difference. First operand 323 states and 394 transitions. Second operand 4 states. [2019-10-14 21:50:49,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:49,682 INFO L93 Difference]: Finished difference Result 396 states and 484 transitions. [2019-10-14 21:50:49,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 21:50:49,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-10-14 21:50:49,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:49,685 INFO L225 Difference]: With dead ends: 396 [2019-10-14 21:50:49,685 INFO L226 Difference]: Without dead ends: 285 [2019-10-14 21:50:49,686 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:50:49,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-10-14 21:50:49,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 270. [2019-10-14 21:50:49,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-10-14 21:50:49,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 325 transitions. [2019-10-14 21:50:49,733 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 325 transitions. Word has length 52 [2019-10-14 21:50:49,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:49,733 INFO L462 AbstractCegarLoop]: Abstraction has 270 states and 325 transitions. [2019-10-14 21:50:49,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 21:50:49,733 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 325 transitions. [2019-10-14 21:50:49,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-14 21:50:49,735 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:49,735 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:49,735 INFO L410 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:49,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:49,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1654570314, now seen corresponding path program 1 times [2019-10-14 21:50:49,735 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:49,736 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114153762] [2019-10-14 21:50:49,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:49,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:49,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:49,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:49,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:49,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:49,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:49,771 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-14 21:50:49,771 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114153762] [2019-10-14 21:50:49,771 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:50:49,771 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 21:50:49,772 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261144283] [2019-10-14 21:50:49,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 21:50:49,772 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:49,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 21:50:49,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:50:49,773 INFO L87 Difference]: Start difference. First operand 270 states and 325 transitions. Second operand 4 states. [2019-10-14 21:50:49,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:49,922 INFO L93 Difference]: Finished difference Result 415 states and 504 transitions. [2019-10-14 21:50:49,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 21:50:49,922 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-10-14 21:50:49,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:49,925 INFO L225 Difference]: With dead ends: 415 [2019-10-14 21:50:49,925 INFO L226 Difference]: Without dead ends: 302 [2019-10-14 21:50:49,926 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:50:49,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-10-14 21:50:49,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 268. [2019-10-14 21:50:49,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-10-14 21:50:49,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 320 transitions. [2019-10-14 21:50:49,992 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 320 transitions. Word has length 52 [2019-10-14 21:50:49,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:49,993 INFO L462 AbstractCegarLoop]: Abstraction has 268 states and 320 transitions. [2019-10-14 21:50:49,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 21:50:49,993 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 320 transitions. [2019-10-14 21:50:49,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-14 21:50:49,995 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:49,995 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:49,995 INFO L410 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:49,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:49,996 INFO L82 PathProgramCache]: Analyzing trace with hash 692013642, now seen corresponding path program 2 times [2019-10-14 21:50:49,996 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:49,996 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618439227] [2019-10-14 21:50:49,996 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:49,997 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:49,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:50,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:50,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:50,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:50,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:50,048 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-14 21:50:50,048 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618439227] [2019-10-14 21:50:50,048 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:50:50,048 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 21:50:50,049 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872051687] [2019-10-14 21:50:50,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 21:50:50,049 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:50,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 21:50:50,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:50:50,050 INFO L87 Difference]: Start difference. First operand 268 states and 320 transitions. Second operand 4 states. [2019-10-14 21:50:50,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:50,190 INFO L93 Difference]: Finished difference Result 337 states and 399 transitions. [2019-10-14 21:50:50,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 21:50:50,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-10-14 21:50:50,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:50,203 INFO L225 Difference]: With dead ends: 337 [2019-10-14 21:50:50,203 INFO L226 Difference]: Without dead ends: 246 [2019-10-14 21:50:50,204 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:50:50,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-10-14 21:50:50,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 242. [2019-10-14 21:50:50,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-10-14 21:50:50,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 286 transitions. [2019-10-14 21:50:50,259 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 286 transitions. Word has length 52 [2019-10-14 21:50:50,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:50,260 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 286 transitions. [2019-10-14 21:50:50,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 21:50:50,260 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 286 transitions. [2019-10-14 21:50:50,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-14 21:50:50,262 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:50,262 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:50,263 INFO L410 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:50,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:50,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1773448148, now seen corresponding path program 4 times [2019-10-14 21:50:50,264 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:50,264 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723699873] [2019-10-14 21:50:50,264 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:50,264 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:50,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:50,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:50,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:50,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:50,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:50,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:50,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:50,656 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 34 proven. 17 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-14 21:50:50,657 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723699873] [2019-10-14 21:50:50,657 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996723528] [2019-10-14 21:50:50,657 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:50,708 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-14 21:50:50,708 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:50:50,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-14 21:50:50,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:50,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 21:50:50,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:50,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:50,979 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 50 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-14 21:50:50,979 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:50,980 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2019-10-14 21:50:50,980 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812184923] [2019-10-14 21:50:50,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-14 21:50:50,981 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:50,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-14 21:50:50,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2019-10-14 21:50:50,981 INFO L87 Difference]: Start difference. First operand 242 states and 286 transitions. Second operand 21 states. [2019-10-14 21:50:51,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:51,514 INFO L93 Difference]: Finished difference Result 458 states and 527 transitions. [2019-10-14 21:50:51,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-14 21:50:51,515 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 58 [2019-10-14 21:50:51,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:51,517 INFO L225 Difference]: With dead ends: 458 [2019-10-14 21:50:51,517 INFO L226 Difference]: Without dead ends: 257 [2019-10-14 21:50:51,518 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2019-10-14 21:50:51,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-10-14 21:50:51,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 232. [2019-10-14 21:50:51,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-14 21:50:51,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 268 transitions. [2019-10-14 21:50:51,567 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 268 transitions. Word has length 58 [2019-10-14 21:50:51,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:51,567 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 268 transitions. [2019-10-14 21:50:51,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-14 21:50:51,568 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 268 transitions. [2019-10-14 21:50:51,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-14 21:50:51,569 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:51,569 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:51,772 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:51,773 INFO L410 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:51,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:51,773 INFO L82 PathProgramCache]: Analyzing trace with hash 175055585, now seen corresponding path program 5 times [2019-10-14 21:50:51,773 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:51,774 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979316895] [2019-10-14 21:50:51,774 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:51,774 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:51,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:51,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:51,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:52,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:52,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:52,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:52,020 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 12 proven. 46 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-14 21:50:52,020 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979316895] [2019-10-14 21:50:52,020 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149470189] [2019-10-14 21:50:52,021 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 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-14 21:50:52,111 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-10-14 21:50:52,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:50:52,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-14 21:50:52,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:52,162 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-14 21:50:52,162 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:52,170 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:52,171 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:52,171 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-10-14 21:50:52,203 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:52,203 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-10-14 21:50:52,204 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:52,214 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:52,215 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:52,215 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2019-10-14 21:50:52,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:52,290 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:52,291 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:52,293 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:52,293 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 43 [2019-10-14 21:50:52,294 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:52,307 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:52,308 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:52,308 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:46 [2019-10-14 21:50:52,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:52,347 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:52,347 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:52,348 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:52,349 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:52,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:52,353 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:52,353 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 58 [2019-10-14 21:50:52,354 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:52,368 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:52,368 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:52,369 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:46 [2019-10-14 21:50:52,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:52,380 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:52,381 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:52,381 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:52,382 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:52,383 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:52,385 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:52,385 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 58 [2019-10-14 21:50:52,386 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:52,398 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:52,398 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:52,399 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:68, output treesize:64 [2019-10-14 21:50:52,442 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:52,443 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:52,444 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:52,445 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:52,446 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:52,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:52,448 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:52,449 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:52,450 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:52,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:50:52,452 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:52,452 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 55 [2019-10-14 21:50:52,453 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:52,464 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:52,465 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:52,465 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2019-10-14 21:50:52,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:53,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:53,233 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 12 proven. 46 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-14 21:50:53,234 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:50:53,234 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 31 [2019-10-14 21:50:53,234 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410158771] [2019-10-14 21:50:53,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-14 21:50:53,234 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:50:53,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-14 21:50:53,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=842, Unknown=0, NotChecked=0, Total=930 [2019-10-14 21:50:53,235 INFO L87 Difference]: Start difference. First operand 232 states and 268 transitions. Second operand 31 states. [2019-10-14 21:50:55,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:50:55,975 INFO L93 Difference]: Finished difference Result 309 states and 354 transitions. [2019-10-14 21:50:55,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-14 21:50:55,976 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 64 [2019-10-14 21:50:55,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:50:55,978 INFO L225 Difference]: With dead ends: 309 [2019-10-14 21:50:55,978 INFO L226 Difference]: Without dead ends: 293 [2019-10-14 21:50:55,979 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 52 SyntacticMatches, 10 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=397, Invalid=2795, Unknown=0, NotChecked=0, Total=3192 [2019-10-14 21:50:55,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-10-14 21:50:56,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 275. [2019-10-14 21:50:56,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-10-14 21:50:56,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 318 transitions. [2019-10-14 21:50:56,033 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 318 transitions. Word has length 64 [2019-10-14 21:50:56,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:50:56,034 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 318 transitions. [2019-10-14 21:50:56,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-14 21:50:56,034 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 318 transitions. [2019-10-14 21:50:56,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-14 21:50:56,036 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:50:56,037 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:50:56,242 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:50:56,242 INFO L410 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:50:56,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:50:56,243 INFO L82 PathProgramCache]: Analyzing trace with hash -653298979, now seen corresponding path program 3 times [2019-10-14 21:50:56,243 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:50:56,243 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997630217] [2019-10-14 21:50:56,243 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:56,243 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:50:56,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:50:56,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:56,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:56,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:56,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:56,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:56,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:50:56,489 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 12 proven. 46 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-14 21:50:56,489 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997630217] [2019-10-14 21:50:56,490 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058335797] [2019-10-14 21:50:56,490 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 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-14 21:50:56,630 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-14 21:50:56,630 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:50:56,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-14 21:50:56,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:50:56,697 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-14 21:50:56,697 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:56,704 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:56,704 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:56,704 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-10-14 21:50:56,789 INFO L341 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2019-10-14 21:50:56,790 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2019-10-14 21:50:56,790 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:56,801 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:56,802 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:56,802 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:16 [2019-10-14 21:50:56,821 INFO L341 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2019-10-14 21:50:56,822 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2019-10-14 21:50:56,823 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:56,846 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:56,846 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:56,847 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:16 [2019-10-14 21:50:56,868 INFO L341 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2019-10-14 21:50:56,868 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2019-10-14 21:50:56,869 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:56,878 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:56,878 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:50:56,878 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:16 [2019-10-14 21:50:56,899 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:50:56,900 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 57 [2019-10-14 21:50:56,900 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:50:56,928 INFO L567 ElimStorePlain]: treesize reduction 32, result has 46.7 percent of original size [2019-10-14 21:50:56,929 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 21:50:56,929 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-10-14 21:50:57,104 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-10-14 21:50:59,222 WARN L191 SmtUtils]: Spent 507.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-10-14 21:51:02,385 WARN L191 SmtUtils]: Spent 477.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-10-14 21:51:03,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:51:03,993 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 38 proven. 29 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-14 21:51:03,994 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:51:03,994 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 26 [2019-10-14 21:51:03,994 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578646595] [2019-10-14 21:51:03,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-14 21:51:03,995 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:51:03,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-14 21:51:03,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-10-14 21:51:03,995 INFO L87 Difference]: Start difference. First operand 275 states and 318 transitions. Second operand 26 states. [2019-10-14 21:51:05,496 WARN L191 SmtUtils]: Spent 764.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-10-14 21:51:05,943 WARN L191 SmtUtils]: Spent 417.00 ms on a formula simplification that was a NOOP. DAG size: 30