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/loops/vogal-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 19:22:25,164 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 19:22:25,166 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 19:22:25,177 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 19:22:25,178 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 19:22:25,179 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 19:22:25,180 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 19:22:25,182 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 19:22:25,184 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 19:22:25,184 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 19:22:25,185 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 19:22:25,186 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 19:22:25,187 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 19:22:25,188 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 19:22:25,188 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 19:22:25,190 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 19:22:25,190 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 19:22:25,191 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 19:22:25,193 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 19:22:25,195 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 19:22:25,196 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 19:22:25,197 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 19:22:25,198 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 19:22:25,199 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 19:22:25,201 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 19:22:25,202 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 19:22:25,202 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 19:22:25,203 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 19:22:25,203 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 19:22:25,204 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 19:22:25,204 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 19:22:25,205 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 19:22:25,206 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 19:22:25,206 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 19:22:25,207 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 19:22:25,208 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 19:22:25,208 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 19:22:25,209 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 19:22:25,209 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 19:22:25,210 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 19:22:25,210 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 19:22:25,211 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-09-03 19:22:25,229 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 19:22:25,229 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 19:22:25,230 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 19:22:25,231 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 19:22:25,231 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 19:22:25,234 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 19:22:25,234 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 19:22:25,234 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 19:22:25,234 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 19:22:25,234 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 19:22:25,235 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 19:22:25,235 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 19:22:25,235 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 19:22:25,235 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 19:22:25,235 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 19:22:25,236 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 19:22:25,236 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 19:22:25,236 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 19:22:25,238 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 19:22:25,238 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 19:22:25,238 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 19:22:25,238 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:22:25,239 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 19:22:25,239 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 19:22:25,239 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 19:22:25,240 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 19:22:25,240 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 19:22:25,240 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 19:22:25,240 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 19:22:25,274 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 19:22:25,285 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 19:22:25,290 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 19:22:25,292 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 19:22:25,292 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 19:22:25,293 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/vogal-1.i [2019-09-03 19:22:25,367 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5ba90cb5/8ea36ee3869646c7b11220941c032c84/FLAG885c09e43 [2019-09-03 19:22:25,794 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 19:22:25,794 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/vogal-1.i [2019-09-03 19:22:25,801 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5ba90cb5/8ea36ee3869646c7b11220941c032c84/FLAG885c09e43 [2019-09-03 19:22:26,222 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5ba90cb5/8ea36ee3869646c7b11220941c032c84 [2019-09-03 19:22:26,231 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 19:22:26,232 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 19:22:26,234 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 19:22:26,234 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 19:22:26,237 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 19:22:26,238 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:22:26" (1/1) ... [2019-09-03 19:22:26,241 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@630c9713 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:22:26, skipping insertion in model container [2019-09-03 19:22:26,241 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:22:26" (1/1) ... [2019-09-03 19:22:26,248 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 19:22:26,267 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 19:22:26,460 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:22:26,464 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 19:22:26,495 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:22:26,607 INFO L192 MainTranslator]: Completed translation [2019-09-03 19:22:26,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:22:26 WrapperNode [2019-09-03 19:22:26,608 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 19:22:26,609 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 19:22:26,609 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 19:22:26,609 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 19:22:26,621 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:22:26" (1/1) ... [2019-09-03 19:22:26,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:22:26" (1/1) ... [2019-09-03 19:22:26,629 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:22:26" (1/1) ... [2019-09-03 19:22:26,630 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:22:26" (1/1) ... [2019-09-03 19:22:26,639 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:22:26" (1/1) ... [2019-09-03 19:22:26,646 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:22:26" (1/1) ... [2019-09-03 19:22:26,648 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:22:26" (1/1) ... [2019-09-03 19:22:26,651 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 19:22:26,651 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 19:22:26,651 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 19:22:26,651 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 19:22:26,652 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:22:26" (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-09-03 19:22:26,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 19:22:26,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 19:22:26,703 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 19:22:26,703 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 19:22:26,703 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 19:22:26,703 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 19:22:26,703 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 19:22:26,703 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-03 19:22:26,704 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 19:22:26,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-03 19:22:26,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-03 19:22:26,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-03 19:22:26,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-03 19:22:26,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-03 19:22:26,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 19:22:26,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 19:22:27,058 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 19:22:27,058 INFO L283 CfgBuilder]: Removed 6 assume(true) statements. [2019-09-03 19:22:27,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:22:27 BoogieIcfgContainer [2019-09-03 19:22:27,059 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 19:22:27,060 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 19:22:27,060 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 19:22:27,063 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 19:22:27,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 07:22:26" (1/3) ... [2019-09-03 19:22:27,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b244a15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:22:27, skipping insertion in model container [2019-09-03 19:22:27,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:22:26" (2/3) ... [2019-09-03 19:22:27,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b244a15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:22:27, skipping insertion in model container [2019-09-03 19:22:27,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:22:27" (3/3) ... [2019-09-03 19:22:27,066 INFO L109 eAbstractionObserver]: Analyzing ICFG vogal-1.i [2019-09-03 19:22:27,073 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 19:22:27,079 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 19:22:27,095 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 19:22:27,121 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 19:22:27,122 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 19:22:27,122 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 19:22:27,122 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 19:22:27,122 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 19:22:27,122 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 19:22:27,123 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 19:22:27,123 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 19:22:27,123 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 19:22:27,138 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2019-09-03 19:22:27,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 19:22:27,144 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:22:27,145 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:22:27,147 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:22:27,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:22:27,152 INFO L82 PathProgramCache]: Analyzing trace with hash 2138170830, now seen corresponding path program 1 times [2019-09-03 19:22:27,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:22:27,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:22:27,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:27,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:22:27,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:27,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:22:27,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:22:27,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:22:27,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 19:22:27,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 19:22:27,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 19:22:27,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 19:22:27,303 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 2 states. [2019-09-03 19:22:27,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:22:27,324 INFO L93 Difference]: Finished difference Result 66 states and 95 transitions. [2019-09-03 19:22:27,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 19:22:27,326 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-09-03 19:22:27,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:22:27,335 INFO L225 Difference]: With dead ends: 66 [2019-09-03 19:22:27,335 INFO L226 Difference]: Without dead ends: 30 [2019-09-03 19:22:27,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 19:22:27,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-03 19:22:27,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-09-03 19:22:27,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-03 19:22:27,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-09-03 19:22:27,388 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 18 [2019-09-03 19:22:27,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:22:27,389 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-09-03 19:22:27,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 19:22:27,389 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2019-09-03 19:22:27,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 19:22:27,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:22:27,390 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:22:27,391 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:22:27,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:22:27,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1430244045, now seen corresponding path program 1 times [2019-09-03 19:22:27,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:22:27,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:22:27,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:27,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:22:27,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:27,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:22:27,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:22:27,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:22:27,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 19:22:27,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 19:22:27,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 19:22:27,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 19:22:27,516 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 3 states. [2019-09-03 19:22:27,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:22:27,613 INFO L93 Difference]: Finished difference Result 67 states and 87 transitions. [2019-09-03 19:22:27,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 19:22:27,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-03 19:22:27,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:22:27,617 INFO L225 Difference]: With dead ends: 67 [2019-09-03 19:22:27,617 INFO L226 Difference]: Without dead ends: 45 [2019-09-03 19:22:27,618 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-03 19:22:27,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-03 19:22:27,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2019-09-03 19:22:27,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-03 19:22:27,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2019-09-03 19:22:27,627 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 20 [2019-09-03 19:22:27,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:22:27,627 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-09-03 19:22:27,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 19:22:27,627 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2019-09-03 19:22:27,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-03 19:22:27,628 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:22:27,629 INFO L399 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-09-03 19:22:27,629 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:22:27,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:22:27,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1498528533, now seen corresponding path program 1 times [2019-09-03 19:22:27,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:22:27,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:22:27,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:27,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:22:27,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:22:27,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:22:27,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:22:27,740 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:22:27,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:22:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:22:27,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 19:22:27,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:22:27,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 19:22:27,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:22:27,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2019-09-03 19:22:27,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 19:22:27,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 19:22:27,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:22:27,857 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand 8 states. [2019-09-03 19:22:28,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:22:28,171 INFO L93 Difference]: Finished difference Result 139 states and 190 transitions. [2019-09-03 19:22:28,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 19:22:28,171 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-09-03 19:22:28,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:22:28,173 INFO L225 Difference]: With dead ends: 139 [2019-09-03 19:22:28,174 INFO L226 Difference]: Without dead ends: 112 [2019-09-03 19:22:28,175 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-09-03 19:22:28,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-09-03 19:22:28,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 45. [2019-09-03 19:22:28,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-03 19:22:28,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2019-09-03 19:22:28,189 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 22 [2019-09-03 19:22:28,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:22:28,189 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2019-09-03 19:22:28,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 19:22:28,189 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2019-09-03 19:22:28,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-03 19:22:28,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:22:28,191 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:22:28,192 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:22:28,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:22:28,192 INFO L82 PathProgramCache]: Analyzing trace with hash -688638064, now seen corresponding path program 1 times [2019-09-03 19:22:28,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:22:28,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:22:28,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:28,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:22:28,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:28,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:22:28,346 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 19:22:28,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:22:28,348 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:22:28,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:22:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:22:28,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-03 19:22:28,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:22:28,424 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-03 19:22:28,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:22:28,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-09-03 19:22:28,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 19:22:28,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 19:22:28,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:22:28,431 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand 7 states. [2019-09-03 19:22:28,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:22:28,645 INFO L93 Difference]: Finished difference Result 209 states and 286 transitions. [2019-09-03 19:22:28,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 19:22:28,646 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-09-03 19:22:28,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:22:28,649 INFO L225 Difference]: With dead ends: 209 [2019-09-03 19:22:28,649 INFO L226 Difference]: Without dead ends: 175 [2019-09-03 19:22:28,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:22:28,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-09-03 19:22:28,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 51. [2019-09-03 19:22:28,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-03 19:22:28,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2019-09-03 19:22:28,672 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 30 [2019-09-03 19:22:28,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:22:28,672 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2019-09-03 19:22:28,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 19:22:28,672 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2019-09-03 19:22:28,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-03 19:22:28,676 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:22:28,676 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:22:28,676 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:22:28,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:22:28,676 INFO L82 PathProgramCache]: Analyzing trace with hash -610668811, now seen corresponding path program 1 times [2019-09-03 19:22:28,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:22:28,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:22:28,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:28,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:22:28,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:28,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:22:28,840 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-03 19:22:28,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:22:28,842 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:22:28,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:22:28,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:22:28,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 19:22:28,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:22:29,048 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-03 19:22:29,049 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:29,054 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:29,055 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:22:29,056 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-03 19:22:29,070 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-03 19:22:29,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:22:29,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 13 [2019-09-03 19:22:29,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 19:22:29,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 19:22:29,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-09-03 19:22:29,076 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand 13 states. [2019-09-03 19:22:29,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:22:29,483 INFO L93 Difference]: Finished difference Result 193 states and 262 transitions. [2019-09-03 19:22:29,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 19:22:29,484 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2019-09-03 19:22:29,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:22:29,485 INFO L225 Difference]: With dead ends: 193 [2019-09-03 19:22:29,485 INFO L226 Difference]: Without dead ends: 150 [2019-09-03 19:22:29,486 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:22:29,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-09-03 19:22:29,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 51. [2019-09-03 19:22:29,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-03 19:22:29,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2019-09-03 19:22:29,496 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 33 [2019-09-03 19:22:29,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:22:29,497 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2019-09-03 19:22:29,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 19:22:29,497 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2019-09-03 19:22:29,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-03 19:22:29,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:22:29,499 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-09-03 19:22:29,499 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:22:29,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:22:29,499 INFO L82 PathProgramCache]: Analyzing trace with hash 511595119, now seen corresponding path program 1 times [2019-09-03 19:22:29,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:22:29,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:22:29,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:29,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:22:29,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:29,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:22:29,664 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 19:22:29,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:22:29,664 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:22:29,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:22:29,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:22:29,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 19:22:29,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:22:29,815 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-09-03 19:22:29,815 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:29,817 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:29,817 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:22:29,817 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-09-03 19:22:29,842 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:22:29,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:22:29,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2019-09-03 19:22:29,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 19:22:29,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 19:22:29,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:22:29,849 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand 14 states. [2019-09-03 19:22:30,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:22:30,318 INFO L93 Difference]: Finished difference Result 212 states and 290 transitions. [2019-09-03 19:22:30,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 19:22:30,318 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2019-09-03 19:22:30,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:22:30,319 INFO L225 Difference]: With dead ends: 212 [2019-09-03 19:22:30,320 INFO L226 Difference]: Without dead ends: 176 [2019-09-03 19:22:30,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2019-09-03 19:22:30,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-09-03 19:22:30,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 55. [2019-09-03 19:22:30,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-03 19:22:30,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2019-09-03 19:22:30,338 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 36 [2019-09-03 19:22:30,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:22:30,338 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2019-09-03 19:22:30,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 19:22:30,339 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2019-09-03 19:22:30,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-03 19:22:30,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:22:30,344 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:22:30,345 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:22:30,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:22:30,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1416064650, now seen corresponding path program 1 times [2019-09-03 19:22:30,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:22:30,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:22:30,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:30,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:22:30,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:30,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:22:30,458 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-03 19:22:30,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:22:30,459 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:22:30,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:22:30,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:22:30,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-03 19:22:30,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:22:30,544 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-03 19:22:30,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:22:30,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 8 [2019-09-03 19:22:30,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 19:22:30,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 19:22:30,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:22:30,550 INFO L87 Difference]: Start difference. First operand 55 states and 67 transitions. Second operand 8 states. [2019-09-03 19:22:30,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:22:30,809 INFO L93 Difference]: Finished difference Result 247 states and 359 transitions. [2019-09-03 19:22:30,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 19:22:30,810 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2019-09-03 19:22:30,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:22:30,812 INFO L225 Difference]: With dead ends: 247 [2019-09-03 19:22:30,812 INFO L226 Difference]: Without dead ends: 216 [2019-09-03 19:22:30,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:22:30,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-09-03 19:22:30,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 75. [2019-09-03 19:22:30,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-03 19:22:30,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2019-09-03 19:22:30,826 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 39 [2019-09-03 19:22:30,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:22:30,826 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2019-09-03 19:22:30,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 19:22:30,826 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2019-09-03 19:22:30,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-03 19:22:30,828 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:22:30,828 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:22:30,828 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:22:30,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:22:30,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1087818309, now seen corresponding path program 2 times [2019-09-03 19:22:30,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:22:30,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:22:30,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:30,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:22:30,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:30,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:22:30,966 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-03 19:22:30,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:22:30,967 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:22:30,986 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:22:31,025 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:22:31,026 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:22:31,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-03 19:22:31,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:22:31,089 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-03 19:22:31,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:22:31,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 10 [2019-09-03 19:22:31,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 19:22:31,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 19:22:31,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:22:31,095 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. Second operand 10 states. [2019-09-03 19:22:31,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:22:31,407 INFO L93 Difference]: Finished difference Result 513 states and 684 transitions. [2019-09-03 19:22:31,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 19:22:31,407 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2019-09-03 19:22:31,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:22:31,410 INFO L225 Difference]: With dead ends: 513 [2019-09-03 19:22:31,410 INFO L226 Difference]: Without dead ends: 466 [2019-09-03 19:22:31,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:22:31,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-09-03 19:22:31,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 113. [2019-09-03 19:22:31,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-09-03 19:22:31,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 142 transitions. [2019-09-03 19:22:31,432 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 142 transitions. Word has length 44 [2019-09-03 19:22:31,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:22:31,433 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 142 transitions. [2019-09-03 19:22:31,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 19:22:31,433 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 142 transitions. [2019-09-03 19:22:31,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-03 19:22:31,434 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:22:31,434 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:22:31,434 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:22:31,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:22:31,435 INFO L82 PathProgramCache]: Analyzing trace with hash -452935237, now seen corresponding path program 3 times [2019-09-03 19:22:31,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:22:31,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:22:31,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:31,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:22:31,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:31,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:22:31,593 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-03 19:22:31,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:22:31,594 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:22:31,615 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:22:31,647 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-03 19:22:31,647 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:22:31,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-03 19:22:31,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:22:31,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:31,931 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:22:31,933 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:31,933 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2019-09-03 19:22:31,934 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:31,942 INFO L567 ElimStorePlain]: treesize reduction 5, result has 64.3 percent of original size [2019-09-03 19:22:31,944 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:22:31,945 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:3 [2019-09-03 19:22:31,964 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-03 19:22:31,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:22:31,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2019-09-03 19:22:31,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 19:22:31,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 19:22:31,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-09-03 19:22:31,970 INFO L87 Difference]: Start difference. First operand 113 states and 142 transitions. Second operand 16 states. [2019-09-03 19:22:33,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:22:33,187 INFO L93 Difference]: Finished difference Result 437 states and 572 transitions. [2019-09-03 19:22:33,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 19:22:33,188 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 48 [2019-09-03 19:22:33,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:22:33,191 INFO L225 Difference]: With dead ends: 437 [2019-09-03 19:22:33,191 INFO L226 Difference]: Without dead ends: 408 [2019-09-03 19:22:33,192 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=169, Invalid=1091, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 19:22:33,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-09-03 19:22:33,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 113. [2019-09-03 19:22:33,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-09-03 19:22:33,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 142 transitions. [2019-09-03 19:22:33,213 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 142 transitions. Word has length 48 [2019-09-03 19:22:33,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:22:33,213 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 142 transitions. [2019-09-03 19:22:33,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 19:22:33,214 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 142 transitions. [2019-09-03 19:22:33,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-03 19:22:33,215 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:22:33,215 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:22:33,215 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:22:33,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:22:33,216 INFO L82 PathProgramCache]: Analyzing trace with hash -57035726, now seen corresponding path program 1 times [2019-09-03 19:22:33,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:22:33,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:22:33,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:33,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:22:33,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:22:33,449 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-03 19:22:33,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:22:33,452 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:22:33,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:22:33,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:22:33,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 19:22:33,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:22:33,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:33,660 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-03 19:22:33,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:22:33,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 16 [2019-09-03 19:22:33,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 19:22:33,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 19:22:33,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-03 19:22:33,666 INFO L87 Difference]: Start difference. First operand 113 states and 142 transitions. Second operand 16 states. [2019-09-03 19:22:35,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:22:35,296 INFO L93 Difference]: Finished difference Result 485 states and 649 transitions. [2019-09-03 19:22:35,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 19:22:35,297 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 51 [2019-09-03 19:22:35,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:22:35,299 INFO L225 Difference]: With dead ends: 485 [2019-09-03 19:22:35,299 INFO L226 Difference]: Without dead ends: 477 [2019-09-03 19:22:35,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=160, Invalid=1246, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 19:22:35,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-09-03 19:22:35,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 177. [2019-09-03 19:22:35,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-09-03 19:22:35,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 230 transitions. [2019-09-03 19:22:35,332 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 230 transitions. Word has length 51 [2019-09-03 19:22:35,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:22:35,332 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 230 transitions. [2019-09-03 19:22:35,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 19:22:35,333 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 230 transitions. [2019-09-03 19:22:35,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-03 19:22:35,336 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:22:35,336 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:22:35,336 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:22:35,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:22:35,337 INFO L82 PathProgramCache]: Analyzing trace with hash -450062736, now seen corresponding path program 1 times [2019-09-03 19:22:35,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:22:35,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:22:35,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:35,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:22:35,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:22:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:22:35,835 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 29 [2019-09-03 19:22:36,257 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 49 [2019-09-03 19:22:36,593 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 45 [2019-09-03 19:22:36,900 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 42 [2019-09-03 19:22:37,055 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 31 [2019-09-03 19:22:37,791 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 62 [2019-09-03 19:22:37,900 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-03 19:22:37,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:22:37,901 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:22:37,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:22:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:22:37,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-03 19:22:37,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:22:38,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:38,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:38,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:38,549 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-09-03 19:22:41,063 WARN L188 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-09-03 19:22:41,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:41,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:41,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:41,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:41,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:41,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:41,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:41,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:41,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:22:41,380 INFO L392 ElimStorePlain]: Different costs {10=[v_prenex_9], 18=[|#memory_int|]} [2019-09-03 19:22:41,425 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:41,426 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 106 [2019-09-03 19:22:41,427 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:41,507 INFO L567 ElimStorePlain]: treesize reduction 88, result has 51.4 percent of original size [2019-09-03 19:22:41,556 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:22:41,557 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 112 [2019-09-03 19:22:41,559 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:22:41,595 INFO L567 ElimStorePlain]: treesize reduction 52, result has 35.8 percent of original size [2019-09-03 19:22:41,600 INFO L496 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:22:41,600 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 12 variables, input treesize:241, output treesize:3 [2019-09-03 19:22:41,642 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-03 19:22:41,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:22:41,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 30 [2019-09-03 19:22:41,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-03 19:22:41,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-03 19:22:41,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=743, Unknown=0, NotChecked=0, Total=870 [2019-09-03 19:22:41,656 INFO L87 Difference]: Start difference. First operand 177 states and 230 transitions. Second operand 30 states. [2019-09-03 19:22:49,156 WARN L188 SmtUtils]: Spent 6.07 s on a formula simplification. DAG size of input: 55 DAG size of output: 40 [2019-09-03 19:22:49,359 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 52 [2019-09-03 19:22:49,593 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2019-09-03 19:22:49,753 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 40 [2019-09-03 19:22:50,120 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 54 [2019-09-03 19:22:50,406 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 48 [2019-09-03 19:22:50,798 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 50 [2019-09-03 19:22:57,050 WARN L188 SmtUtils]: Spent 6.13 s on a formula simplification. DAG size of input: 103 DAG size of output: 60 [2019-09-03 19:23:03,956 WARN L188 SmtUtils]: Spent 6.09 s on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2019-09-03 19:23:04,359 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-09-03 19:23:04,658 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 45 [2019-09-03 19:23:11,159 WARN L188 SmtUtils]: Spent 6.12 s on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-03 19:23:28,371 WARN L188 SmtUtils]: Spent 17.18 s on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-03 19:23:28,859 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 46 [2019-09-03 19:23:31,143 WARN L188 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-09-03 19:23:50,642 WARN L188 SmtUtils]: Spent 17.23 s on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-09-03 19:23:51,018 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 53 [2019-09-03 19:23:51,426 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-09-03 19:23:52,431 WARN L188 SmtUtils]: Spent 960.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-09-03 19:23:53,278 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-09-03 19:23:54,089 WARN L188 SmtUtils]: Spent 741.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-03 19:24:18,958 WARN L188 SmtUtils]: Spent 24.56 s on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2019-09-03 19:24:19,118 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-09-03 19:24:19,321 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 51 [2019-09-03 19:24:19,635 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-09-03 19:24:19,843 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 68 [2019-09-03 19:24:20,244 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 55 [2019-09-03 19:24:20,418 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-03 19:24:22,084 WARN L188 SmtUtils]: Spent 989.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-09-03 19:24:22,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:24:22,250 INFO L93 Difference]: Finished difference Result 940 states and 1261 transitions. [2019-09-03 19:24:22,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-09-03 19:24:22,251 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 51 [2019-09-03 19:24:22,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:24:22,259 INFO L225 Difference]: With dead ends: 940 [2019-09-03 19:24:22,259 INFO L226 Difference]: Without dead ends: 843 [2019-09-03 19:24:22,266 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4507 ImplicationChecksByTransitivity, 104.3s TimeCoverageRelationStatistics Valid=1625, Invalid=11484, Unknown=1, NotChecked=0, Total=13110 [2019-09-03 19:24:22,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2019-09-03 19:24:22,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 498. [2019-09-03 19:24:22,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2019-09-03 19:24:22,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 644 transitions. [2019-09-03 19:24:22,358 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 644 transitions. Word has length 51 [2019-09-03 19:24:22,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:24:22,359 INFO L475 AbstractCegarLoop]: Abstraction has 498 states and 644 transitions. [2019-09-03 19:24:22,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-03 19:24:22,359 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 644 transitions. [2019-09-03 19:24:22,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-03 19:24:22,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:24:22,360 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:24:22,361 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:24:22,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:24:22,361 INFO L82 PathProgramCache]: Analyzing trace with hash 161818992, now seen corresponding path program 1 times [2019-09-03 19:24:22,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:24:22,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:24:22,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:22,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:24:22,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:24:22,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:22,890 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 41 [2019-09-03 19:24:23,014 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 28 [2019-09-03 19:24:23,313 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 40 [2019-09-03 19:24:23,460 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 31 [2019-09-03 19:24:23,666 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 35 [2019-09-03 19:24:23,907 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 46 [2019-09-03 19:24:24,249 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 33 [2019-09-03 19:24:24,432 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 33 [2019-09-03 19:24:24,717 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 39 [2019-09-03 19:24:24,953 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 37 [2019-09-03 19:24:25,160 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 30 [2019-09-03 19:24:25,565 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 53 [2019-09-03 19:24:25,704 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 29 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-03 19:24:25,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:24:25,705 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:24:25,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:24:25,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:24:25,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-03 19:24:25,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:24:26,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:26,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:26,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:26,176 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-09-03 19:24:26,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:28,263 WARN L188 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 39 [2019-09-03 19:24:29,431 WARN L188 SmtUtils]: Spent 1.10 s on a formula simplification that was a NOOP. DAG size: 41 [2019-09-03 19:24:30,114 WARN L188 SmtUtils]: Spent 588.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-09-03 19:24:34,379 WARN L188 SmtUtils]: Spent 4.17 s on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-03 19:24:34,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:34,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:34,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:34,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:34,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:34,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:34,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:34,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:34,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:24:34,527 INFO L392 ElimStorePlain]: Different costs {10=[v_prenex_19], 18=[|#memory_int|]} [2019-09-03 19:24:34,579 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:24:34,579 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 107 [2019-09-03 19:24:34,581 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:24:34,688 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-03 19:24:34,688 INFO L567 ElimStorePlain]: treesize reduction 97, result has 55.1 percent of original size [2019-09-03 19:24:34,739 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:24:34,740 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 113 [2019-09-03 19:24:34,741 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:24:34,833 INFO L567 ElimStorePlain]: treesize reduction 8, result has 91.0 percent of original size [2019-09-03 19:24:34,837 INFO L496 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:24:34,837 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 12 variables, input treesize:244, output treesize:4 [2019-09-03 19:24:34,877 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-03 19:24:34,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:24:34,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 32 [2019-09-03 19:24:34,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-03 19:24:34,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-03 19:24:34,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=854, Unknown=0, NotChecked=0, Total=992 [2019-09-03 19:24:34,887 INFO L87 Difference]: Start difference. First operand 498 states and 644 transitions. Second operand 32 states. [2019-09-03 19:24:42,032 WARN L188 SmtUtils]: Spent 6.11 s on a formula simplification. DAG size of input: 115 DAG size of output: 52 [2019-09-03 19:24:42,470 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2019-09-03 19:24:45,328 WARN L188 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-03 19:24:45,813 WARN L188 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-03 19:24:48,501 WARN L188 SmtUtils]: Spent 2.49 s on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-03 19:24:48,929 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-03 19:24:49,458 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 55 [2019-09-03 19:24:52,097 WARN L188 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2019-09-03 19:24:52,882 WARN L188 SmtUtils]: Spent 643.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-09-03 19:24:53,645 WARN L188 SmtUtils]: Spent 727.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-09-03 19:25:18,531 WARN L188 SmtUtils]: Spent 24.83 s on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-09-03 19:25:24,678 WARN L188 SmtUtils]: Spent 6.10 s on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2019-09-03 19:25:24,878 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-09-03 19:25:25,023 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-03 19:25:26,246 WARN L188 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-03 19:25:26,710 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-03 19:25:27,474 WARN L188 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-09-03 19:25:53,823 WARN L188 SmtUtils]: Spent 24.20 s on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2019-09-03 19:26:20,298 WARN L188 SmtUtils]: Spent 24.47 s on a formula simplification. DAG size of input: 71 DAG size of output: 71 [2019-09-03 19:26:20,933 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-09-03 19:26:21,135 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 73 [2019-09-03 19:26:21,334 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-09-03 19:26:22,933 WARN L188 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-03 19:26:25,876 WARN L188 SmtUtils]: Spent 2.81 s on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-03 19:26:26,357 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-09-03 19:26:27,234 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-09-03 19:26:30,722 WARN L188 SmtUtils]: Spent 3.04 s on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-03 19:26:30,949 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-03 19:26:55,812 WARN L188 SmtUtils]: Spent 18.73 s on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-09-03 19:27:01,970 WARN L188 SmtUtils]: Spent 6.10 s on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-09-03 19:27:02,227 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 58 [2019-09-03 19:27:08,440 WARN L188 SmtUtils]: Spent 6.10 s on a formula simplification. DAG size of input: 85 DAG size of output: 55 [2019-09-03 19:27:10,461 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 72 [2019-09-03 19:27:12,059 WARN L188 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 89 DAG size of output: 75 [2019-09-03 19:27:19,085 WARN L188 SmtUtils]: Spent 6.09 s on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-09-03 19:27:25,425 WARN L188 SmtUtils]: Spent 6.10 s on a formula simplification. DAG size of input: 88 DAG size of output: 58 [2019-09-03 19:27:28,949 WARN L188 SmtUtils]: Spent 3.43 s on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-03 19:27:34,795 WARN L188 SmtUtils]: Spent 5.76 s on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-09-03 19:27:37,611 WARN L188 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-03 19:27:37,876 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-03 19:27:39,126 WARN L188 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-09-03 19:27:39,542 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-09-03 19:27:39,871 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2019-09-03 19:27:59,694 WARN L188 SmtUtils]: Spent 18.58 s on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2019-09-03 19:28:31,494 WARN L188 SmtUtils]: Spent 21.70 s on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2019-09-03 19:28:31,748 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-09-03 19:28:57,596 WARN L188 SmtUtils]: Spent 18.39 s on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-03 19:28:57,769 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-03 19:29:01,580 WARN L188 SmtUtils]: Spent 3.71 s on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-09-03 19:29:01,731 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-03 19:29:01,961 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2019-09-03 19:29:02,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:29:02,079 INFO L93 Difference]: Finished difference Result 2944 states and 3896 transitions. [2019-09-03 19:29:02,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2019-09-03 19:29:02,079 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 51 [2019-09-03 19:29:02,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:29:02,091 INFO L225 Difference]: With dead ends: 2944 [2019-09-03 19:29:02,091 INFO L226 Difference]: Without dead ends: 2728 [2019-09-03 19:29:02,097 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 40 SyntacticMatches, 6 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7527 ImplicationChecksByTransitivity, 273.8s TimeCoverageRelationStatistics Valid=2051, Invalid=19107, Unknown=12, NotChecked=0, Total=21170 [2019-09-03 19:29:02,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2728 states. [2019-09-03 19:29:02,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2728 to 913. [2019-09-03 19:29:02,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 913 states. [2019-09-03 19:29:02,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1166 transitions. [2019-09-03 19:29:02,252 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1166 transitions. Word has length 51 [2019-09-03 19:29:02,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:29:02,253 INFO L475 AbstractCegarLoop]: Abstraction has 913 states and 1166 transitions. [2019-09-03 19:29:02,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-03 19:29:02,253 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1166 transitions. [2019-09-03 19:29:02,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-03 19:29:02,255 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:29:02,255 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:29:02,255 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:29:02,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:29:02,256 INFO L82 PathProgramCache]: Analyzing trace with hash -818014032, now seen corresponding path program 1 times [2019-09-03 19:29:02,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:29:02,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:29:02,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:29:02,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:29:02,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:29:02,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:29:02,632 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 29 [2019-09-03 19:29:02,773 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 23 [2019-09-03 19:29:03,018 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 43 [2019-09-03 19:29:03,281 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 39 [2019-09-03 19:29:03,892 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 50 [2019-09-03 19:29:04,031 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 26 [2019-09-03 19:29:04,071 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-03 19:29:04,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:29:04,071 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:29:04,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:29:04,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:29:04,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 19:29:04,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:29:04,315 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:29:04,329 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-09-03 19:29:04,330 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 21 [2019-09-03 19:29:04,330 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:29:04,335 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:29:04,337 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:29:04,337 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:3 [2019-09-03 19:29:04,357 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-03 19:29:04,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:29:04,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 20 [2019-09-03 19:29:04,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 19:29:04,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 19:29:04,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:29:04,367 INFO L87 Difference]: Start difference. First operand 913 states and 1166 transitions. Second operand 20 states. [2019-09-03 19:29:05,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:29:05,322 INFO L93 Difference]: Finished difference Result 1485 states and 1910 transitions. [2019-09-03 19:29:05,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 19:29:05,323 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 51 [2019-09-03 19:29:05,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:29:05,328 INFO L225 Difference]: With dead ends: 1485 [2019-09-03 19:29:05,328 INFO L226 Difference]: Without dead ends: 1314 [2019-09-03 19:29:05,329 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 43 SyntacticMatches, 9 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2019-09-03 19:29:05,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2019-09-03 19:29:05,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 904. [2019-09-03 19:29:05,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2019-09-03 19:29:05,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1152 transitions. [2019-09-03 19:29:05,479 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1152 transitions. Word has length 51 [2019-09-03 19:29:05,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:29:05,479 INFO L475 AbstractCegarLoop]: Abstraction has 904 states and 1152 transitions. [2019-09-03 19:29:05,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 19:29:05,480 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1152 transitions. [2019-09-03 19:29:05,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-03 19:29:05,481 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:29:05,482 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:29:05,482 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:29:05,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:29:05,482 INFO L82 PathProgramCache]: Analyzing trace with hash -90659408, now seen corresponding path program 1 times [2019-09-03 19:29:05,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:29:05,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:29:05,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:29:05,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:29:05,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:29:05,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:29:06,035 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 40 [2019-09-03 19:29:06,210 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 37 [2019-09-03 19:29:06,368 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 32 [2019-09-03 19:29:06,908 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 53 [2019-09-03 19:29:07,070 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 28 [2019-09-03 19:29:07,085 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-03 19:29:07,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:29:07,086 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:29:07,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:29:07,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:29:07,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 19:29:07,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:29:07,284 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:29:07,298 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-09-03 19:29:07,299 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 22 [2019-09-03 19:29:07,300 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:29:07,315 INFO L567 ElimStorePlain]: treesize reduction 4, result has 78.9 percent of original size [2019-09-03 19:29:07,315 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:29:07,316 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:4 [2019-09-03 19:29:07,339 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (13)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:29:07,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:29:07,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 20 [2019-09-03 19:29:07,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 19:29:07,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 19:29:07,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:29:07,344 INFO L87 Difference]: Start difference. First operand 904 states and 1152 transitions. Second operand 20 states. [2019-09-03 19:29:08,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:29:08,447 INFO L93 Difference]: Finished difference Result 1403 states and 1801 transitions. [2019-09-03 19:29:08,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 19:29:08,447 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 51 [2019-09-03 19:29:08,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:29:08,453 INFO L225 Difference]: With dead ends: 1403 [2019-09-03 19:29:08,453 INFO L226 Difference]: Without dead ends: 1262 [2019-09-03 19:29:08,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 43 SyntacticMatches, 9 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=175, Invalid=637, Unknown=0, NotChecked=0, Total=812 [2019-09-03 19:29:08,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2019-09-03 19:29:08,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 693. [2019-09-03 19:29:08,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 693 states. [2019-09-03 19:29:08,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 870 transitions. [2019-09-03 19:29:08,575 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 870 transitions. Word has length 51 [2019-09-03 19:29:08,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:29:08,576 INFO L475 AbstractCegarLoop]: Abstraction has 693 states and 870 transitions. [2019-09-03 19:29:08,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 19:29:08,576 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 870 transitions. [2019-09-03 19:29:08,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-03 19:29:08,578 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:29:08,578 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:29:08,578 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:29:08,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:29:08,579 INFO L82 PathProgramCache]: Analyzing trace with hash -284438412, now seen corresponding path program 2 times [2019-09-03 19:29:08,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:29:08,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:29:08,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:29:08,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:29:08,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:29:08,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:29:08,956 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 29 [2019-09-03 19:29:09,342 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 48 [2019-09-03 19:29:09,637 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 45 [2019-09-03 19:29:09,931 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 42 [2019-09-03 19:29:10,078 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 31 [2019-09-03 19:29:10,777 WARN L188 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 64 [2019-09-03 19:29:10,863 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-03 19:29:10,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:29:10,863 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:29:10,874 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:29:10,913 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:29:10,913 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:29:10,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 19:29:10,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:29:11,200 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:29:11,200 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:29:11,201 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:29:11,202 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 14 [2019-09-03 19:29:11,202 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:29:11,208 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:29:11,209 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:29:11,209 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:4 [2019-09-03 19:29:11,231 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 19:29:11,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:29:11,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 26 [2019-09-03 19:29:11,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-03 19:29:11,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-03 19:29:11,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=546, Unknown=0, NotChecked=0, Total=650 [2019-09-03 19:29:11,236 INFO L87 Difference]: Start difference. First operand 693 states and 870 transitions. Second operand 26 states. [2019-09-03 19:29:12,089 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 44 [2019-09-03 19:29:13,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:29:13,962 INFO L93 Difference]: Finished difference Result 1987 states and 2590 transitions. [2019-09-03 19:29:13,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-03 19:29:13,963 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 51 [2019-09-03 19:29:13,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:29:13,968 INFO L225 Difference]: With dead ends: 1987 [2019-09-03 19:29:13,968 INFO L226 Difference]: Without dead ends: 1640 [2019-09-03 19:29:13,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 39 SyntacticMatches, 10 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=414, Invalid=1842, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 19:29:13,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2019-09-03 19:29:14,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 766. [2019-09-03 19:29:14,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 766 states. [2019-09-03 19:29:14,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 956 transitions. [2019-09-03 19:29:14,115 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 956 transitions. Word has length 51 [2019-09-03 19:29:14,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:29:14,115 INFO L475 AbstractCegarLoop]: Abstraction has 766 states and 956 transitions. [2019-09-03 19:29:14,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-03 19:29:14,115 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 956 transitions. [2019-09-03 19:29:14,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-03 19:29:14,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:29:14,117 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 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, 1, 1, 1] [2019-09-03 19:29:14,117 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:29:14,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:29:14,118 INFO L82 PathProgramCache]: Analyzing trace with hash -771687101, now seen corresponding path program 2 times [2019-09-03 19:29:14,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:29:14,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:29:14,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:29:14,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:29:14,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:29:14,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:29:14,308 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-03 19:29:14,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:29:14,309 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:29:14,329 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:29:14,367 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:29:14,367 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:29:14,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 19:29:14,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:29:14,581 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:29:14,582 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 26 treesize of output 10 [2019-09-03 19:29:14,582 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:29:14,585 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:29:14,585 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:29:14,586 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2019-09-03 19:29:14,609 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (15)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:29:14,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:29:14,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 19 [2019-09-03 19:29:14,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 19:29:14,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 19:29:14,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2019-09-03 19:29:14,618 INFO L87 Difference]: Start difference. First operand 766 states and 956 transitions. Second operand 19 states. [2019-09-03 19:29:17,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:29:17,919 INFO L93 Difference]: Finished difference Result 4445 states and 5749 transitions. [2019-09-03 19:29:17,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-03 19:29:17,919 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 57 [2019-09-03 19:29:17,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:29:17,929 INFO L225 Difference]: With dead ends: 4445 [2019-09-03 19:29:17,929 INFO L226 Difference]: Without dead ends: 3689 [2019-09-03 19:29:17,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1064 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=518, Invalid=3514, Unknown=0, NotChecked=0, Total=4032 [2019-09-03 19:29:17,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3689 states. [2019-09-03 19:29:18,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3689 to 768. [2019-09-03 19:29:18,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 768 states. [2019-09-03 19:29:18,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 952 transitions. [2019-09-03 19:29:18,124 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 952 transitions. Word has length 57 [2019-09-03 19:29:18,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:29:18,125 INFO L475 AbstractCegarLoop]: Abstraction has 768 states and 952 transitions. [2019-09-03 19:29:18,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 19:29:18,125 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 952 transitions. [2019-09-03 19:29:18,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-03 19:29:18,127 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:29:18,127 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:29:18,127 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:29:18,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:29:18,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1198111010, now seen corresponding path program 1 times [2019-09-03 19:29:18,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:29:18,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:29:18,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:29:18,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:29:18,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:29:18,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:29:18,738 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-03 19:29:18,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:29:18,738 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:29:18,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:29:18,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:29:18,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-03 19:29:18,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:29:19,231 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:29:19,232 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 25 [2019-09-03 19:29:19,232 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:29:19,255 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:29:19,256 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:29:19,256 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:8 [2019-09-03 19:29:19,298 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 20 proven. 27 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (16)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:29:19,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:29:19,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18] total 27 [2019-09-03 19:29:19,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 19:29:19,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 19:29:19,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-09-03 19:29:19,302 INFO L87 Difference]: Start difference. First operand 768 states and 952 transitions. Second operand 27 states. [2019-09-03 19:29:20,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:29:20,411 INFO L93 Difference]: Finished difference Result 1171 states and 1503 transitions. [2019-09-03 19:29:20,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 19:29:20,411 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 61 [2019-09-03 19:29:20,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:29:20,414 INFO L225 Difference]: With dead ends: 1171 [2019-09-03 19:29:20,414 INFO L226 Difference]: Without dead ends: 1015 [2019-09-03 19:29:20,415 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=321, Invalid=1239, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 19:29:20,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2019-09-03 19:29:20,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 669. [2019-09-03 19:29:20,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 669 states. [2019-09-03 19:29:20,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 836 transitions. [2019-09-03 19:29:20,574 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 836 transitions. Word has length 61 [2019-09-03 19:29:20,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:29:20,574 INFO L475 AbstractCegarLoop]: Abstraction has 669 states and 836 transitions. [2019-09-03 19:29:20,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 19:29:20,575 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 836 transitions. [2019-09-03 19:29:20,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-03 19:29:20,576 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:29:20,577 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:29:20,577 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:29:20,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:29:20,577 INFO L82 PathProgramCache]: Analyzing trace with hash -349531517, now seen corresponding path program 2 times [2019-09-03 19:29:20,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:29:20,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:29:20,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:29:20,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:29:20,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:29:20,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:29:20,963 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-09-03 19:29:20,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:29:20,964 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:29:20,974 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:29:21,022 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:29:21,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:29:21,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 19:29:21,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:29:21,121 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-09-03 19:29:21,121 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:29:21,123 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:29:21,123 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:29:21,123 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-09-03 19:29:21,131 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-09-03 19:29:21,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:29:21,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 15 [2019-09-03 19:29:21,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 19:29:21,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 19:29:21,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-09-03 19:29:21,135 INFO L87 Difference]: Start difference. First operand 669 states and 836 transitions. Second operand 15 states. [2019-09-03 19:29:21,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:29:21,500 INFO L93 Difference]: Finished difference Result 1019 states and 1320 transitions. [2019-09-03 19:29:21,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 19:29:21,500 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 62 [2019-09-03 19:29:21,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:29:21,503 INFO L225 Difference]: With dead ends: 1019 [2019-09-03 19:29:21,504 INFO L226 Difference]: Without dead ends: 1014 [2019-09-03 19:29:21,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2019-09-03 19:29:21,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2019-09-03 19:29:21,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 735. [2019-09-03 19:29:21,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 735 states. [2019-09-03 19:29:21,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 926 transitions. [2019-09-03 19:29:21,642 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 926 transitions. Word has length 62 [2019-09-03 19:29:21,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:29:21,642 INFO L475 AbstractCegarLoop]: Abstraction has 735 states and 926 transitions. [2019-09-03 19:29:21,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 19:29:21,643 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 926 transitions. [2019-09-03 19:29:21,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-03 19:29:21,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:29:21,645 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:29:21,645 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:29:21,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:29:21,645 INFO L82 PathProgramCache]: Analyzing trace with hash -266217358, now seen corresponding path program 3 times [2019-09-03 19:29:21,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:29:21,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:29:21,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:29:21,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:29:21,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:29:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:29:21,838 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-03 19:29:21,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:29:21,839 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:29:21,853 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:29:21,891 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-03 19:29:21,891 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:29:21,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-03 19:29:21,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:29:22,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:23,147 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:29:23,149 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:29:23,149 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2019-09-03 19:29:23,149 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:29:23,163 INFO L567 ElimStorePlain]: treesize reduction 5, result has 73.7 percent of original size [2019-09-03 19:29:23,165 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:29:23,165 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:3 [2019-09-03 19:29:23,190 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-09-03 19:29:23,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:29:23,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2019-09-03 19:29:23,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 19:29:23,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 19:29:23,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=325, Unknown=2, NotChecked=0, Total=380 [2019-09-03 19:29:23,195 INFO L87 Difference]: Start difference. First operand 735 states and 926 transitions. Second operand 20 states. [2019-09-03 19:29:33,690 WARN L188 SmtUtils]: Spent 388.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-09-03 19:29:40,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:29:40,556 INFO L93 Difference]: Finished difference Result 4764 states and 6135 transitions. [2019-09-03 19:29:40,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-03 19:29:40,557 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 69 [2019-09-03 19:29:40,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:29:40,569 INFO L225 Difference]: With dead ends: 4764 [2019-09-03 19:29:40,569 INFO L226 Difference]: Without dead ends: 4458 [2019-09-03 19:29:40,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=233, Invalid=1915, Unknown=14, NotChecked=0, Total=2162 [2019-09-03 19:29:40,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4458 states. [2019-09-03 19:29:40,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4458 to 697. [2019-09-03 19:29:40,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-09-03 19:29:40,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 877 transitions. [2019-09-03 19:29:40,753 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 877 transitions. Word has length 69 [2019-09-03 19:29:40,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:29:40,753 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 877 transitions. [2019-09-03 19:29:40,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 19:29:40,753 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 877 transitions. [2019-09-03 19:29:40,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-03 19:29:40,755 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:29:40,755 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:29:40,756 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:29:40,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:29:40,756 INFO L82 PathProgramCache]: Analyzing trace with hash 535303285, now seen corresponding path program 4 times [2019-09-03 19:29:40,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:29:40,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:29:40,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:29:40,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:29:40,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:29:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:29:41,338 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 42 [2019-09-03 19:29:41,558 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 38 [2019-09-03 19:29:41,707 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 33 [2019-09-03 19:29:42,269 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 55 [2019-09-03 19:29:42,439 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 32 [2019-09-03 19:29:42,473 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 20 proven. 32 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-03 19:29:42,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:29:42,473 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:29:42,484 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:29:42,530 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:29:42,530 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:29:42,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-03 19:29:42,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:29:42,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:42,785 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:29:42,787 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:29:42,787 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 13 [2019-09-03 19:29:42,787 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:29:42,792 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:29:42,792 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:29:42,792 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:3 [2019-09-03 19:29:42,817 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 20 proven. 50 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-03 19:29:42,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:29:42,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 20 [2019-09-03 19:29:42,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 19:29:42,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 19:29:42,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:29:42,821 INFO L87 Difference]: Start difference. First operand 697 states and 877 transitions. Second operand 20 states. [2019-09-03 19:29:43,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:29:43,593 INFO L93 Difference]: Finished difference Result 1433 states and 1836 transitions. [2019-09-03 19:29:43,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 19:29:43,593 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 72 [2019-09-03 19:29:43,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:29:43,597 INFO L225 Difference]: With dead ends: 1433 [2019-09-03 19:29:43,597 INFO L226 Difference]: Without dead ends: 1333 [2019-09-03 19:29:43,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 61 SyntacticMatches, 10 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2019-09-03 19:29:43,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2019-09-03 19:29:43,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 985. [2019-09-03 19:29:43,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 985 states. [2019-09-03 19:29:43,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1235 transitions. [2019-09-03 19:29:43,796 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1235 transitions. Word has length 72 [2019-09-03 19:29:43,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:29:43,797 INFO L475 AbstractCegarLoop]: Abstraction has 985 states and 1235 transitions. [2019-09-03 19:29:43,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 19:29:43,797 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1235 transitions. [2019-09-03 19:29:43,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-03 19:29:43,799 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:29:43,799 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:29:43,800 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:29:43,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:29:43,800 INFO L82 PathProgramCache]: Analyzing trace with hash -583461831, now seen corresponding path program 5 times [2019-09-03 19:29:43,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:29:43,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:29:43,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:29:43,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:29:43,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:29:43,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:29:44,482 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 49 [2019-09-03 19:29:44,760 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 46 [2019-09-03 19:29:45,032 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 42 [2019-09-03 19:29:46,045 WARN L188 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 68 [2019-09-03 19:29:46,190 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 13 proven. 48 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-03 19:29:46,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:29:46,190 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:29:46,199 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:29:55,017 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-03 19:29:55,018 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:29:55,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-03 19:29:55,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:29:55,113 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 24 treesize of output 20 [2019-09-03 19:29:55,113 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:29:55,130 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:29:55,134 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 26 treesize of output 22 [2019-09-03 19:29:55,134 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:29:55,153 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:29:55,160 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:29:55,161 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:51, output treesize:3 [2019-09-03 19:29:56,159 INFO L341 Elim1Store]: treesize reduction 10, result has 84.1 percent of original size [2019-09-03 19:29:56,159 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 69 [2019-09-03 19:29:56,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:56,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:29:56,162 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:29:56,173 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:29:56,175 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:29:56,175 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:3 [2019-09-03 19:29:56,216 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 13 proven. 77 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-03 19:29:56,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:29:56,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 29] total 47 [2019-09-03 19:29:56,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-03 19:29:56,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-03 19:29:56,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1935, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 19:29:56,239 INFO L87 Difference]: Start difference. First operand 985 states and 1235 transitions. Second operand 47 states. [2019-09-03 19:29:57,237 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 44 [2019-09-03 19:29:57,935 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 38 [2019-09-03 19:29:58,942 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 47 [2019-09-03 19:30:00,618 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 33 [2019-09-03 19:30:01,068 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 44 [2019-09-03 19:30:01,304 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 49 [2019-09-03 19:30:01,550 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 50 [2019-09-03 19:30:01,851 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 35 [2019-09-03 19:30:03,378 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 47 [2019-09-03 19:30:03,908 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 50 [2019-09-03 19:30:04,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:30:04,834 INFO L93 Difference]: Finished difference Result 4746 states and 6115 transitions. [2019-09-03 19:30:04,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-03 19:30:04,834 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 72 [2019-09-03 19:30:04,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:30:04,846 INFO L225 Difference]: With dead ends: 4746 [2019-09-03 19:30:04,846 INFO L226 Difference]: Without dead ends: 3548 [2019-09-03 19:30:04,851 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 44 SyntacticMatches, 8 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4281 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=1517, Invalid=11593, Unknown=0, NotChecked=0, Total=13110 [2019-09-03 19:30:04,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3548 states. [2019-09-03 19:30:05,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3548 to 1959. [2019-09-03 19:30:05,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1959 states. [2019-09-03 19:30:05,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1959 states to 1959 states and 2398 transitions. [2019-09-03 19:30:05,265 INFO L78 Accepts]: Start accepts. Automaton has 1959 states and 2398 transitions. Word has length 72 [2019-09-03 19:30:05,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:30:05,265 INFO L475 AbstractCegarLoop]: Abstraction has 1959 states and 2398 transitions. [2019-09-03 19:30:05,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-03 19:30:05,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1959 states and 2398 transitions. [2019-09-03 19:30:05,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-03 19:30:05,269 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:30:05,269 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:30:05,269 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:30:05,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:30:05,270 INFO L82 PathProgramCache]: Analyzing trace with hash 278103797, now seen corresponding path program 6 times [2019-09-03 19:30:05,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:30:05,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:30:05,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:30:05,271 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:30:05,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:30:05,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:30:05,731 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 38 [2019-09-03 19:30:05,904 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 35 [2019-09-03 19:30:06,501 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 59 [2019-09-03 19:30:06,677 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 35 [2019-09-03 19:30:06,702 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 20 proven. 32 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-03 19:30:06,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:30:06,702 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:30:06,713 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:30:06,799 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-09-03 19:30:06,799 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:30:06,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-03 19:30:06,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:30:07,001 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:30:07,003 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:30:07,003 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 14 [2019-09-03 19:30:07,003 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:30:07,010 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:30:07,011 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:30:07,011 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:4 [2019-09-03 19:30:07,035 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 20 proven. 50 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-03 19:30:07,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:30:07,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 21 [2019-09-03 19:30:07,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 19:30:07,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 19:30:07,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2019-09-03 19:30:07,048 INFO L87 Difference]: Start difference. First operand 1959 states and 2398 transitions. Second operand 21 states. [2019-09-03 19:30:08,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:30:08,071 INFO L93 Difference]: Finished difference Result 2325 states and 2880 transitions. [2019-09-03 19:30:08,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 19:30:08,071 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 72 [2019-09-03 19:30:08,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:30:08,079 INFO L225 Difference]: With dead ends: 2325 [2019-09-03 19:30:08,079 INFO L226 Difference]: Without dead ends: 2157 [2019-09-03 19:30:08,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 63 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2019-09-03 19:30:08,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2157 states. [2019-09-03 19:30:08,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2157 to 1953. [2019-09-03 19:30:08,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1953 states. [2019-09-03 19:30:08,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1953 states to 1953 states and 2368 transitions. [2019-09-03 19:30:08,459 INFO L78 Accepts]: Start accepts. Automaton has 1953 states and 2368 transitions. Word has length 72 [2019-09-03 19:30:08,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:30:08,459 INFO L475 AbstractCegarLoop]: Abstraction has 1953 states and 2368 transitions. [2019-09-03 19:30:08,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 19:30:08,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1953 states and 2368 transitions. [2019-09-03 19:30:08,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-03 19:30:08,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:30:08,464 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:30:08,464 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:30:08,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:30:08,464 INFO L82 PathProgramCache]: Analyzing trace with hash 84324793, now seen corresponding path program 7 times [2019-09-03 19:30:08,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:30:08,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:30:08,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:30:08,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:30:08,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:30:08,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:30:08,961 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 35 [2019-09-03 19:30:09,184 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 42 [2019-09-03 19:30:09,377 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 39 [2019-09-03 19:30:10,216 WARN L188 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 70 [2019-09-03 19:30:10,337 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 13 proven. 42 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-03 19:30:10,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:30:10,337 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:30:10,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:30:10,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:30:10,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-03 19:30:10,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:30:10,710 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:30:10,723 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-09-03 19:30:10,724 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 22 [2019-09-03 19:30:10,724 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:30:10,741 INFO L567 ElimStorePlain]: treesize reduction 4, result has 78.9 percent of original size [2019-09-03 19:30:10,742 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:30:10,742 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:4 [2019-09-03 19:30:10,770 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 13 proven. 64 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-03 19:30:10,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:30:10,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 26 [2019-09-03 19:30:10,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-03 19:30:10,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-03 19:30:10,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2019-09-03 19:30:10,775 INFO L87 Difference]: Start difference. First operand 1953 states and 2368 transitions. Second operand 26 states. [2019-09-03 19:30:11,644 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2019-09-03 19:30:12,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:30:12,801 INFO L93 Difference]: Finished difference Result 3197 states and 3875 transitions. [2019-09-03 19:30:12,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-03 19:30:12,801 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 72 [2019-09-03 19:30:12,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:30:12,808 INFO L225 Difference]: With dead ends: 3197 [2019-09-03 19:30:12,809 INFO L226 Difference]: Without dead ends: 1819 [2019-09-03 19:30:12,812 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 60 SyntacticMatches, 8 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=249, Invalid=1157, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 19:30:12,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1819 states. [2019-09-03 19:30:13,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1819 to 1444. [2019-09-03 19:30:13,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1444 states. [2019-09-03 19:30:13,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 1706 transitions. [2019-09-03 19:30:13,105 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 1706 transitions. Word has length 72 [2019-09-03 19:30:13,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:30:13,105 INFO L475 AbstractCegarLoop]: Abstraction has 1444 states and 1706 transitions. [2019-09-03 19:30:13,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-03 19:30:13,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 1706 transitions. [2019-09-03 19:30:13,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-03 19:30:13,109 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:30:13,109 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:30:13,109 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:30:13,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:30:13,109 INFO L82 PathProgramCache]: Analyzing trace with hash 2074519543, now seen corresponding path program 8 times [2019-09-03 19:30:13,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:30:13,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:30:13,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:30:13,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:30:13,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:30:13,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:30:13,350 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-03 19:30:13,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:30:13,351 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:30:13,363 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:30:13,403 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:30:13,404 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:30:13,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-03 19:30:13,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:30:13,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:30:13,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:30:13,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:30:13,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:30:13,738 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-09-03 19:30:14,117 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-09-03 19:30:18,739 WARN L188 SmtUtils]: Spent 4.49 s on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-09-03 19:30:19,504 WARN L188 SmtUtils]: Spent 483.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-09-03 19:30:19,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:30:19,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:30:19,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-03 19:30:19,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-03 19:30:19,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:30:19,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-03 19:30:19,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-03 19:30:19,532 INFO L392 ElimStorePlain]: Different costs {10=[v_prenex_50, v_prenex_35, v_prenex_44, |#memory_int|], 18=[v_prenex_31, v_prenex_40]} [2019-09-03 19:30:19,664 INFO L341 Elim1Store]: treesize reduction 17, result has 79.8 percent of original size [2019-09-03 19:30:19,665 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 99 [2019-09-03 19:30:19,666 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:30:19,923 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 105 [2019-09-03 19:30:19,924 INFO L567 ElimStorePlain]: treesize reduction 183, result has 59.9 percent of original size [2019-09-03 19:30:20,038 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-09-03 19:30:20,038 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:30:20,039 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 80 treesize of output 114 [2019-09-03 19:30:20,040 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:30:20,339 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 101 [2019-09-03 19:30:20,340 INFO L567 ElimStorePlain]: treesize reduction 12, result has 95.4 percent of original size [2019-09-03 19:30:20,394 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:30:20,394 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 107 [2019-09-03 19:30:20,398 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-03 19:30:20,612 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 97 [2019-09-03 19:30:20,613 INFO L567 ElimStorePlain]: treesize reduction 12, result has 94.9 percent of original size [2019-09-03 19:30:20,702 INFO L341 Elim1Store]: treesize reduction 17, result has 79.8 percent of original size [2019-09-03 19:30:20,703 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 93 [2019-09-03 19:30:20,704 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-03 19:30:20,907 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-09-03 19:30:20,908 INFO L567 ElimStorePlain]: treesize reduction 8, result has 95.9 percent of original size [2019-09-03 19:30:20,908 INFO L464 ElimStorePlain]: Eliminatee v_prenex_31 vanished before elimination [2019-09-03 19:30:20,908 INFO L464 ElimStorePlain]: Eliminatee v_prenex_40 vanished before elimination [2019-09-03 19:30:20,934 INFO L496 ElimStorePlain]: Start of recursive call 1: 30 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:30:20,935 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 36 variables, input treesize:485, output treesize:4 [2019-09-03 19:30:20,972 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 17 proven. 23 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-03 19:30:20,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:30:20,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 25 [2019-09-03 19:30:20,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 19:30:20,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 19:30:20,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2019-09-03 19:30:20,982 INFO L87 Difference]: Start difference. First operand 1444 states and 1706 transitions. Second operand 25 states. [2019-09-03 19:30:21,501 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-09-03 19:30:23,755 WARN L188 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2019-09-03 19:30:24,319 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-09-03 19:30:24,664 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-09-03 19:30:27,168 WARN L188 SmtUtils]: Spent 2.16 s on a formula simplification that was a NOOP. DAG size: 83 [2019-09-03 19:30:27,912 WARN L188 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-09-03 19:30:32,115 WARN L188 SmtUtils]: Spent 4.15 s on a formula simplification that was a NOOP. DAG size: 87 [2019-09-03 19:30:32,344 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-09-03 19:30:32,474 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-09-03 19:30:33,394 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-09-03 19:30:35,570 WARN L188 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2019-09-03 19:30:35,957 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-09-03 19:30:36,958 WARN L188 SmtUtils]: Spent 941.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-09-03 19:30:39,117 WARN L188 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 46 [2019-09-03 19:30:39,439 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-09-03 19:30:40,910 WARN L188 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2019-09-03 19:30:42,820 WARN L188 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-09-03 19:30:43,590 WARN L188 SmtUtils]: Spent 688.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-09-03 19:30:43,784 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-09-03 19:30:45,324 WARN L188 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-03 19:30:52,926 WARN L188 SmtUtils]: Spent 7.32 s on a formula simplification that was a NOOP. DAG size: 83 [2019-09-03 19:30:53,163 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2019-09-03 19:30:53,878 WARN L188 SmtUtils]: Spent 593.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-09-03 19:30:54,201 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-09-03 19:30:54,433 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 66 [2019-09-03 19:30:55,341 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2019-09-03 19:30:57,159 WARN L188 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-09-03 19:30:58,286 WARN L188 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-09-03 19:30:58,578 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-09-03 19:30:59,252 WARN L188 SmtUtils]: Spent 607.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 66 [2019-09-03 19:30:59,474 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-09-03 19:30:59,646 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-09-03 19:30:59,973 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-09-03 19:31:02,480 WARN L188 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 47 [2019-09-03 19:31:03,109 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-09-03 19:31:04,069 WARN L188 SmtUtils]: Spent 860.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-09-03 19:31:04,356 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-09-03 19:31:07,693 WARN L188 SmtUtils]: Spent 3.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2019-09-03 19:31:10,045 WARN L188 SmtUtils]: Spent 2.28 s on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-09-03 19:31:10,522 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-09-03 19:31:10,839 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-03 19:31:12,458 WARN L188 SmtUtils]: Spent 1.57 s on a formula simplification that was a NOOP. DAG size: 50 [2019-09-03 19:31:13,188 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2019-09-03 19:31:15,820 WARN L188 SmtUtils]: Spent 1.86 s on a formula simplification that was a NOOP. DAG size: 51 [2019-09-03 19:31:17,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:31:17,371 INFO L93 Difference]: Finished difference Result 3595 states and 4336 transitions. [2019-09-03 19:31:17,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2019-09-03 19:31:17,372 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 72 [2019-09-03 19:31:17,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:31:17,399 INFO L225 Difference]: With dead ends: 3595 [2019-09-03 19:31:17,399 INFO L226 Difference]: Without dead ends: 3352 [2019-09-03 19:31:17,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9386 ImplicationChecksByTransitivity, 57.8s TimeCoverageRelationStatistics Valid=1429, Invalid=23693, Unknown=0, NotChecked=0, Total=25122 [2019-09-03 19:31:17,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3352 states. [2019-09-03 19:31:17,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3352 to 1907. [2019-09-03 19:31:17,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1907 states. [2019-09-03 19:31:17,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1907 states to 1907 states and 2277 transitions. [2019-09-03 19:31:17,834 INFO L78 Accepts]: Start accepts. Automaton has 1907 states and 2277 transitions. Word has length 72 [2019-09-03 19:31:17,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:31:17,834 INFO L475 AbstractCegarLoop]: Abstraction has 1907 states and 2277 transitions. [2019-09-03 19:31:17,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 19:31:17,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1907 states and 2277 transitions. [2019-09-03 19:31:17,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-03 19:31:17,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:31:17,837 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:31:17,838 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:31:17,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:31:17,838 INFO L82 PathProgramCache]: Analyzing trace with hash -981181543, now seen corresponding path program 2 times [2019-09-03 19:31:17,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:31:17,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:31:17,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:31:17,839 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:31:17,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:31:17,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:31:17,946 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 11 proven. 25 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-09-03 19:31:17,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:31:17,947 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:31:17,958 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:31:18,006 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:31:18,006 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:31:18,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 19:31:18,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:31:18,168 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 19:31:18,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:31:18,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 18] total 20 [2019-09-03 19:31:18,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 19:31:18,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 19:31:18,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:31:18,173 INFO L87 Difference]: Start difference. First operand 1907 states and 2277 transitions. Second operand 20 states. [2019-09-03 19:31:24,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:31:24,168 INFO L93 Difference]: Finished difference Result 10162 states and 13029 transitions. [2019-09-03 19:31:24,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-03 19:31:24,168 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 74 [2019-09-03 19:31:24,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:31:24,181 INFO L225 Difference]: With dead ends: 10162 [2019-09-03 19:31:24,182 INFO L226 Difference]: Without dead ends: 8290 [2019-09-03 19:31:24,186 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1546 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=303, Invalid=5099, Unknown=0, NotChecked=0, Total=5402 [2019-09-03 19:31:24,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8290 states. [2019-09-03 19:31:24,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8290 to 2087. [2019-09-03 19:31:24,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2087 states. [2019-09-03 19:31:24,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2087 states to 2087 states and 2496 transitions. [2019-09-03 19:31:24,817 INFO L78 Accepts]: Start accepts. Automaton has 2087 states and 2496 transitions. Word has length 74 [2019-09-03 19:31:24,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:31:24,817 INFO L475 AbstractCegarLoop]: Abstraction has 2087 states and 2496 transitions. [2019-09-03 19:31:24,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 19:31:24,817 INFO L276 IsEmpty]: Start isEmpty. Operand 2087 states and 2496 transitions. [2019-09-03 19:31:24,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-03 19:31:24,820 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:31:24,820 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:31:24,820 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:31:24,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:31:24,820 INFO L82 PathProgramCache]: Analyzing trace with hash -650112925, now seen corresponding path program 9 times [2019-09-03 19:31:24,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:31:24,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:31:24,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:31:24,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:31:24,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:31:24,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:31:25,148 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 26 [2019-09-03 19:31:25,302 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 35 [2019-09-03 19:31:25,458 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 34 [2019-09-03 19:31:25,615 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 36 [2019-09-03 19:31:25,905 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 60 [2019-09-03 19:31:26,052 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 28 [2019-09-03 19:31:26,393 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 50 [2019-09-03 19:31:26,565 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 38 [2019-09-03 19:31:26,607 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 43 proven. 50 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-03 19:31:26,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:31:26,607 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:31:26,617 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:31:26,733 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-03 19:31:26,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:31:26,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 19:31:26,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:31:27,240 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-03 19:31:27,240 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:31:27,242 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:27,242 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:31:27,242 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-03 19:31:27,279 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 42 proven. 75 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-03 19:31:27,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:31:27,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21] total 35 [2019-09-03 19:31:27,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-03 19:31:27,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-03 19:31:27,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1033, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 19:31:27,284 INFO L87 Difference]: Start difference. First operand 2087 states and 2496 transitions. Second operand 35 states. [2019-09-03 19:31:29,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:31:29,593 INFO L93 Difference]: Finished difference Result 2931 states and 3600 transitions. [2019-09-03 19:31:29,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 19:31:29,594 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 82 [2019-09-03 19:31:29,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:31:29,598 INFO L225 Difference]: With dead ends: 2931 [2019-09-03 19:31:29,598 INFO L226 Difference]: Without dead ends: 2625 [2019-09-03 19:31:29,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 63 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=389, Invalid=2061, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 19:31:29,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2625 states. [2019-09-03 19:31:30,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2625 to 2001. [2019-09-03 19:31:30,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2001 states. [2019-09-03 19:31:30,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2001 states to 2001 states and 2400 transitions. [2019-09-03 19:31:30,164 INFO L78 Accepts]: Start accepts. Automaton has 2001 states and 2400 transitions. Word has length 82 [2019-09-03 19:31:30,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:31:30,164 INFO L475 AbstractCegarLoop]: Abstraction has 2001 states and 2400 transitions. [2019-09-03 19:31:30,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-03 19:31:30,164 INFO L276 IsEmpty]: Start isEmpty. Operand 2001 states and 2400 transitions. [2019-09-03 19:31:30,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-03 19:31:30,166 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:31:30,167 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:31:30,167 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:31:30,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:31:30,167 INFO L82 PathProgramCache]: Analyzing trace with hash -123343640, now seen corresponding path program 10 times [2019-09-03 19:31:30,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:31:30,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:31:30,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:31:30,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:31:30,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:31:30,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:31:31,297 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-03 19:31:31,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:31:31,297 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:31:31,308 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:31:31,351 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:31:31,352 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:31:31,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-03 19:31:31,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:31:31,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:32,160 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:32,162 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:31:32,163 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:31:32,164 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:31:32,173 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:32,173 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 25 [2019-09-03 19:31:32,174 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:31:32,194 INFO L567 ElimStorePlain]: treesize reduction 5, result has 82.8 percent of original size [2019-09-03 19:31:32,196 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:31:32,196 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:78, output treesize:4 [2019-09-03 19:31:32,274 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 109 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-03 19:31:32,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:31:32,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 29 [2019-09-03 19:31:32,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-03 19:31:32,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-03 19:31:32,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=708, Unknown=0, NotChecked=0, Total=812 [2019-09-03 19:31:32,292 INFO L87 Difference]: Start difference. First operand 2001 states and 2400 transitions. Second operand 29 states. [2019-09-03 19:31:37,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:31:37,456 INFO L93 Difference]: Finished difference Result 7470 states and 9586 transitions. [2019-09-03 19:31:37,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-03 19:31:37,457 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 83 [2019-09-03 19:31:37,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:31:37,466 INFO L225 Difference]: With dead ends: 7470 [2019-09-03 19:31:37,466 INFO L226 Difference]: Without dead ends: 7465 [2019-09-03 19:31:37,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 68 SyntacticMatches, 9 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 835 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=407, Invalid=2785, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 19:31:37,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7465 states. [2019-09-03 19:31:38,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7465 to 2046. [2019-09-03 19:31:38,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2046 states. [2019-09-03 19:31:38,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2046 states to 2046 states and 2445 transitions. [2019-09-03 19:31:38,153 INFO L78 Accepts]: Start accepts. Automaton has 2046 states and 2445 transitions. Word has length 83 [2019-09-03 19:31:38,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:31:38,153 INFO L475 AbstractCegarLoop]: Abstraction has 2046 states and 2445 transitions. [2019-09-03 19:31:38,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-03 19:31:38,154 INFO L276 IsEmpty]: Start isEmpty. Operand 2046 states and 2445 transitions. [2019-09-03 19:31:38,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-03 19:31:38,156 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:31:38,156 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:31:38,156 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:31:38,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:31:38,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1617120574, now seen corresponding path program 11 times [2019-09-03 19:31:38,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:31:38,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:31:38,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:31:38,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:31:38,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:31:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:31:38,352 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-09-03 19:31:38,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:31:38,352 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:31:38,374 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:31:39,324 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-09-03 19:31:39,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:31:39,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-03 19:31:39,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:31:39,425 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-09-03 19:31:39,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:31:39,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 16 [2019-09-03 19:31:39,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 19:31:39,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 19:31:39,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-09-03 19:31:39,431 INFO L87 Difference]: Start difference. First operand 2046 states and 2445 transitions. Second operand 16 states. [2019-09-03 19:31:41,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:31:41,388 INFO L93 Difference]: Finished difference Result 7703 states and 9550 transitions. [2019-09-03 19:31:41,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 19:31:41,389 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 84 [2019-09-03 19:31:41,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:31:41,395 INFO L225 Difference]: With dead ends: 7703 [2019-09-03 19:31:41,395 INFO L226 Difference]: Without dead ends: 5750 [2019-09-03 19:31:41,399 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-09-03 19:31:41,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5750 states. [2019-09-03 19:31:42,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5750 to 2534. [2019-09-03 19:31:42,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2534 states. [2019-09-03 19:31:42,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 3086 transitions. [2019-09-03 19:31:42,145 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 3086 transitions. Word has length 84 [2019-09-03 19:31:42,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:31:42,145 INFO L475 AbstractCegarLoop]: Abstraction has 2534 states and 3086 transitions. [2019-09-03 19:31:42,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 19:31:42,145 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 3086 transitions. [2019-09-03 19:31:42,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-03 19:31:42,148 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:31:42,148 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:31:42,148 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:31:42,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:31:42,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1414873255, now seen corresponding path program 12 times [2019-09-03 19:31:42,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:31:42,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:31:42,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:31:42,149 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:31:42,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:31:42,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:31:42,450 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-09-03 19:31:42,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:31:42,450 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:31:42,475 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:31:42,563 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-09-03 19:31:42,563 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:31:42,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 19:31:42,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:31:42,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:31:43,077 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:31:43,078 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:31:43,078 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2019-09-03 19:31:43,078 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:31:43,090 INFO L567 ElimStorePlain]: treesize reduction 5, result has 73.7 percent of original size [2019-09-03 19:31:43,091 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:31:43,091 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:3 [2019-09-03 19:31:43,132 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 46 proven. 50 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-09-03 19:31:43,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:31:43,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 17] total 25 [2019-09-03 19:31:43,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 19:31:43,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 19:31:43,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2019-09-03 19:31:43,138 INFO L87 Difference]: Start difference. First operand 2534 states and 3086 transitions. Second operand 25 states. [2019-09-03 19:32:05,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:32:05,834 INFO L93 Difference]: Finished difference Result 7169 states and 8660 transitions. [2019-09-03 19:32:05,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 19:32:05,835 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 86 [2019-09-03 19:32:05,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:32:05,842 INFO L225 Difference]: With dead ends: 7169 [2019-09-03 19:32:05,842 INFO L226 Difference]: Without dead ends: 6809 [2019-09-03 19:32:05,844 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=260, Invalid=2285, Unknown=5, NotChecked=0, Total=2550 [2019-09-03 19:32:05,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6809 states. [2019-09-03 19:32:06,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6809 to 2554. [2019-09-03 19:32:06,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2554 states. [2019-09-03 19:32:06,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2554 states to 2554 states and 3106 transitions. [2019-09-03 19:32:06,557 INFO L78 Accepts]: Start accepts. Automaton has 2554 states and 3106 transitions. Word has length 86 [2019-09-03 19:32:06,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:32:06,557 INFO L475 AbstractCegarLoop]: Abstraction has 2554 states and 3106 transitions. [2019-09-03 19:32:06,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 19:32:06,558 INFO L276 IsEmpty]: Start isEmpty. Operand 2554 states and 3106 transitions. [2019-09-03 19:32:06,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-03 19:32:06,561 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:32:06,561 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1] [2019-09-03 19:32:06,561 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:32:06,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:32:06,562 INFO L82 PathProgramCache]: Analyzing trace with hash -189434726, now seen corresponding path program 13 times [2019-09-03 19:32:06,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:32:06,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:32:06,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:32:06,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:32:06,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:32:06,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:32:07,099 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 39 [2019-09-03 19:32:07,273 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 35 [2019-09-03 19:32:07,784 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 47 [2019-09-03 19:32:08,028 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 28 [2019-09-03 19:32:08,065 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 35 proven. 98 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 19:32:08,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:32:08,065 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:32:08,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:32:08,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:32:08,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-03 19:32:08,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:32:08,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:32:08,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:32:08,400 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:32:08,400 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:32:08,404 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:08,405 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:32:08,406 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:08,407 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:32:08,411 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:32:08,411 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 37 [2019-09-03 19:32:08,412 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:32:08,431 INFO L567 ElimStorePlain]: treesize reduction 5, result has 80.0 percent of original size [2019-09-03 19:32:08,432 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:32:08,432 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:106, output treesize:3 [2019-09-03 19:32:08,467 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 35 proven. 118 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 19:32:08,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:32:08,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2019-09-03 19:32:08,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-03 19:32:08,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-03 19:32:08,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2019-09-03 19:32:08,471 INFO L87 Difference]: Start difference. First operand 2554 states and 3106 transitions. Second operand 22 states. [2019-09-03 19:32:10,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:32:10,274 INFO L93 Difference]: Finished difference Result 4594 states and 5717 transitions. [2019-09-03 19:32:10,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 19:32:10,276 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 93 [2019-09-03 19:32:10,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:32:10,279 INFO L225 Difference]: With dead ends: 4594 [2019-09-03 19:32:10,279 INFO L226 Difference]: Without dead ends: 4442 [2019-09-03 19:32:10,280 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 81 SyntacticMatches, 12 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2019-09-03 19:32:10,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4442 states. [2019-09-03 19:32:11,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4442 to 3696. [2019-09-03 19:32:11,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3696 states. [2019-09-03 19:32:11,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3696 states to 3696 states and 4471 transitions. [2019-09-03 19:32:11,219 INFO L78 Accepts]: Start accepts. Automaton has 3696 states and 4471 transitions. Word has length 93 [2019-09-03 19:32:11,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:32:11,219 INFO L475 AbstractCegarLoop]: Abstraction has 3696 states and 4471 transitions. [2019-09-03 19:32:11,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-03 19:32:11,219 INFO L276 IsEmpty]: Start isEmpty. Operand 3696 states and 4471 transitions. [2019-09-03 19:32:11,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-03 19:32:11,223 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:32:11,223 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1] [2019-09-03 19:32:11,223 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:32:11,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:32:11,223 INFO L82 PathProgramCache]: Analyzing trace with hash 455905118, now seen corresponding path program 14 times [2019-09-03 19:32:11,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:32:11,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:32:11,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:32:11,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:32:11,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:32:11,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:32:11,815 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 48 [2019-09-03 19:32:12,082 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 45 [2019-09-03 19:32:12,351 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 41 [2019-09-03 19:32:12,877 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 37 [2019-09-03 19:32:13,479 WARN L188 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 91 [2019-09-03 19:32:13,557 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 21 proven. 115 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-03 19:32:13,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:32:13,558 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:32:13,568 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:32:13,623 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:32:13,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:32:13,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-03 19:32:13,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:32:13,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:32:14,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:32:14,058 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:32:14,058 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:32:14,061 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:14,062 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:32:14,063 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:32:14,064 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:32:14,069 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:32:14,069 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 32 [2019-09-03 19:32:14,069 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:32:14,085 INFO L567 ElimStorePlain]: treesize reduction 5, result has 75.0 percent of original size [2019-09-03 19:32:14,086 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:32:14,086 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:100, output treesize:3 [2019-09-03 19:32:14,161 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 21 proven. 139 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-03 19:32:14,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:32:14,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 27 [2019-09-03 19:32:14,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 19:32:14,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 19:32:14,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=582, Unknown=0, NotChecked=0, Total=702 [2019-09-03 19:32:14,165 INFO L87 Difference]: Start difference. First operand 3696 states and 4471 transitions. Second operand 27 states. [2019-09-03 19:32:14,484 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 26 [2019-09-03 19:32:14,631 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 28 [2019-09-03 19:32:15,091 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 45 [2019-09-03 19:32:15,237 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 36 [2019-09-03 19:32:16,252 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 36 [2019-09-03 19:32:16,594 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 37 [2019-09-03 19:32:18,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:32:18,146 INFO L93 Difference]: Finished difference Result 9964 states and 12203 transitions. [2019-09-03 19:32:18,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 19:32:18,147 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2019-09-03 19:32:18,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:32:18,151 INFO L225 Difference]: With dead ends: 9964 [2019-09-03 19:32:18,151 INFO L226 Difference]: Without dead ends: 5789 [2019-09-03 19:32:18,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 78 SyntacticMatches, 13 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=258, Invalid=1302, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 19:32:18,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5789 states. [2019-09-03 19:32:19,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5789 to 5381. [2019-09-03 19:32:19,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5381 states. [2019-09-03 19:32:19,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5381 states to 5381 states and 6436 transitions. [2019-09-03 19:32:19,580 INFO L78 Accepts]: Start accepts. Automaton has 5381 states and 6436 transitions. Word has length 93 [2019-09-03 19:32:19,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:32:19,581 INFO L475 AbstractCegarLoop]: Abstraction has 5381 states and 6436 transitions. [2019-09-03 19:32:19,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 19:32:19,581 INFO L276 IsEmpty]: Start isEmpty. Operand 5381 states and 6436 transitions. [2019-09-03 19:32:19,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-03 19:32:19,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:32:19,588 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1] [2019-09-03 19:32:19,588 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:32:19,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:32:19,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1290857626, now seen corresponding path program 15 times [2019-09-03 19:32:19,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:32:19,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:32:19,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:32:19,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:32:19,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:32:19,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-03 19:32:19,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:32:19,730 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: program execution has not yet been computed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.getRcfgProgramExecution(TraceCheck.java:440) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.(TraceCheck.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:453) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-09-03 19:32:19,734 INFO L168 Benchmark]: Toolchain (without parser) took 593502.04 ms. Allocated memory was 139.5 MB in the beginning and 889.7 MB in the end (delta: 750.3 MB). Free memory was 87.2 MB in the beginning and 203.1 MB in the end (delta: -115.9 MB). Peak memory consumption was 634.4 MB. Max. memory is 7.1 GB. [2019-09-03 19:32:19,734 INFO L168 Benchmark]: CDTParser took 0.38 ms. Allocated memory is still 139.5 MB. Free memory was 105.4 MB in the beginning and 105.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-03 19:32:19,735 INFO L168 Benchmark]: CACSL2BoogieTranslator took 374.71 ms. Allocated memory was 139.5 MB in the beginning and 199.2 MB in the end (delta: 59.8 MB). Free memory was 86.8 MB in the beginning and 177.0 MB in the end (delta: -90.2 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. [2019-09-03 19:32:19,735 INFO L168 Benchmark]: Boogie Preprocessor took 42.09 ms. Allocated memory is still 199.2 MB. Free memory was 177.0 MB in the beginning and 174.7 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-09-03 19:32:19,735 INFO L168 Benchmark]: RCFGBuilder took 408.52 ms. Allocated memory is still 199.2 MB. Free memory was 174.7 MB in the beginning and 155.7 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. [2019-09-03 19:32:19,736 INFO L168 Benchmark]: TraceAbstraction took 592672.70 ms. Allocated memory was 199.2 MB in the beginning and 889.7 MB in the end (delta: 690.5 MB). Free memory was 155.1 MB in the beginning and 203.1 MB in the end (delta: -47.9 MB). Peak memory consumption was 642.6 MB. Max. memory is 7.1 GB. [2019-09-03 19:32:19,737 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38 ms. Allocated memory is still 139.5 MB. Free memory was 105.4 MB in the beginning and 105.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 374.71 ms. Allocated memory was 139.5 MB in the beginning and 199.2 MB in the end (delta: 59.8 MB). Free memory was 86.8 MB in the beginning and 177.0 MB in the end (delta: -90.2 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.09 ms. Allocated memory is still 199.2 MB. Free memory was 177.0 MB in the beginning and 174.7 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 408.52 ms. Allocated memory is still 199.2 MB. Free memory was 174.7 MB in the beginning and 155.7 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 592672.70 ms. Allocated memory was 199.2 MB in the beginning and 889.7 MB in the end (delta: 690.5 MB). Free memory was 155.1 MB in the beginning and 203.1 MB in the end (delta: -47.9 MB). Peak memory consumption was 642.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: program execution has not yet been computed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: program execution has not yet been computed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.getRcfgProgramExecution(TraceCheck.java:440) RESULT: Ultimate could not prove your program: Toolchain returned no result. [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...