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/mbpr2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 17:50:29,095 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 17:50:29,098 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 17:50:29,115 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 17:50:29,115 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 17:50:29,117 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 17:50:29,118 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 17:50:29,127 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 17:50:29,131 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 17:50:29,134 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 17:50:29,136 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 17:50:29,138 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 17:50:29,138 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 17:50:29,139 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 17:50:29,142 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 17:50:29,143 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 17:50:29,144 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 17:50:29,145 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 17:50:29,146 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 17:50:29,151 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 17:50:29,156 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 17:50:29,158 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 17:50:29,161 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 17:50:29,162 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 17:50:29,164 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 17:50:29,164 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 17:50:29,164 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 17:50:29,166 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 17:50:29,168 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 17:50:29,168 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 17:50:29,169 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 17:50:29,169 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 17:50:29,170 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 17:50:29,171 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 17:50:29,172 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 17:50:29,172 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 17:50:29,173 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 17:50:29,173 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 17:50:29,173 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 17:50:29,174 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 17:50:29,175 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 17:50:29,176 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 17:50:29,202 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 17:50:29,203 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 17:50:29,204 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 17:50:29,204 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 17:50:29,204 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 17:50:29,204 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 17:50:29,204 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 17:50:29,205 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 17:50:29,205 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 17:50:29,210 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 17:50:29,210 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 17:50:29,212 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 17:50:29,212 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 17:50:29,212 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 17:50:29,213 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 17:50:29,213 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 17:50:29,213 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 17:50:29,213 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 17:50:29,213 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 17:50:29,214 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 17:50:29,214 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 17:50:29,214 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 17:50:29,214 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 17:50:29,214 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 17:50:29,215 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 17:50:29,215 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 17:50:29,215 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 17:50:29,215 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 17:50:29,215 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 17:50:29,479 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 17:50:29,498 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 17:50:29,502 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 17:50:29,504 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 17:50:29,504 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 17:50:29,505 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/mbpr2.c [2019-10-13 17:50:29,578 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b571b0b8/4a22b5a4b67746b9a7c10af88156a634/FLAG886c519a4 [2019-10-13 17:50:30,043 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 17:50:30,043 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/mbpr2.c [2019-10-13 17:50:30,054 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b571b0b8/4a22b5a4b67746b9a7c10af88156a634/FLAG886c519a4 [2019-10-13 17:50:30,456 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b571b0b8/4a22b5a4b67746b9a7c10af88156a634 [2019-10-13 17:50:30,466 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 17:50:30,467 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 17:50:30,468 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 17:50:30,468 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 17:50:30,472 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 17:50:30,472 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:50:30" (1/1) ... [2019-10-13 17:50:30,475 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75d79651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:50:30, skipping insertion in model container [2019-10-13 17:50:30,475 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:50:30" (1/1) ... [2019-10-13 17:50:30,483 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 17:50:30,500 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 17:50:30,673 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 17:50:30,678 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 17:50:30,705 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 17:50:30,831 INFO L192 MainTranslator]: Completed translation [2019-10-13 17:50:30,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:50:30 WrapperNode [2019-10-13 17:50:30,832 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 17:50:30,833 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 17:50:30,833 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 17:50:30,833 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 17:50:30,847 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:50:30" (1/1) ... [2019-10-13 17:50:30,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:50:30" (1/1) ... [2019-10-13 17:50:30,868 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:50:30" (1/1) ... [2019-10-13 17:50:30,869 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:50:30" (1/1) ... [2019-10-13 17:50:30,889 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:50:30" (1/1) ... [2019-10-13 17:50:30,896 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:50:30" (1/1) ... [2019-10-13 17:50:30,900 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:50:30" (1/1) ... [2019-10-13 17:50:30,909 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 17:50:30,909 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 17:50:30,909 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 17:50:30,910 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 17:50:30,910 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:50:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 17:50:30,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 17:50:30,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 17:50:30,976 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 17:50:30,976 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 17:50:30,976 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 17:50:30,977 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 17:50:30,977 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 17:50:30,977 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 17:50:30,978 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 17:50:30,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 17:50:30,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 17:50:30,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 17:50:30,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 17:50:30,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 17:50:30,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 17:50:31,293 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 17:50:31,294 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-13 17:50:31,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:50:31 BoogieIcfgContainer [2019-10-13 17:50:31,295 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 17:50:31,296 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 17:50:31,296 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 17:50:31,299 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 17:50:31,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:50:30" (1/3) ... [2019-10-13 17:50:31,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61c3c331 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:50:31, skipping insertion in model container [2019-10-13 17:50:31,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:50:30" (2/3) ... [2019-10-13 17:50:31,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61c3c331 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:50:31, skipping insertion in model container [2019-10-13 17:50:31,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:50:31" (3/3) ... [2019-10-13 17:50:31,303 INFO L109 eAbstractionObserver]: Analyzing ICFG mbpr2.c [2019-10-13 17:50:31,311 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 17:50:31,318 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 17:50:31,328 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 17:50:31,353 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 17:50:31,353 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 17:50:31,354 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 17:50:31,354 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 17:50:31,354 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 17:50:31,354 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 17:50:31,354 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 17:50:31,354 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 17:50:31,371 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-10-13 17:50:31,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 17:50:31,379 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:50:31,380 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:50:31,382 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:50:31,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:50:31,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1027175342, now seen corresponding path program 1 times [2019-10-13 17:50:31,393 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:50:31,393 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162041902] [2019-10-13 17:50:31,393 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:50:31,393 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:50:31,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:50:31,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:31,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:31,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 17:50:31,610 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162041902] [2019-10-13 17:50:31,611 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 17:50:31,612 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 17:50:31,613 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362146187] [2019-10-13 17:50:31,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 17:50:31,618 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:50:31,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 17:50:31,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 17:50:31,631 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2019-10-13 17:50:31,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:50:31,752 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2019-10-13 17:50:31,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 17:50:31,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-13 17:50:31,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:50:31,763 INFO L225 Difference]: With dead ends: 58 [2019-10-13 17:50:31,763 INFO L226 Difference]: Without dead ends: 29 [2019-10-13 17:50:31,767 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 17:50:31,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-13 17:50:31,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-10-13 17:50:31,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-13 17:50:31,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2019-10-13 17:50:31,812 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 18 [2019-10-13 17:50:31,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:50:31,813 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2019-10-13 17:50:31,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 17:50:31,813 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2019-10-13 17:50:31,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 17:50:31,814 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:50:31,814 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:50:31,815 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:50:31,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:50:31,815 INFO L82 PathProgramCache]: Analyzing trace with hash 2086094079, now seen corresponding path program 1 times [2019-10-13 17:50:31,816 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:50:31,816 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114155562] [2019-10-13 17:50:31,816 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:50:31,816 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:50:31,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:50:31,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:31,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:31,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 17:50:31,948 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114155562] [2019-10-13 17:50:31,948 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 17:50:31,949 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 17:50:31,949 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689429350] [2019-10-13 17:50:31,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 17:50:31,951 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:50:31,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 17:50:31,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 17:50:31,952 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 6 states. [2019-10-13 17:50:32,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:50:32,107 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2019-10-13 17:50:32,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 17:50:32,108 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-10-13 17:50:32,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:50:32,110 INFO L225 Difference]: With dead ends: 37 [2019-10-13 17:50:32,110 INFO L226 Difference]: Without dead ends: 35 [2019-10-13 17:50:32,111 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-13 17:50:32,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-13 17:50:32,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-10-13 17:50:32,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-13 17:50:32,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2019-10-13 17:50:32,120 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 18 [2019-10-13 17:50:32,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:50:32,121 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2019-10-13 17:50:32,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 17:50:32,121 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2019-10-13 17:50:32,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 17:50:32,122 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:50:32,122 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:50:32,123 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:50:32,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:50:32,123 INFO L82 PathProgramCache]: Analyzing trace with hash 2087941121, now seen corresponding path program 1 times [2019-10-13 17:50:32,124 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:50:32,124 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074170493] [2019-10-13 17:50:32,124 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:50:32,124 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:50:32,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:50:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:32,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:32,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 17:50:32,241 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074170493] [2019-10-13 17:50:32,241 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 17:50:32,242 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 17:50:32,242 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865409934] [2019-10-13 17:50:32,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 17:50:32,243 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:50:32,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 17:50:32,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 17:50:32,243 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 5 states. [2019-10-13 17:50:32,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:50:32,403 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2019-10-13 17:50:32,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 17:50:32,405 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-13 17:50:32,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:50:32,410 INFO L225 Difference]: With dead ends: 64 [2019-10-13 17:50:32,410 INFO L226 Difference]: Without dead ends: 42 [2019-10-13 17:50:32,411 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 17:50:32,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-13 17:50:32,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2019-10-13 17:50:32,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-13 17:50:32,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2019-10-13 17:50:32,425 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 18 [2019-10-13 17:50:32,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:50:32,426 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-10-13 17:50:32,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 17:50:32,427 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2019-10-13 17:50:32,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 17:50:32,428 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:50:32,428 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, 1, 1, 1, 1] [2019-10-13 17:50:32,428 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:50:32,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:50:32,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1576263499, now seen corresponding path program 1 times [2019-10-13 17:50:32,429 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:50:32,430 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421971856] [2019-10-13 17:50:32,430 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:50:32,430 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:50:32,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:50:32,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:32,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:32,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 17:50:32,553 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421971856] [2019-10-13 17:50:32,553 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 17:50:32,554 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 17:50:32,554 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612741747] [2019-10-13 17:50:32,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 17:50:32,554 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:50:32,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 17:50:32,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 17:50:32,558 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 4 states. [2019-10-13 17:50:32,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:50:32,625 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2019-10-13 17:50:32,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 17:50:32,626 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-10-13 17:50:32,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:50:32,627 INFO L225 Difference]: With dead ends: 57 [2019-10-13 17:50:32,627 INFO L226 Difference]: Without dead ends: 36 [2019-10-13 17:50:32,628 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 17:50:32,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-13 17:50:32,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-10-13 17:50:32,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-13 17:50:32,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-10-13 17:50:32,635 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 26 [2019-10-13 17:50:32,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:50:32,636 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-10-13 17:50:32,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 17:50:32,636 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-10-13 17:50:32,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 17:50:32,637 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:50:32,637 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, 1, 1, 1, 1] [2019-10-13 17:50:32,637 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:50:32,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:50:32,638 INFO L82 PathProgramCache]: Analyzing trace with hash -2017639219, now seen corresponding path program 1 times [2019-10-13 17:50:32,638 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:50:32,638 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602900257] [2019-10-13 17:50:32,638 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:50:32,639 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:50:32,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:50:32,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:33,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:33,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 17:50:33,509 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602900257] [2019-10-13 17:50:33,509 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525235082] [2019-10-13 17:50:33,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:50:33,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:33,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-13 17:50:33,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:50:33,691 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-13 17:50:33,692 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:50:33,705 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:50:33,706 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 17:50:33,706 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-10-13 17:50:33,749 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:50:33,751 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:50:33,751 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 20 [2019-10-13 17:50:33,752 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:50:33,764 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:50:33,764 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 17:50:33,765 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-10-13 17:50:33,858 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:50:33,860 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2019-10-13 17:50:33,860 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:50:33,873 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:50:33,874 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 17:50:33,874 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-10-13 17:50:33,915 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:50:33,917 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:50:33,935 INFO L341 Elim1Store]: treesize reduction 26, result has 44.7 percent of original size [2019-10-13 17:50:33,935 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 51 [2019-10-13 17:50:33,936 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:50:33,962 INFO L567 ElimStorePlain]: treesize reduction 26, result has 52.7 percent of original size [2019-10-13 17:50:33,964 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-13 17:50:33,964 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:29 [2019-10-13 17:50:34,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:50:34,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 17:50:34,109 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:50:34,109 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2019-10-13 17:50:34,109 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620167733] [2019-10-13 17:50:34,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-13 17:50:34,110 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:50:34,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-13 17:50:34,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2019-10-13 17:50:34,111 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 22 states. [2019-10-13 17:50:36,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:50:36,388 INFO L93 Difference]: Finished difference Result 125 states and 154 transitions. [2019-10-13 17:50:36,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-13 17:50:36,389 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 26 [2019-10-13 17:50:36,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:50:36,392 INFO L225 Difference]: With dead ends: 125 [2019-10-13 17:50:36,392 INFO L226 Difference]: Without dead ends: 98 [2019-10-13 17:50:36,393 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=501, Invalid=1755, Unknown=0, NotChecked=0, Total=2256 [2019-10-13 17:50:36,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-10-13 17:50:36,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 38. [2019-10-13 17:50:36,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-13 17:50:36,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2019-10-13 17:50:36,409 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 26 [2019-10-13 17:50:36,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:50:36,409 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2019-10-13 17:50:36,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-13 17:50:36,410 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2019-10-13 17:50:36,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-13 17:50:36,411 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:50:36,411 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, 1, 1, 1, 1] [2019-10-13 17:50:36,622 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:50:36,623 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:50:36,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:50:36,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1612272465, now seen corresponding path program 1 times [2019-10-13 17:50:36,624 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:50:36,625 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986905653] [2019-10-13 17:50:36,625 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:50:36,625 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:50:36,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:50:36,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:37,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:37,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:37,247 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 17:50:37,248 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986905653] [2019-10-13 17:50:37,248 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148730006] [2019-10-13 17:50:37,248 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-13 17:50:37,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:37,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-13 17:50:37,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:50:37,344 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-13 17:50:37,344 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:50:37,350 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:50:37,350 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 17:50:37,351 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-10-13 17:50:37,378 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:50:37,379 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:50:37,380 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 20 [2019-10-13 17:50:37,394 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:50:37,401 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:50:37,401 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 17:50:37,401 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:13 [2019-10-13 17:50:37,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:50:37,540 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 17:50:37,540 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:50:37,540 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 24 [2019-10-13 17:50:37,540 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796683656] [2019-10-13 17:50:37,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-13 17:50:37,541 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:50:37,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-13 17:50:37,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=485, Unknown=0, NotChecked=0, Total=552 [2019-10-13 17:50:37,542 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 24 states. [2019-10-13 17:50:39,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:50:39,142 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2019-10-13 17:50:39,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-13 17:50:39,143 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 35 [2019-10-13 17:50:39,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:50:39,146 INFO L225 Difference]: With dead ends: 109 [2019-10-13 17:50:39,146 INFO L226 Difference]: Without dead ends: 107 [2019-10-13 17:50:39,148 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 683 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=416, Invalid=2236, Unknown=0, NotChecked=0, Total=2652 [2019-10-13 17:50:39,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-10-13 17:50:39,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 48. [2019-10-13 17:50:39,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-13 17:50:39,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2019-10-13 17:50:39,158 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 35 [2019-10-13 17:50:39,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:50:39,159 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2019-10-13 17:50:39,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-13 17:50:39,159 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2019-10-13 17:50:39,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-13 17:50:39,161 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:50:39,161 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, 1, 1, 1, 1] [2019-10-13 17:50:39,362 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:50:39,363 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:50:39,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:50:39,364 INFO L82 PathProgramCache]: Analyzing trace with hash 692803917, now seen corresponding path program 2 times [2019-10-13 17:50:39,364 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:50:39,365 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168270593] [2019-10-13 17:50:39,365 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:50:39,365 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:50:39,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:50:39,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:39,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:39,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:39,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:39,681 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-13 17:50:39,681 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168270593] [2019-10-13 17:50:39,682 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727520132] [2019-10-13 17:50:39,682 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:50:39,727 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-13 17:50:39,727 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 17:50:39,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-13 17:50:39,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:50:39,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:50:39,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 17:50:39,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 17:50:39,918 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-13 17:50:39,918 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:50:39,919 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-10-13 17:50:39,919 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079358228] [2019-10-13 17:50:39,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-13 17:50:39,920 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:50:39,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-13 17:50:39,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2019-10-13 17:50:39,921 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 18 states. [2019-10-13 17:50:40,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:50:40,363 INFO L93 Difference]: Finished difference Result 125 states and 140 transitions. [2019-10-13 17:50:40,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 17:50:40,363 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 44 [2019-10-13 17:50:40,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:50:40,365 INFO L225 Difference]: With dead ends: 125 [2019-10-13 17:50:40,365 INFO L226 Difference]: Without dead ends: 65 [2019-10-13 17:50:40,366 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=144, Invalid=456, Unknown=0, NotChecked=0, Total=600 [2019-10-13 17:50:40,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-13 17:50:40,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2019-10-13 17:50:40,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-13 17:50:40,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2019-10-13 17:50:40,376 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 44 [2019-10-13 17:50:40,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:50:40,376 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2019-10-13 17:50:40,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-13 17:50:40,377 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2019-10-13 17:50:40,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-13 17:50:40,378 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:50:40,379 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:50:40,582 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:50:40,583 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:50:40,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:50:40,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1385442279, now seen corresponding path program 3 times [2019-10-13 17:50:40,584 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:50:40,584 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881537202] [2019-10-13 17:50:40,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:50:40,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:50:40,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:50:40,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:41,302 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-10-13 17:50:41,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:41,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:41,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:41,664 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-13 17:50:41,664 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881537202] [2019-10-13 17:50:41,665 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936441238] [2019-10-13 17:50:41,665 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:50:41,734 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-13 17:50:41,735 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 17:50:41,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-13 17:50:41,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:50:41,794 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-13 17:50:41,794 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:50:41,801 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:50:41,801 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 17:50:41,802 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-10-13 17:50:41,856 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:50:41,858 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:50:41,859 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 28 [2019-10-13 17:50:41,859 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:50:41,869 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:50:41,869 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 17:50:41,870 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:22 [2019-10-13 17:50:41,935 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:50:41,937 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-10-13 17:50:41,938 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:50:41,951 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:50:41,952 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 17:50:41,952 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-10-13 17:50:42,012 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:50:42,014 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:50:42,020 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:50:42,021 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:50:42,022 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 40 [2019-10-13 17:50:42,023 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:50:42,032 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:50:42,033 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-13 17:50:42,033 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:56, output treesize:31 [2019-10-13 17:50:42,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:50:42,324 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-13 17:50:42,325 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:50:42,325 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12] total 29 [2019-10-13 17:50:42,325 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045512016] [2019-10-13 17:50:42,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-13 17:50:42,328 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:50:42,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-13 17:50:42,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=675, Unknown=0, NotChecked=0, Total=812 [2019-10-13 17:50:42,328 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 29 states. [2019-10-13 17:50:44,222 WARN L191 SmtUtils]: Spent 907.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2019-10-13 17:50:45,010 WARN L191 SmtUtils]: Spent 689.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 35 [2019-10-13 17:50:46,024 WARN L191 SmtUtils]: Spent 701.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-10-13 17:50:47,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:50:47,378 INFO L93 Difference]: Finished difference Result 133 states and 157 transitions. [2019-10-13 17:50:47,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-13 17:50:47,378 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 52 [2019-10-13 17:50:47,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:50:47,381 INFO L225 Difference]: With dead ends: 133 [2019-10-13 17:50:47,381 INFO L226 Difference]: Without dead ends: 117 [2019-10-13 17:50:47,383 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 950 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=889, Invalid=3271, Unknown=0, NotChecked=0, Total=4160 [2019-10-13 17:50:47,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-10-13 17:50:47,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 56. [2019-10-13 17:50:47,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-13 17:50:47,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-10-13 17:50:47,396 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 52 [2019-10-13 17:50:47,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:50:47,396 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-10-13 17:50:47,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-13 17:50:47,397 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2019-10-13 17:50:47,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-13 17:50:47,398 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:50:47,398 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:50:47,602 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:50:47,603 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:50:47,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:50:47,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1898407767, now seen corresponding path program 4 times [2019-10-13 17:50:47,604 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:50:47,604 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586159893] [2019-10-13 17:50:47,605 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:50:47,605 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:50:47,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:50:47,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:48,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:48,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:48,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:48,489 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 17:50:48,489 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586159893] [2019-10-13 17:50:48,489 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091259145] [2019-10-13 17:50:48,490 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:50:48,557 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 17:50:48,558 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 17:50:48,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-13 17:50:48,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:50:48,676 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-13 17:50:48,676 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:50:48,686 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:50:48,687 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 17:50:48,687 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-10-13 17:50:48,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:50:48,727 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:50:48,728 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 22 [2019-10-13 17:50:48,728 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:50:48,734 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:50:48,734 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 17:50:48,735 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:16 [2019-10-13 17:50:48,804 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:50:48,805 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-10-13 17:50:48,805 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:50:48,816 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:50:48,817 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 17:50:48,817 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-10-13 17:50:48,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:50:48,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:50:48,870 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:50:48,872 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:50:48,872 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 40 [2019-10-13 17:50:48,873 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:50:48,881 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:50:48,881 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 17:50:48,881 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:31 [2019-10-13 17:50:48,923 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:50:48,925 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:50:48,926 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:50:48,926 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:50:48,927 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 35 treesize of output 37 [2019-10-13 17:50:48,928 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:50:48,943 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:50:48,943 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 17:50:48,943 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2019-10-13 17:50:48,992 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:50:48,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:50:48,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:50:48,994 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:50:48,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:50:49,026 INFO L341 Elim1Store]: treesize reduction 32, result has 43.9 percent of original size [2019-10-13 17:50:49,027 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 56 treesize of output 67 [2019-10-13 17:50:49,028 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:50:49,051 INFO L567 ElimStorePlain]: treesize reduction 30, result has 57.1 percent of original size [2019-10-13 17:50:49,052 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-13 17:50:49,052 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:40 [2019-10-13 17:50:49,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:50:49,467 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 17:50:49,467 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:50:49,468 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 34 [2019-10-13 17:50:49,468 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162331067] [2019-10-13 17:50:49,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-13 17:50:49,468 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:50:49,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-13 17:50:49,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=979, Unknown=0, NotChecked=0, Total=1122 [2019-10-13 17:50:49,469 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 34 states. [2019-10-13 17:50:53,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:50:53,281 INFO L93 Difference]: Finished difference Result 129 states and 149 transitions. [2019-10-13 17:50:53,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-13 17:50:53,282 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 52 [2019-10-13 17:50:53,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:50:53,284 INFO L225 Difference]: With dead ends: 129 [2019-10-13 17:50:53,284 INFO L226 Difference]: Without dead ends: 113 [2019-10-13 17:50:53,287 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 45 SyntacticMatches, 8 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1319 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=977, Invalid=4425, Unknown=0, NotChecked=0, Total=5402 [2019-10-13 17:50:53,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-10-13 17:50:53,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 60. [2019-10-13 17:50:53,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-13 17:50:53,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2019-10-13 17:50:53,300 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 52 [2019-10-13 17:50:53,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:50:53,300 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2019-10-13 17:50:53,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-13 17:50:53,300 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2019-10-13 17:50:53,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-13 17:50:53,302 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:50:53,302 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:50:53,506 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:50:53,506 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:50:53,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:50:53,507 INFO L82 PathProgramCache]: Analyzing trace with hash -561222649, now seen corresponding path program 5 times [2019-10-13 17:50:53,507 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:50:53,507 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790204661] [2019-10-13 17:50:53,507 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:50:53,507 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:50:53,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:50:53,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:53,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:53,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:53,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:53,908 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 17:50:53,909 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790204661] [2019-10-13 17:50:53,909 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54007450] [2019-10-13 17:50:53,909 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:50:53,976 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-10-13 17:50:53,977 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 17:50:53,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-13 17:50:53,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:50:54,072 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-13 17:50:54,072 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:50:54,078 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:50:54,079 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 17:50:54,079 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-10-13 17:50:54,114 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:50:54,116 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:50:54,116 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 22 [2019-10-13 17:50:54,117 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:50:54,120 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:50:54,121 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 17:50:54,121 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:13 [2019-10-13 17:50:54,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:50:54,490 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 17:50:54,490 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:50:54,490 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 14] total 32 [2019-10-13 17:50:54,491 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876650460] [2019-10-13 17:50:54,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-13 17:50:54,491 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:50:54,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-13 17:50:54,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=883, Unknown=0, NotChecked=0, Total=992 [2019-10-13 17:50:54,492 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 32 states. [2019-10-13 17:50:56,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:50:56,967 INFO L93 Difference]: Finished difference Result 192 states and 214 transitions. [2019-10-13 17:50:56,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-10-13 17:50:56,967 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 61 [2019-10-13 17:50:56,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:50:56,970 INFO L225 Difference]: With dead ends: 192 [2019-10-13 17:50:56,970 INFO L226 Difference]: Without dead ends: 155 [2019-10-13 17:50:56,972 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 56 SyntacticMatches, 7 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1587 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=708, Invalid=4842, Unknown=0, NotChecked=0, Total=5550 [2019-10-13 17:50:56,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-10-13 17:50:56,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 84. [2019-10-13 17:50:56,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-10-13 17:50:56,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2019-10-13 17:50:56,988 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 61 [2019-10-13 17:50:56,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:50:56,989 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2019-10-13 17:50:56,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-13 17:50:56,989 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2019-10-13 17:50:56,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-13 17:50:56,990 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:50:56,991 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:50:57,194 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:50:57,195 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:50:57,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:50:57,196 INFO L82 PathProgramCache]: Analyzing trace with hash -888558249, now seen corresponding path program 6 times [2019-10-13 17:50:57,196 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:50:57,196 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318014372] [2019-10-13 17:50:57,197 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:50:57,197 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:50:57,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:50:57,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:57,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:57,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:57,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:57,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:57,646 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 34 proven. 22 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-13 17:50:57,647 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318014372] [2019-10-13 17:50:57,647 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520124953] [2019-10-13 17:50:57,647 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:50:57,714 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-10-13 17:50:57,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 17:50:57,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-13 17:50:57,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:50:57,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:50:57,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 17:50:57,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 17:50:58,006 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 50 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-13 17:50:58,006 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:50:58,006 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2019-10-13 17:50:58,007 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049389960] [2019-10-13 17:50:58,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-13 17:50:58,007 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:50:58,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-13 17:50:58,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2019-10-13 17:50:58,008 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand 24 states. [2019-10-13 17:50:58,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:50:58,654 INFO L93 Difference]: Finished difference Result 146 states and 158 transitions. [2019-10-13 17:50:58,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-13 17:50:58,655 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 70 [2019-10-13 17:50:58,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:50:58,656 INFO L225 Difference]: With dead ends: 146 [2019-10-13 17:50:58,656 INFO L226 Difference]: Without dead ends: 84 [2019-10-13 17:50:58,658 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=236, Invalid=820, Unknown=0, NotChecked=0, Total=1056 [2019-10-13 17:50:58,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-10-13 17:50:58,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 78. [2019-10-13 17:50:58,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-10-13 17:50:58,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2019-10-13 17:50:58,670 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 70 [2019-10-13 17:50:58,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:50:58,671 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2019-10-13 17:50:58,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-13 17:50:58,671 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2019-10-13 17:50:58,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-13 17:50:58,672 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:50:58,672 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:50:58,885 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:50:58,885 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:50:58,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:50:58,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1067609565, now seen corresponding path program 7 times [2019-10-13 17:50:58,886 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:50:58,886 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829146210] [2019-10-13 17:50:58,886 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:50:58,886 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:50:58,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:50:58,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:59,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:59,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:59,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:59,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:59,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:59,615 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 29 proven. 50 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-13 17:50:59,615 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829146210] [2019-10-13 17:50:59,615 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801180711] [2019-10-13 17:50:59,615 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:50:59,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:50:59,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-13 17:50:59,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:50:59,751 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-13 17:50:59,751 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:50:59,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:50:59,759 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 17:50:59,760 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-10-13 17:50:59,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:50:59,795 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:50:59,795 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 28 [2019-10-13 17:50:59,796 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:50:59,806 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:50:59,806 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 17:50:59,806 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:22 [2019-10-13 17:50:59,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:50:59,845 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-10-13 17:50:59,846 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:50:59,855 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:50:59,855 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 17:50:59,855 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-10-13 17:50:59,897 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:50:59,899 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:50:59,900 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:50:59,901 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:50:59,902 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 40 [2019-10-13 17:50:59,902 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:50:59,912 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:50:59,913 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-13 17:50:59,913 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:56, output treesize:31 [2019-10-13 17:51:01,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:51:01,216 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 38 proven. 36 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-13 17:51:01,216 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:51:01,217 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 15] total 33 [2019-10-13 17:51:01,217 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592436420] [2019-10-13 17:51:01,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-13 17:51:01,217 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:51:01,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-13 17:51:01,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=917, Unknown=0, NotChecked=0, Total=1056 [2019-10-13 17:51:01,218 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 33 states. [2019-10-13 17:51:06,654 WARN L191 SmtUtils]: Spent 785.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2019-10-13 17:51:07,621 WARN L191 SmtUtils]: Spent 754.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 36 [2019-10-13 17:51:09,188 WARN L191 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2019-10-13 17:51:10,187 WARN L191 SmtUtils]: Spent 768.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 38 [2019-10-13 17:51:10,723 WARN L191 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 33 [2019-10-13 17:51:11,408 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-10-13 17:51:12,244 WARN L191 SmtUtils]: Spent 782.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 34 [2019-10-13 17:51:12,995 WARN L191 SmtUtils]: Spent 614.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2019-10-13 17:51:13,854 WARN L191 SmtUtils]: Spent 684.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 29