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/nr2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 21:49:40,034 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 21:49:40,037 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 21:49:40,053 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 21:49:40,054 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 21:49:40,055 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 21:49:40,056 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 21:49:40,057 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 21:49:40,059 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 21:49:40,060 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 21:49:40,061 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 21:49:40,062 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 21:49:40,062 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 21:49:40,063 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 21:49:40,064 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 21:49:40,065 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 21:49:40,066 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 21:49:40,067 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 21:49:40,068 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 21:49:40,070 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 21:49:40,072 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 21:49:40,073 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 21:49:40,074 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 21:49:40,074 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 21:49:40,077 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 21:49:40,077 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 21:49:40,077 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 21:49:40,078 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 21:49:40,079 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 21:49:40,080 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 21:49:40,080 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 21:49:40,081 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 21:49:40,082 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 21:49:40,082 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 21:49:40,083 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 21:49:40,084 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 21:49:40,084 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 21:49:40,084 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 21:49:40,085 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 21:49:40,087 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 21:49:40,088 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 21:49:40,091 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 21:49:40,113 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 21:49:40,113 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 21:49:40,115 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 21:49:40,115 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 21:49:40,116 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 21:49:40,116 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 21:49:40,116 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 21:49:40,116 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 21:49:40,116 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 21:49:40,117 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 21:49:40,118 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 21:49:40,118 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 21:49:40,118 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 21:49:40,118 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 21:49:40,119 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 21:49:40,119 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 21:49:40,119 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 21:49:40,119 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 21:49:40,119 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 21:49:40,120 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 21:49:40,120 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 21:49:40,120 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 21:49:40,120 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 21:49:40,121 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 21:49:40,121 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 21:49:40,121 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 21:49:40,121 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 21:49:40,121 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 21:49:40,121 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 21:49:40,374 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 21:49:40,388 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 21:49:40,392 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 21:49:40,393 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 21:49:40,394 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 21:49:40,394 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/nr2.c [2019-10-14 21:49:40,471 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b1f24912/c1166c5706bb40668c2ebca9956e4d17/FLAG50addb160 [2019-10-14 21:49:40,913 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 21:49:40,915 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/nr2.c [2019-10-14 21:49:40,922 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b1f24912/c1166c5706bb40668c2ebca9956e4d17/FLAG50addb160 [2019-10-14 21:49:41,339 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b1f24912/c1166c5706bb40668c2ebca9956e4d17 [2019-10-14 21:49:41,348 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 21:49:41,350 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 21:49:41,351 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 21:49:41,351 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 21:49:41,354 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 21:49:41,355 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:49:41" (1/1) ... [2019-10-14 21:49:41,358 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4db268e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:49:41, skipping insertion in model container [2019-10-14 21:49:41,358 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:49:41" (1/1) ... [2019-10-14 21:49:41,365 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 21:49:41,382 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 21:49:41,564 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 21:49:41,568 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 21:49:41,590 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 21:49:41,607 INFO L192 MainTranslator]: Completed translation [2019-10-14 21:49:41,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:49:41 WrapperNode [2019-10-14 21:49:41,608 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 21:49:41,609 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 21:49:41,609 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 21:49:41,609 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 21:49:41,705 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:49:41" (1/1) ... [2019-10-14 21:49:41,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:49:41" (1/1) ... [2019-10-14 21:49:41,713 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:49:41" (1/1) ... [2019-10-14 21:49:41,713 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:49:41" (1/1) ... [2019-10-14 21:49:41,719 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:49:41" (1/1) ... [2019-10-14 21:49:41,725 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:49:41" (1/1) ... [2019-10-14 21:49:41,726 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:49:41" (1/1) ... [2019-10-14 21:49:41,729 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 21:49:41,729 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 21:49:41,729 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 21:49:41,729 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 21:49:41,730 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:49:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 21:49:41,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 21:49:41,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 21:49:41,791 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-14 21:49:41,791 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 21:49:41,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 21:49:41,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-14 21:49:41,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-14 21:49:41,792 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 21:49:41,792 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 21:49:41,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-14 21:49:41,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 21:49:41,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 21:49:41,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 21:49:41,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 21:49:41,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 21:49:42,093 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 21:49:42,093 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-14 21:49:42,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:49:42 BoogieIcfgContainer [2019-10-14 21:49:42,095 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 21:49:42,102 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 21:49:42,102 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 21:49:42,105 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 21:49:42,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:49:41" (1/3) ... [2019-10-14 21:49:42,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30895dd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:49:42, skipping insertion in model container [2019-10-14 21:49:42,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:49:41" (2/3) ... [2019-10-14 21:49:42,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30895dd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:49:42, skipping insertion in model container [2019-10-14 21:49:42,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:49:42" (3/3) ... [2019-10-14 21:49:42,116 INFO L109 eAbstractionObserver]: Analyzing ICFG nr2.c [2019-10-14 21:49:42,128 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 21:49:42,133 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 21:49:42,143 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 21:49:42,162 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 21:49:42,162 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 21:49:42,162 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 21:49:42,162 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 21:49:42,162 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 21:49:42,162 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 21:49:42,163 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 21:49:42,163 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 21:49:42,177 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-10-14 21:49:42,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-14 21:49:42,182 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:49:42,183 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:49:42,185 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:49:42,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:49:42,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1453831941, now seen corresponding path program 1 times [2019-10-14 21:49:42,195 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:49:42,195 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813237979] [2019-10-14 21:49:42,196 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:42,196 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:42,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:49:42,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:42,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:42,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:42,440 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813237979] [2019-10-14 21:49:42,441 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:49:42,441 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 21:49:42,441 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699700967] [2019-10-14 21:49:42,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 21:49:42,446 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:49:42,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 21:49:42,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 21:49:42,458 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 6 states. [2019-10-14 21:49:42,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:49:42,714 INFO L93 Difference]: Finished difference Result 60 states and 81 transitions. [2019-10-14 21:49:42,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 21:49:42,716 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-10-14 21:49:42,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:49:42,728 INFO L225 Difference]: With dead ends: 60 [2019-10-14 21:49:42,728 INFO L226 Difference]: Without dead ends: 31 [2019-10-14 21:49:42,734 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-14 21:49:42,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-14 21:49:42,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-10-14 21:49:42,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-14 21:49:42,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-10-14 21:49:42,789 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 16 [2019-10-14 21:49:42,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:49:42,790 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-10-14 21:49:42,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 21:49:42,790 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-10-14 21:49:42,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-14 21:49:42,792 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:49:42,793 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:49:42,793 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:49:42,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:49:42,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1455678983, now seen corresponding path program 1 times [2019-10-14 21:49:42,795 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:49:42,796 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501695485] [2019-10-14 21:49:42,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:42,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:42,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:49:42,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:42,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:42,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:42,895 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501695485] [2019-10-14 21:49:42,896 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:49:42,896 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 21:49:42,896 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012568566] [2019-10-14 21:49:42,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 21:49:42,898 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:49:42,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 21:49:42,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-14 21:49:42,899 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2019-10-14 21:49:43,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:49:43,013 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2019-10-14 21:49:43,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 21:49:43,014 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-14 21:49:43,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:49:43,018 INFO L225 Difference]: With dead ends: 52 [2019-10-14 21:49:43,018 INFO L226 Difference]: Without dead ends: 35 [2019-10-14 21:49:43,019 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-14 21:49:43,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-14 21:49:43,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2019-10-14 21:49:43,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-14 21:49:43,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-10-14 21:49:43,028 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 16 [2019-10-14 21:49:43,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:49:43,028 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-10-14 21:49:43,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 21:49:43,029 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-10-14 21:49:43,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-14 21:49:43,030 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:49:43,030 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:49:43,030 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:49:43,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:49:43,031 INFO L82 PathProgramCache]: Analyzing trace with hash -2089835012, now seen corresponding path program 1 times [2019-10-14 21:49:43,031 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:49:43,032 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532310006] [2019-10-14 21:49:43,032 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:43,032 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:43,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:49:43,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:43,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:43,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:43,112 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532310006] [2019-10-14 21:49:43,112 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:49:43,112 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 21:49:43,112 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155709200] [2019-10-14 21:49:43,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 21:49:43,115 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:49:43,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 21:49:43,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:49:43,116 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 4 states. [2019-10-14 21:49:43,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:49:43,188 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2019-10-14 21:49:43,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 21:49:43,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-10-14 21:49:43,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:49:43,190 INFO L225 Difference]: With dead ends: 56 [2019-10-14 21:49:43,190 INFO L226 Difference]: Without dead ends: 34 [2019-10-14 21:49:43,191 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 21:49:43,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-14 21:49:43,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-10-14 21:49:43,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-14 21:49:43,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-10-14 21:49:43,198 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 19 [2019-10-14 21:49:43,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:49:43,199 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-10-14 21:49:43,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 21:49:43,199 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-10-14 21:49:43,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 21:49:43,200 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:49:43,200 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:49:43,200 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:49:43,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:49:43,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1382648830, now seen corresponding path program 1 times [2019-10-14 21:49:43,201 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:49:43,201 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044051317] [2019-10-14 21:49:43,202 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:43,202 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:43,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:49:43,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:43,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:43,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:43,262 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044051317] [2019-10-14 21:49:43,262 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:49:43,263 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 21:49:43,263 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205254392] [2019-10-14 21:49:43,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 21:49:43,263 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:49:43,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 21:49:43,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 21:49:43,264 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 5 states. [2019-10-14 21:49:43,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:49:43,337 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2019-10-14 21:49:43,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 21:49:43,338 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-10-14 21:49:43,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:49:43,339 INFO L225 Difference]: With dead ends: 57 [2019-10-14 21:49:43,339 INFO L226 Difference]: Without dead ends: 34 [2019-10-14 21:49:43,340 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 21:49:43,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-14 21:49:43,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-10-14 21:49:43,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-14 21:49:43,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-10-14 21:49:43,347 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 22 [2019-10-14 21:49:43,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:49:43,347 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-10-14 21:49:43,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 21:49:43,347 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-10-14 21:49:43,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 21:49:43,348 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:49:43,348 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:49:43,349 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:49:43,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:49:43,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1124483392, now seen corresponding path program 1 times [2019-10-14 21:49:43,349 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:49:43,350 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341079393] [2019-10-14 21:49:43,350 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:43,350 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:43,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:49:43,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:43,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:43,416 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341079393] [2019-10-14 21:49:43,416 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457427277] [2019-10-14 21:49:43,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:49:43,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:43,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 21:49:43,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:49:43,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:43,524 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:49:43,524 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2019-10-14 21:49:43,525 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550531500] [2019-10-14 21:49:43,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 21:49:43,525 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:49:43,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 21:49:43,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-14 21:49:43,526 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 5 states. [2019-10-14 21:49:43,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:49:43,621 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2019-10-14 21:49:43,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 21:49:43,621 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-10-14 21:49:43,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:49:43,622 INFO L225 Difference]: With dead ends: 59 [2019-10-14 21:49:43,622 INFO L226 Difference]: Without dead ends: 35 [2019-10-14 21:49:43,623 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-14 21:49:43,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-14 21:49:43,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-10-14 21:49:43,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-14 21:49:43,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-10-14 21:49:43,636 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 22 [2019-10-14 21:49:43,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:49:43,637 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-10-14 21:49:43,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 21:49:43,637 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-10-14 21:49:43,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-14 21:49:43,639 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:49:43,640 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:49:43,849 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:49:43,850 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:49:43,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:49:43,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1448609222, now seen corresponding path program 1 times [2019-10-14 21:49:43,850 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:49:43,850 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675609074] [2019-10-14 21:49:43,851 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:43,851 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:43,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:49:43,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:44,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:44,273 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:44,274 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675609074] [2019-10-14 21:49:44,274 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911914593] [2019-10-14 21:49:44,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:49:44,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:44,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-14 21:49:44,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:49:44,413 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-14 21:49:44,413 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:49:44,429 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:49:44,430 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:49:44,430 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-10-14 21:49:44,483 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:49:44,484 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 49 [2019-10-14 21:49:44,485 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:49:44,517 INFO L567 ElimStorePlain]: treesize reduction 17, result has 67.3 percent of original size [2019-10-14 21:49:44,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:44,522 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 21:49:44,522 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:35 [2019-10-14 21:49:44,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:44,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:44,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:45,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:45,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:45,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:45,300 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:45,301 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:49:45,301 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 20 [2019-10-14 21:49:45,301 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454099649] [2019-10-14 21:49:45,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-14 21:49:45,302 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:49:45,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-14 21:49:45,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=325, Unknown=1, NotChecked=0, Total=380 [2019-10-14 21:49:45,303 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 20 states. [2019-10-14 21:49:46,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:49:46,623 INFO L93 Difference]: Finished difference Result 118 states and 148 transitions. [2019-10-14 21:49:46,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-14 21:49:46,624 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 25 [2019-10-14 21:49:46,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:49:46,626 INFO L225 Difference]: With dead ends: 118 [2019-10-14 21:49:46,627 INFO L226 Difference]: Without dead ends: 102 [2019-10-14 21:49:46,628 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=235, Invalid=1246, Unknown=1, NotChecked=0, Total=1482 [2019-10-14 21:49:46,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-10-14 21:49:46,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 54. [2019-10-14 21:49:46,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-14 21:49:46,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2019-10-14 21:49:46,646 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 25 [2019-10-14 21:49:46,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:49:46,646 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2019-10-14 21:49:46,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-14 21:49:46,646 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2019-10-14 21:49:46,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-14 21:49:46,648 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:49:46,648 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:49:46,853 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:49:46,854 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:49:46,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:49:46,855 INFO L82 PathProgramCache]: Analyzing trace with hash -2033734151, now seen corresponding path program 1 times [2019-10-14 21:49:46,856 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:49:46,857 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983701274] [2019-10-14 21:49:46,857 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:46,858 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:46,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:49:46,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:47,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:47,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:47,107 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:47,107 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983701274] [2019-10-14 21:49:47,107 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279409819] [2019-10-14 21:49:47,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:49:47,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:47,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-14 21:49:47,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:49:47,165 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-14 21:49:47,165 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:49:47,170 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:49:47,171 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 21:49:47,172 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2019-10-14 21:49:49,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:49,275 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:49,275 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 21:49:49,275 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 18 [2019-10-14 21:49:49,275 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909323184] [2019-10-14 21:49:49,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-14 21:49:49,276 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:49:49,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-14 21:49:49,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=249, Unknown=1, NotChecked=0, Total=306 [2019-10-14 21:49:49,277 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand 18 states. [2019-10-14 21:49:51,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:49:51,848 INFO L93 Difference]: Finished difference Result 98 states and 114 transitions. [2019-10-14 21:49:51,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-14 21:49:51,849 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2019-10-14 21:49:51,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:49:51,851 INFO L225 Difference]: With dead ends: 98 [2019-10-14 21:49:51,852 INFO L226 Difference]: Without dead ends: 96 [2019-10-14 21:49:51,853 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=138, Invalid=673, Unknown=1, NotChecked=0, Total=812 [2019-10-14 21:49:51,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-14 21:49:51,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 85. [2019-10-14 21:49:51,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-14 21:49:51,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 100 transitions. [2019-10-14 21:49:51,867 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 100 transitions. Word has length 34 [2019-10-14 21:49:51,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:49:51,868 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 100 transitions. [2019-10-14 21:49:51,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-14 21:49:51,868 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 100 transitions. [2019-10-14 21:49:51,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-14 21:49:51,870 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:49:51,871 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:49:52,082 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:49:52,083 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:49:52,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:49:52,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1838531319, now seen corresponding path program 1 times [2019-10-14 21:49:52,083 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:49:52,083 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718591459] [2019-10-14 21:49:52,083 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:52,083 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:52,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:49:52,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:52,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:52,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:52,162 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-14 21:49:52,162 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718591459] [2019-10-14 21:49:52,163 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 21:49:52,163 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 21:49:52,163 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771716870] [2019-10-14 21:49:52,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 21:49:52,164 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 21:49:52,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 21:49:52,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-14 21:49:52,164 INFO L87 Difference]: Start difference. First operand 85 states and 100 transitions. Second operand 6 states. [2019-10-14 21:49:52,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 21:49:52,267 INFO L93 Difference]: Finished difference Result 148 states and 175 transitions. [2019-10-14 21:49:52,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 21:49:52,269 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-10-14 21:49:52,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 21:49:52,270 INFO L225 Difference]: With dead ends: 148 [2019-10-14 21:49:52,270 INFO L226 Difference]: Without dead ends: 76 [2019-10-14 21:49:52,272 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-14 21:49:52,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-14 21:49:52,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2019-10-14 21:49:52,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-14 21:49:52,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2019-10-14 21:49:52,295 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 34 [2019-10-14 21:49:52,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 21:49:52,296 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2019-10-14 21:49:52,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 21:49:52,297 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2019-10-14 21:49:52,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-14 21:49:52,298 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 21:49:52,298 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 21:49:52,298 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 21:49:52,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 21:49:52,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1094979737, now seen corresponding path program 2 times [2019-10-14 21:49:52,299 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 21:49:52,299 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767571626] [2019-10-14 21:49:52,299 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:52,299 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 21:49:52,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 21:49:52,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:52,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 21:49:52,937 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 21:49:52,937 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767571626] [2019-10-14 21:49:52,937 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64900371] [2019-10-14 21:49:52,938 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 21:49:52,977 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 21:49:52,977 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 21:49:52,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-14 21:49:52,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 21:49:53,025 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 18 treesize of output 14 [2019-10-14 21:49:53,026 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:49:53,040 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:49:53,041 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 21:49:53,041 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-10-14 21:49:53,128 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:49:53,129 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2019-10-14 21:49:53,130 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:49:53,141 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:49:53,142 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 21:49:53,142 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2019-10-14 21:49:53,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:49:53,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:49:53,302 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:49:53,303 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 85 [2019-10-14 21:49:53,304 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:49:53,349 INFO L567 ElimStorePlain]: treesize reduction 29, result has 69.1 percent of original size [2019-10-14 21:49:53,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:53,352 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 21:49:53,353 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:65 [2019-10-14 21:49:53,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:53,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:55,525 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 21:49:55,554 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 21:49:55,554 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 3 case distinctions, treesize of input 40 treesize of output 123 [2019-10-14 21:49:55,556 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 21:49:55,614 INFO L567 ElimStorePlain]: treesize reduction 59, result has 56.6 percent of original size [2019-10-14 21:49:55,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:55,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:55,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:55,622 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-14 21:49:55,623 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:59, output treesize:77 [2019-10-14 21:49:55,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:55,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:49:55,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:00,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:00,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:00,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 21:50:10,068 WARN L191 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 39 [2019-10-14 21:50:26,363 WARN L191 SmtUtils]: Spent 6.06 s on a formula simplification that was a NOOP. DAG size: 56