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/eca-rers2012/Problem16_label31.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 21:08:57,137 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 21:08:57,140 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 21:08:57,158 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 21:08:57,158 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 21:08:57,160 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 21:08:57,162 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 21:08:57,174 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 21:08:57,176 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 21:08:57,177 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 21:08:57,178 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 21:08:57,179 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 21:08:57,179 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 21:08:57,180 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 21:08:57,181 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 21:08:57,182 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 21:08:57,183 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 21:08:57,184 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 21:08:57,186 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 21:08:57,187 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 21:08:57,189 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 21:08:57,192 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 21:08:57,193 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 21:08:57,194 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 21:08:57,197 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 21:08:57,197 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 21:08:57,198 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 21:08:57,199 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 21:08:57,199 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 21:08:57,200 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 21:08:57,200 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 21:08:57,201 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 21:08:57,201 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 21:08:57,202 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 21:08:57,203 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 21:08:57,203 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 21:08:57,204 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 21:08:57,204 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 21:08:57,204 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 21:08:57,205 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 21:08:57,206 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 21:08:57,207 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-07 21:08:57,227 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 21:08:57,228 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 21:08:57,229 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 21:08:57,230 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 21:08:57,230 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 21:08:57,230 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 21:08:57,230 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 21:08:57,231 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 21:08:57,231 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 21:08:57,231 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 21:08:57,232 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 21:08:57,232 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 21:08:57,233 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 21:08:57,233 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 21:08:57,233 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 21:08:57,233 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 21:08:57,234 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 21:08:57,234 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 21:08:57,234 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 21:08:57,234 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 21:08:57,235 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 21:08:57,235 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 21:08:57,235 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 21:08:57,235 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 21:08:57,235 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 21:08:57,235 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 21:08:57,236 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 21:08:57,236 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 21:08:57,236 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 21:08:57,278 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 21:08:57,296 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 21:08:57,301 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 21:08:57,302 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 21:08:57,305 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 21:08:57,306 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label31.c [2019-09-07 21:08:57,377 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea767ee80/0cba10664324445eaf844ed37ab1c3fb/FLAG89371d452 [2019-09-07 21:08:58,097 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 21:08:58,097 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label31.c [2019-09-07 21:08:58,121 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea767ee80/0cba10664324445eaf844ed37ab1c3fb/FLAG89371d452 [2019-09-07 21:08:58,221 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea767ee80/0cba10664324445eaf844ed37ab1c3fb [2019-09-07 21:08:58,232 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 21:08:58,233 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 21:08:58,234 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 21:08:58,234 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 21:08:58,238 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 21:08:58,239 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 09:08:58" (1/1) ... [2019-09-07 21:08:58,242 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e21a4d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:08:58, skipping insertion in model container [2019-09-07 21:08:58,242 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 09:08:58" (1/1) ... [2019-09-07 21:08:58,250 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 21:08:58,325 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 21:08:59,129 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 21:08:59,145 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 21:08:59,501 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 21:08:59,522 INFO L192 MainTranslator]: Completed translation [2019-09-07 21:08:59,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:08:59 WrapperNode [2019-09-07 21:08:59,524 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 21:08:59,525 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 21:08:59,525 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 21:08:59,525 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 21:08:59,541 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:08:59" (1/1) ... [2019-09-07 21:08:59,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:08:59" (1/1) ... [2019-09-07 21:08:59,593 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:08:59" (1/1) ... [2019-09-07 21:08:59,593 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:08:59" (1/1) ... [2019-09-07 21:08:59,659 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:08:59" (1/1) ... [2019-09-07 21:08:59,687 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:08:59" (1/1) ... [2019-09-07 21:08:59,702 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:08:59" (1/1) ... [2019-09-07 21:08:59,717 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 21:08:59,717 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 21:08:59,718 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 21:08:59,718 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 21:08:59,719 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:08:59" (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-07 21:08:59,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 21:08:59,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 21:08:59,784 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 21:08:59,784 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 21:08:59,784 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 21:08:59,784 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 21:08:59,784 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 21:08:59,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 21:08:59,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 21:08:59,785 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 21:08:59,785 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 21:08:59,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 21:08:59,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 21:09:02,215 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 21:09:02,216 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 21:09:02,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 09:09:02 BoogieIcfgContainer [2019-09-07 21:09:02,217 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 21:09:02,218 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 21:09:02,218 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 21:09:02,221 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 21:09:02,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 09:08:58" (1/3) ... [2019-09-07 21:09:02,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34e9755d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 09:09:02, skipping insertion in model container [2019-09-07 21:09:02,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:08:59" (2/3) ... [2019-09-07 21:09:02,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34e9755d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 09:09:02, skipping insertion in model container [2019-09-07 21:09:02,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 09:09:02" (3/3) ... [2019-09-07 21:09:02,225 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem16_label31.c [2019-09-07 21:09:02,235 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 21:09:02,246 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 21:09:02,264 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 21:09:02,316 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 21:09:02,317 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 21:09:02,317 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 21:09:02,318 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 21:09:02,318 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 21:09:02,318 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 21:09:02,318 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 21:09:02,318 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 21:09:02,318 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 21:09:02,356 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states. [2019-09-07 21:09:02,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-07 21:09:02,363 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:09:02,364 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:09:02,366 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:09:02,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:09:02,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1091509315, now seen corresponding path program 1 times [2019-09-07 21:09:02,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:09:02,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:09:02,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:09:02,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:09:02,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:09:02,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:09:02,669 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-07 21:09:02,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:09:02,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 21:09:02,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 21:09:02,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 21:09:02,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 21:09:02,696 INFO L87 Difference]: Start difference. First operand 409 states. Second operand 3 states. [2019-09-07 21:09:04,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:09:04,997 INFO L93 Difference]: Finished difference Result 1153 states and 2141 transitions. [2019-09-07 21:09:04,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 21:09:04,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-09-07 21:09:04,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:09:05,021 INFO L225 Difference]: With dead ends: 1153 [2019-09-07 21:09:05,022 INFO L226 Difference]: Without dead ends: 682 [2019-09-07 21:09:05,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-07 21:09:05,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2019-09-07 21:09:05,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 682. [2019-09-07 21:09:05,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2019-09-07 21:09:05,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1184 transitions. [2019-09-07 21:09:05,137 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1184 transitions. Word has length 14 [2019-09-07 21:09:05,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:09:05,137 INFO L475 AbstractCegarLoop]: Abstraction has 682 states and 1184 transitions. [2019-09-07 21:09:05,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 21:09:05,138 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1184 transitions. [2019-09-07 21:09:05,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-07 21:09:05,143 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:09:05,144 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:09:05,145 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:09:05,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:09:05,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1983722673, now seen corresponding path program 1 times [2019-09-07 21:09:05,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:09:05,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:09:05,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:09:05,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:09:05,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:09:05,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:09:05,365 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:09:05,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:09:05,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 21:09:05,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 21:09:05,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 21:09:05,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 21:09:05,368 INFO L87 Difference]: Start difference. First operand 682 states and 1184 transitions. Second operand 5 states. [2019-09-07 21:09:08,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:09:08,097 INFO L93 Difference]: Finished difference Result 2066 states and 3624 transitions. [2019-09-07 21:09:08,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 21:09:08,097 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-09-07 21:09:08,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:09:08,110 INFO L225 Difference]: With dead ends: 2066 [2019-09-07 21:09:08,110 INFO L226 Difference]: Without dead ends: 1390 [2019-09-07 21:09:08,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 21:09:08,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2019-09-07 21:09:08,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1372. [2019-09-07 21:09:08,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1372 states. [2019-09-07 21:09:08,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 2268 transitions. [2019-09-07 21:09:08,194 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 2268 transitions. Word has length 83 [2019-09-07 21:09:08,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:09:08,194 INFO L475 AbstractCegarLoop]: Abstraction has 1372 states and 2268 transitions. [2019-09-07 21:09:08,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 21:09:08,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 2268 transitions. [2019-09-07 21:09:08,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-07 21:09:08,199 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:09:08,199 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:09:08,199 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:09:08,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:09:08,200 INFO L82 PathProgramCache]: Analyzing trace with hash 247199364, now seen corresponding path program 1 times [2019-09-07 21:09:08,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:09:08,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:09:08,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:09:08,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:09:08,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:09:08,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:09:08,438 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:09:08,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:09:08,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 21:09:08,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 21:09:08,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 21:09:08,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 21:09:08,443 INFO L87 Difference]: Start difference. First operand 1372 states and 2268 transitions. Second operand 6 states. [2019-09-07 21:09:11,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:09:11,015 INFO L93 Difference]: Finished difference Result 3472 states and 5791 transitions. [2019-09-07 21:09:11,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 21:09:11,016 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 112 [2019-09-07 21:09:11,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:09:11,035 INFO L225 Difference]: With dead ends: 3472 [2019-09-07 21:09:11,035 INFO L226 Difference]: Without dead ends: 2106 [2019-09-07 21:09:11,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:09:11,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2106 states. [2019-09-07 21:09:11,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2106 to 2081. [2019-09-07 21:09:11,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2081 states. [2019-09-07 21:09:11,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 2081 states and 3263 transitions. [2019-09-07 21:09:11,129 INFO L78 Accepts]: Start accepts. Automaton has 2081 states and 3263 transitions. Word has length 112 [2019-09-07 21:09:11,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:09:11,137 INFO L475 AbstractCegarLoop]: Abstraction has 2081 states and 3263 transitions. [2019-09-07 21:09:11,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 21:09:11,138 INFO L276 IsEmpty]: Start isEmpty. Operand 2081 states and 3263 transitions. [2019-09-07 21:09:11,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-07 21:09:11,145 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:09:11,145 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:09:11,145 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:09:11,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:09:11,146 INFO L82 PathProgramCache]: Analyzing trace with hash 775523072, now seen corresponding path program 1 times [2019-09-07 21:09:11,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:09:11,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:09:11,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:09:11,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:09:11,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:09:11,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:09:11,342 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:09:11,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:09:11,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 21:09:11,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 21:09:11,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 21:09:11,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 21:09:11,344 INFO L87 Difference]: Start difference. First operand 2081 states and 3263 transitions. Second operand 6 states. [2019-09-07 21:09:13,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:09:13,712 INFO L93 Difference]: Finished difference Result 5241 states and 8253 transitions. [2019-09-07 21:09:13,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 21:09:13,716 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2019-09-07 21:09:13,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:09:13,736 INFO L225 Difference]: With dead ends: 5241 [2019-09-07 21:09:13,736 INFO L226 Difference]: Without dead ends: 3166 [2019-09-07 21:09:13,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:09:13,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3166 states. [2019-09-07 21:09:13,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3166 to 3140. [2019-09-07 21:09:13,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2019-09-07 21:09:13,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 4128 transitions. [2019-09-07 21:09:13,833 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 4128 transitions. Word has length 130 [2019-09-07 21:09:13,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:09:13,834 INFO L475 AbstractCegarLoop]: Abstraction has 3140 states and 4128 transitions. [2019-09-07 21:09:13,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 21:09:13,835 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 4128 transitions. [2019-09-07 21:09:13,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-07 21:09:13,840 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:09:13,840 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 21:09:13,840 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:09:13,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:09:13,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1764560011, now seen corresponding path program 1 times [2019-09-07 21:09:13,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:09:13,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:09:13,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:09:13,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:09:13,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:09:13,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:09:14,023 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 73 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 21:09:14,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:09:14,024 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) [2019-09-07 21:09:14,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:09:14,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:09:14,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:09:14,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:09:14,250 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-07 21:09:14,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 21:09:14,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-07 21:09:14,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 21:09:14,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 21:09:14,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-07 21:09:14,260 INFO L87 Difference]: Start difference. First operand 3140 states and 4128 transitions. Second operand 5 states. [2019-09-07 21:09:16,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:09:16,991 INFO L93 Difference]: Finished difference Result 6315 states and 8333 transitions. [2019-09-07 21:09:16,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 21:09:16,992 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 212 [2019-09-07 21:09:16,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:09:17,011 INFO L225 Difference]: With dead ends: 6315 [2019-09-07 21:09:17,012 INFO L226 Difference]: Without dead ends: 3181 [2019-09-07 21:09:17,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-07 21:09:17,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3181 states. [2019-09-07 21:09:17,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3181 to 3145. [2019-09-07 21:09:17,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3145 states. [2019-09-07 21:09:17,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3145 states to 3145 states and 4018 transitions. [2019-09-07 21:09:17,123 INFO L78 Accepts]: Start accepts. Automaton has 3145 states and 4018 transitions. Word has length 212 [2019-09-07 21:09:17,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:09:17,124 INFO L475 AbstractCegarLoop]: Abstraction has 3145 states and 4018 transitions. [2019-09-07 21:09:17,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 21:09:17,124 INFO L276 IsEmpty]: Start isEmpty. Operand 3145 states and 4018 transitions. [2019-09-07 21:09:17,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2019-09-07 21:09:17,133 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:09:17,133 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2019-09-07 21:09:17,134 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:09:17,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:09:17,134 INFO L82 PathProgramCache]: Analyzing trace with hash 2108529532, now seen corresponding path program 1 times [2019-09-07 21:09:17,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:09:17,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:09:17,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:09:17,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:09:17,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:09:17,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:09:17,560 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 138 proven. 115 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-09-07 21:09:17,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:09:17,561 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-07 21:09:17,592 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-07 21:09:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:09:17,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:09:17,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:09:17,961 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 357 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-07 21:09:17,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:09:17,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 21:09:17,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 21:09:17,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 21:09:17,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:09:17,976 INFO L87 Difference]: Start difference. First operand 3145 states and 4018 transitions. Second operand 9 states. [2019-09-07 21:09:23,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:09:23,106 INFO L93 Difference]: Finished difference Result 9172 states and 12131 transitions. [2019-09-07 21:09:23,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 21:09:23,107 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 374 [2019-09-07 21:09:23,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:09:23,144 INFO L225 Difference]: With dead ends: 9172 [2019-09-07 21:09:23,145 INFO L226 Difference]: Without dead ends: 6033 [2019-09-07 21:09:23,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2019-09-07 21:09:23,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6033 states. [2019-09-07 21:09:23,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6033 to 6003. [2019-09-07 21:09:23,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6003 states. [2019-09-07 21:09:23,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6003 states to 6003 states and 7539 transitions. [2019-09-07 21:09:23,400 INFO L78 Accepts]: Start accepts. Automaton has 6003 states and 7539 transitions. Word has length 374 [2019-09-07 21:09:23,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:09:23,401 INFO L475 AbstractCegarLoop]: Abstraction has 6003 states and 7539 transitions. [2019-09-07 21:09:23,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 21:09:23,401 INFO L276 IsEmpty]: Start isEmpty. Operand 6003 states and 7539 transitions. [2019-09-07 21:09:23,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2019-09-07 21:09:23,418 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:09:23,420 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:09:23,420 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:09:23,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:09:23,421 INFO L82 PathProgramCache]: Analyzing trace with hash -445608739, now seen corresponding path program 1 times [2019-09-07 21:09:23,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:09:23,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:09:23,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:09:23,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:09:23,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:09:23,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:09:24,492 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 30 proven. 203 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 21:09:24,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:09:24,494 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) [2019-09-07 21:09:24,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:09:24,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:09:24,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:09:24,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:09:24,752 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-07 21:09:24,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 21:09:24,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-09-07 21:09:24,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 21:09:24,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 21:09:24,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 21:09:24,768 INFO L87 Difference]: Start difference. First operand 6003 states and 7539 transitions. Second operand 6 states. [2019-09-07 21:09:27,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:09:27,976 INFO L93 Difference]: Finished difference Result 17224 states and 22031 transitions. [2019-09-07 21:09:27,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 21:09:27,977 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 476 [2019-09-07 21:09:27,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:09:28,056 INFO L225 Difference]: With dead ends: 17224 [2019-09-07 21:09:28,057 INFO L226 Difference]: Without dead ends: 11227 [2019-09-07 21:09:28,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 481 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:09:28,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11227 states. [2019-09-07 21:09:28,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11227 to 8443. [2019-09-07 21:09:28,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8443 states. [2019-09-07 21:09:28,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8443 states to 8443 states and 10989 transitions. [2019-09-07 21:09:28,380 INFO L78 Accepts]: Start accepts. Automaton has 8443 states and 10989 transitions. Word has length 476 [2019-09-07 21:09:28,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:09:28,381 INFO L475 AbstractCegarLoop]: Abstraction has 8443 states and 10989 transitions. [2019-09-07 21:09:28,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 21:09:28,381 INFO L276 IsEmpty]: Start isEmpty. Operand 8443 states and 10989 transitions. [2019-09-07 21:09:28,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 699 [2019-09-07 21:09:28,429 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:09:28,430 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:09:28,430 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:09:28,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:09:28,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1966926777, now seen corresponding path program 1 times [2019-09-07 21:09:28,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:09:28,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:09:28,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:09:28,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:09:28,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:09:28,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:09:29,353 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 28 proven. 420 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2019-09-07 21:09:29,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:09:29,353 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-07 21:09:29,371 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-07 21:09:29,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:09:29,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 966 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 21:09:29,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:09:29,962 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 436 proven. 0 refuted. 0 times theorem prover too weak. 306 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-07 21:09:29,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 21:09:29,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 21:09:29,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 21:09:29,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 21:09:29,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:09:29,969 INFO L87 Difference]: Start difference. First operand 8443 states and 10989 transitions. Second operand 9 states. [2019-09-07 21:09:33,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:09:33,804 INFO L93 Difference]: Finished difference Result 16947 states and 22192 transitions. [2019-09-07 21:09:33,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 21:09:33,805 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 698 [2019-09-07 21:09:33,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:09:33,839 INFO L225 Difference]: With dead ends: 16947 [2019-09-07 21:09:33,839 INFO L226 Difference]: Without dead ends: 8510 [2019-09-07 21:09:33,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 724 GetRequests, 706 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2019-09-07 21:09:33,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8510 states. [2019-09-07 21:09:34,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8510 to 8483. [2019-09-07 21:09:34,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8483 states. [2019-09-07 21:09:34,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8483 states to 8483 states and 10655 transitions. [2019-09-07 21:09:34,077 INFO L78 Accepts]: Start accepts. Automaton has 8483 states and 10655 transitions. Word has length 698 [2019-09-07 21:09:34,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:09:34,078 INFO L475 AbstractCegarLoop]: Abstraction has 8483 states and 10655 transitions. [2019-09-07 21:09:34,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 21:09:34,078 INFO L276 IsEmpty]: Start isEmpty. Operand 8483 states and 10655 transitions. [2019-09-07 21:09:34,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2019-09-07 21:09:34,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:09:34,120 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:09:34,121 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:09:34,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:09:34,121 INFO L82 PathProgramCache]: Analyzing trace with hash 934500835, now seen corresponding path program 1 times [2019-09-07 21:09:34,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:09:34,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:09:34,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:09:34,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:09:34,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:09:34,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:09:35,073 INFO L134 CoverageAnalysis]: Checked inductivity of 772 backedges. 494 proven. 2 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-09-07 21:09:35,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:09:35,073 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-07 21:09:35,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:09:35,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:09:35,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 992 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 21:09:35,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:09:35,606 INFO L134 CoverageAnalysis]: Checked inductivity of 772 backedges. 494 proven. 2 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-09-07 21:09:35,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:09:35,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 21:09:35,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 21:09:35,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 21:09:35,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:09:35,612 INFO L87 Difference]: Start difference. First operand 8483 states and 10655 transitions. Second operand 9 states. [2019-09-07 21:09:47,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:09:47,570 INFO L93 Difference]: Finished difference Result 24481 states and 34411 transitions. [2019-09-07 21:09:47,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-07 21:09:47,570 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 728 [2019-09-07 21:09:47,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:09:47,661 INFO L225 Difference]: With dead ends: 24481 [2019-09-07 21:09:47,662 INFO L226 Difference]: Without dead ends: 12326 [2019-09-07 21:09:47,711 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 792 GetRequests, 754 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=307, Invalid=1253, Unknown=0, NotChecked=0, Total=1560 [2019-09-07 21:09:47,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12326 states. [2019-09-07 21:09:48,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12326 to 11813. [2019-09-07 21:09:48,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11813 states. [2019-09-07 21:09:48,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11813 states to 11813 states and 14459 transitions. [2019-09-07 21:09:48,078 INFO L78 Accepts]: Start accepts. Automaton has 11813 states and 14459 transitions. Word has length 728 [2019-09-07 21:09:48,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:09:48,080 INFO L475 AbstractCegarLoop]: Abstraction has 11813 states and 14459 transitions. [2019-09-07 21:09:48,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 21:09:48,080 INFO L276 IsEmpty]: Start isEmpty. Operand 11813 states and 14459 transitions. [2019-09-07 21:09:48,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 984 [2019-09-07 21:09:48,151 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:09:48,152 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:09:48,152 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:09:48,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:09:48,153 INFO L82 PathProgramCache]: Analyzing trace with hash -298360000, now seen corresponding path program 1 times [2019-09-07 21:09:48,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:09:48,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:09:48,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:09:48,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:09:48,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:09:48,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:09:49,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1363 backedges. 728 proven. 2 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2019-09-07 21:09:49,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:09:49,551 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-07 21:09:49,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:09:49,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:09:49,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 1247 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:09:49,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:09:50,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1363 backedges. 728 proven. 2 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2019-09-07 21:09:50,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:09:50,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 21:09:50,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 21:09:50,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 21:09:50,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:09:50,505 INFO L87 Difference]: Start difference. First operand 11813 states and 14459 transitions. Second operand 9 states. [2019-09-07 21:09:55,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:09:55,471 INFO L93 Difference]: Finished difference Result 26506 states and 32272 transitions. [2019-09-07 21:09:55,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 21:09:55,472 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 983 [2019-09-07 21:09:55,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:09:55,528 INFO L225 Difference]: With dead ends: 26506 [2019-09-07 21:09:55,528 INFO L226 Difference]: Without dead ends: 13250 [2019-09-07 21:09:55,584 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1010 GetRequests, 991 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2019-09-07 21:09:55,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13250 states. [2019-09-07 21:09:55,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13250 to 13088. [2019-09-07 21:09:55,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13088 states. [2019-09-07 21:09:55,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13088 states to 13088 states and 14646 transitions. [2019-09-07 21:09:55,917 INFO L78 Accepts]: Start accepts. Automaton has 13088 states and 14646 transitions. Word has length 983 [2019-09-07 21:09:55,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:09:55,918 INFO L475 AbstractCegarLoop]: Abstraction has 13088 states and 14646 transitions. [2019-09-07 21:09:55,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 21:09:55,919 INFO L276 IsEmpty]: Start isEmpty. Operand 13088 states and 14646 transitions. [2019-09-07 21:09:55,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 986 [2019-09-07 21:09:55,957 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:09:55,958 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:09:55,958 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:09:55,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:09:55,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1954803420, now seen corresponding path program 1 times [2019-09-07 21:09:55,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:09:55,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:09:55,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:09:55,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:09:55,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:09:56,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:09:57,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 878 proven. 221 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2019-09-07 21:09:57,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:09:57,665 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-07 21:09:57,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:09:57,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:09:57,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 1245 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:09:57,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:09:58,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 1328 trivial. 0 not checked. [2019-09-07 21:09:58,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 21:09:58,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-09-07 21:09:58,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 21:09:58,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 21:09:58,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:09:58,289 INFO L87 Difference]: Start difference. First operand 13088 states and 14646 transitions. Second operand 9 states. [2019-09-07 21:10:01,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:10:01,319 INFO L93 Difference]: Finished difference Result 26924 states and 30249 transitions. [2019-09-07 21:10:01,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 21:10:01,320 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 985 [2019-09-07 21:10:01,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:10:01,371 INFO L225 Difference]: With dead ends: 26924 [2019-09-07 21:10:01,371 INFO L226 Difference]: Without dead ends: 15531 [2019-09-07 21:10:01,404 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1009 GetRequests, 996 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-09-07 21:10:01,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15531 states. [2019-09-07 21:10:01,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15531 to 13786. [2019-09-07 21:10:01,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13786 states. [2019-09-07 21:10:01,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13786 states to 13786 states and 15370 transitions. [2019-09-07 21:10:01,724 INFO L78 Accepts]: Start accepts. Automaton has 13786 states and 15370 transitions. Word has length 985 [2019-09-07 21:10:01,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:10:01,725 INFO L475 AbstractCegarLoop]: Abstraction has 13786 states and 15370 transitions. [2019-09-07 21:10:01,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 21:10:01,726 INFO L276 IsEmpty]: Start isEmpty. Operand 13786 states and 15370 transitions. [2019-09-07 21:10:01,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1159 [2019-09-07 21:10:01,772 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:10:01,774 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:10:01,774 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:10:01,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:10:01,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1357302622, now seen corresponding path program 1 times [2019-09-07 21:10:01,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:10:01,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:10:01,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:10:01,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:10:01,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:10:01,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:10:05,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2064 backedges. 496 proven. 425 refuted. 0 times theorem prover too weak. 1143 trivial. 0 not checked. [2019-09-07 21:10:05,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:10:05,813 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) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:10:05,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:10:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:10:06,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 1459 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:10:06,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:10:06,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2064 backedges. 734 proven. 2 refuted. 0 times theorem prover too weak. 1328 trivial. 0 not checked. [2019-09-07 21:10:06,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:10:06,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 14 [2019-09-07 21:10:06,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 21:10:06,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 21:10:06,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-09-07 21:10:06,686 INFO L87 Difference]: Start difference. First operand 13786 states and 15370 transitions. Second operand 14 states. [2019-09-07 21:10:06,836 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-09-07 21:10:08,518 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-07 21:10:09,227 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-09-07 21:10:10,513 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-07 21:10:11,939 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-07 21:10:12,122 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-09-07 21:10:12,334 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2019-09-07 21:10:12,886 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-07 21:10:13,549 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 36 [2019-09-07 21:10:13,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:10:13,803 INFO L93 Difference]: Finished difference Result 25671 states and 28241 transitions. [2019-09-07 21:10:13,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-07 21:10:13,803 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 1158 [2019-09-07 21:10:13,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:10:13,845 INFO L225 Difference]: With dead ends: 25671 [2019-09-07 21:10:13,846 INFO L226 Difference]: Without dead ends: 13580 [2019-09-07 21:10:13,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1235 GetRequests, 1188 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=549, Invalid=1707, Unknown=0, NotChecked=0, Total=2256 [2019-09-07 21:10:13,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13580 states. [2019-09-07 21:10:14,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13580 to 12829. [2019-09-07 21:10:14,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12829 states. [2019-09-07 21:10:14,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12829 states to 12829 states and 13655 transitions. [2019-09-07 21:10:14,126 INFO L78 Accepts]: Start accepts. Automaton has 12829 states and 13655 transitions. Word has length 1158 [2019-09-07 21:10:14,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:10:14,127 INFO L475 AbstractCegarLoop]: Abstraction has 12829 states and 13655 transitions. [2019-09-07 21:10:14,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 21:10:14,127 INFO L276 IsEmpty]: Start isEmpty. Operand 12829 states and 13655 transitions. [2019-09-07 21:10:14,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1243 [2019-09-07 21:10:14,166 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:10:14,168 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:10:14,169 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:10:14,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:10:14,169 INFO L82 PathProgramCache]: Analyzing trace with hash 751002166, now seen corresponding path program 1 times [2019-09-07 21:10:14,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:10:14,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:10:14,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:10:14,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:10:14,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:10:14,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:10:15,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2692 backedges. 295 proven. 534 refuted. 0 times theorem prover too weak. 1863 trivial. 0 not checked. [2019-09-07 21:10:15,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:10:15,883 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-07 21:10:15,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:10:16,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:10:16,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 1643 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 21:10:16,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:10:16,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2692 backedges. 930 proven. 0 refuted. 0 times theorem prover too weak. 1762 trivial. 0 not checked. [2019-09-07 21:10:16,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 21:10:16,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2019-09-07 21:10:16,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 21:10:16,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 21:10:16,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-07 21:10:16,929 INFO L87 Difference]: Start difference. First operand 12829 states and 13655 transitions. Second operand 8 states. [2019-09-07 21:10:20,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:10:20,679 INFO L93 Difference]: Finished difference Result 31743 states and 35390 transitions. [2019-09-07 21:10:20,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 21:10:20,679 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1242 [2019-09-07 21:10:20,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:10:20,756 INFO L225 Difference]: With dead ends: 31743 [2019-09-07 21:10:20,757 INFO L226 Difference]: Without dead ends: 18924 [2019-09-07 21:10:20,797 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1261 GetRequests, 1248 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-09-07 21:10:20,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18924 states. [2019-09-07 21:10:21,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18924 to 17323. [2019-09-07 21:10:21,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17323 states. [2019-09-07 21:10:21,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17323 states to 17323 states and 18451 transitions. [2019-09-07 21:10:21,186 INFO L78 Accepts]: Start accepts. Automaton has 17323 states and 18451 transitions. Word has length 1242 [2019-09-07 21:10:21,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:10:21,187 INFO L475 AbstractCegarLoop]: Abstraction has 17323 states and 18451 transitions. [2019-09-07 21:10:21,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 21:10:21,187 INFO L276 IsEmpty]: Start isEmpty. Operand 17323 states and 18451 transitions. [2019-09-07 21:10:21,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1516 [2019-09-07 21:10:21,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:10:21,225 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:10:21,225 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:10:21,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:10:21,226 INFO L82 PathProgramCache]: Analyzing trace with hash -571063086, now seen corresponding path program 1 times [2019-09-07 21:10:21,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:10:21,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:10:21,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:10:21,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:10:21,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:10:21,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:10:25,773 INFO L134 CoverageAnalysis]: Checked inductivity of 4055 backedges. 1712 proven. 703 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2019-09-07 21:10:25,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:10:25,774 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-07 21:10:25,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:10:26,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:10:26,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 1954 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 21:10:26,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:10:26,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:10:27,497 INFO L134 CoverageAnalysis]: Checked inductivity of 4055 backedges. 2158 proven. 5 refuted. 0 times theorem prover too weak. 1892 trivial. 0 not checked. [2019-09-07 21:10:27,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:10:27,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 20 [2019-09-07 21:10:27,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 21:10:27,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 21:10:27,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2019-09-07 21:10:27,505 INFO L87 Difference]: Start difference. First operand 17323 states and 18451 transitions. Second operand 20 states. [2019-09-07 21:10:30,126 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-07 21:10:33,916 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-09-07 21:10:34,446 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-09-07 21:10:35,187 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-09-07 21:10:35,964 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-07 21:10:36,288 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-07 21:10:36,772 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-09-07 21:10:38,786 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-07 21:10:39,352 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-09-07 21:10:39,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:10:39,600 INFO L93 Difference]: Finished difference Result 34017 states and 36412 transitions. [2019-09-07 21:10:39,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-07 21:10:39,601 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1515 [2019-09-07 21:10:39,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:10:39,653 INFO L225 Difference]: With dead ends: 34017 [2019-09-07 21:10:39,653 INFO L226 Difference]: Without dead ends: 17374 [2019-09-07 21:10:39,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1592 GetRequests, 1538 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=544, Invalid=2536, Unknown=0, NotChecked=0, Total=3080 [2019-09-07 21:10:39,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17374 states. [2019-09-07 21:10:39,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17374 to 17294. [2019-09-07 21:10:39,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17294 states. [2019-09-07 21:10:39,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17294 states to 17294 states and 18322 transitions. [2019-09-07 21:10:39,965 INFO L78 Accepts]: Start accepts. Automaton has 17294 states and 18322 transitions. Word has length 1515 [2019-09-07 21:10:39,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:10:39,966 INFO L475 AbstractCegarLoop]: Abstraction has 17294 states and 18322 transitions. [2019-09-07 21:10:39,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 21:10:39,966 INFO L276 IsEmpty]: Start isEmpty. Operand 17294 states and 18322 transitions. [2019-09-07 21:10:40,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1663 [2019-09-07 21:10:40,005 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:10:40,006 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 21:10:40,007 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:10:40,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:10:40,007 INFO L82 PathProgramCache]: Analyzing trace with hash 572751171, now seen corresponding path program 1 times [2019-09-07 21:10:40,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:10:40,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:10:40,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:10:40,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:10:40,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:10:40,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:10:41,286 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2019-09-07 21:10:41,413 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-09-07 21:10:50,303 INFO L134 CoverageAnalysis]: Checked inductivity of 4497 backedges. 1089 proven. 2614 refuted. 0 times theorem prover too weak. 794 trivial. 0 not checked. [2019-09-07 21:10:50,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:10:50,304 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) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:10:50,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:10:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:10:50,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 2098 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 21:10:50,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:10:50,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:10:52,113 INFO L134 CoverageAnalysis]: Checked inductivity of 4497 backedges. 2144 proven. 2 refuted. 0 times theorem prover too weak. 2351 trivial. 0 not checked. [2019-09-07 21:10:52,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:10:52,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 8] total 29 [2019-09-07 21:10:52,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-07 21:10:52,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-07 21:10:52,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=722, Unknown=0, NotChecked=0, Total=812 [2019-09-07 21:10:52,122 INFO L87 Difference]: Start difference. First operand 17294 states and 18322 transitions. Second operand 29 states. [2019-09-07 21:10:58,313 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 50 [2019-09-07 21:10:59,108 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 40 [2019-09-07 21:10:59,602 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 44 [2019-09-07 21:11:00,485 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 48 [2019-09-07 21:11:02,417 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 39 [2019-09-07 21:11:02,949 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-07 21:11:03,380 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-09-07 21:11:03,721 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 45 [2019-09-07 21:11:04,466 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 37 [2019-09-07 21:11:07,389 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 45 [2019-09-07 21:11:08,032 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 48 [2019-09-07 21:11:09,341 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 60 [2019-09-07 21:11:09,539 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 42 [2019-09-07 21:11:10,122 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 51 [2019-09-07 21:11:12,828 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 56 [2019-09-07 21:11:12,981 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 51 [2019-09-07 21:11:14,360 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-09-07 21:11:14,718 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 40 [2019-09-07 21:11:15,115 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 67 [2019-09-07 21:11:15,324 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 61 [2019-09-07 21:11:15,554 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 68 [2019-09-07 21:11:15,735 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 63 [2019-09-07 21:11:15,907 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-07 21:11:17,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:11:17,237 INFO L93 Difference]: Finished difference Result 33967 states and 36867 transitions. [2019-09-07 21:11:17,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-09-07 21:11:17,238 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 1662 [2019-09-07 21:11:17,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:11:17,278 INFO L225 Difference]: With dead ends: 33967 [2019-09-07 21:11:17,278 INFO L226 Difference]: Without dead ends: 17694 [2019-09-07 21:11:17,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1864 GetRequests, 1742 SyntacticMatches, 2 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5212 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=2154, Invalid=12608, Unknown=0, NotChecked=0, Total=14762 [2019-09-07 21:11:17,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17694 states. [2019-09-07 21:11:17,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17694 to 17304. [2019-09-07 21:11:17,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17304 states. [2019-09-07 21:11:17,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17304 states to 17304 states and 18232 transitions. [2019-09-07 21:11:17,602 INFO L78 Accepts]: Start accepts. Automaton has 17304 states and 18232 transitions. Word has length 1662 [2019-09-07 21:11:17,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:11:17,603 INFO L475 AbstractCegarLoop]: Abstraction has 17304 states and 18232 transitions. [2019-09-07 21:11:17,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-07 21:11:17,603 INFO L276 IsEmpty]: Start isEmpty. Operand 17304 states and 18232 transitions. [2019-09-07 21:11:17,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1828 [2019-09-07 21:11:17,644 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:11:17,645 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:11:17,645 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:11:17,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:11:17,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1943057645, now seen corresponding path program 1 times [2019-09-07 21:11:17,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:11:17,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:11:17,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:11:17,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:11:17,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:11:17,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:11:27,526 INFO L134 CoverageAnalysis]: Checked inductivity of 5659 backedges. 2401 proven. 1404 refuted. 0 times theorem prover too weak. 1854 trivial. 0 not checked. [2019-09-07 21:11:27,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:11:27,527 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-07 21:11:27,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:11:27,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:11:27,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 2307 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 21:11:27,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:11:29,380 INFO L134 CoverageAnalysis]: Checked inductivity of 5659 backedges. 2759 proven. 2 refuted. 0 times theorem prover too weak. 2898 trivial. 0 not checked. [2019-09-07 21:11:29,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:11:29,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 5] total 24 [2019-09-07 21:11:29,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-07 21:11:29,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-07 21:11:29,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2019-09-07 21:11:29,390 INFO L87 Difference]: Start difference. First operand 17304 states and 18232 transitions. Second operand 24 states. [2019-09-07 21:11:32,970 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-09-07 21:11:34,481 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-09-07 21:11:36,657 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-07 21:11:37,054 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-07 21:11:37,457 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-07 21:11:37,735 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-09-07 21:11:39,004 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2019-09-07 21:11:39,844 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 37 [2019-09-07 21:11:42,955 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-07 21:11:46,312 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-07 21:11:47,488 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 43 [2019-09-07 21:11:47,635 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 33 [2019-09-07 21:11:48,452 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-09-07 21:11:49,514 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 42 [2019-09-07 21:11:49,884 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-07 21:11:51,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:11:51,192 INFO L93 Difference]: Finished difference Result 34287 states and 36039 transitions. [2019-09-07 21:11:51,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-09-07 21:11:51,192 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1827 [2019-09-07 21:11:51,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:11:51,232 INFO L225 Difference]: With dead ends: 34287 [2019-09-07 21:11:51,232 INFO L226 Difference]: Without dead ends: 17326 [2019-09-07 21:11:51,258 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1978 GetRequests, 1874 SyntacticMatches, 7 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3097 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=1546, Invalid=8156, Unknown=0, NotChecked=0, Total=9702 [2019-09-07 21:11:51,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17326 states. [2019-09-07 21:11:51,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17326 to 15457. [2019-09-07 21:11:51,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15457 states. [2019-09-07 21:11:51,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15457 states to 15457 states and 15854 transitions. [2019-09-07 21:11:51,468 INFO L78 Accepts]: Start accepts. Automaton has 15457 states and 15854 transitions. Word has length 1827 [2019-09-07 21:11:51,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:11:51,469 INFO L475 AbstractCegarLoop]: Abstraction has 15457 states and 15854 transitions. [2019-09-07 21:11:51,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-07 21:11:51,470 INFO L276 IsEmpty]: Start isEmpty. Operand 15457 states and 15854 transitions. [2019-09-07 21:11:51,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1977 [2019-09-07 21:11:51,507 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:11:51,508 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:11:51,509 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:11:51,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:11:51,509 INFO L82 PathProgramCache]: Analyzing trace with hash 57940676, now seen corresponding path program 1 times [2019-09-07 21:11:51,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:11:51,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:11:51,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:11:51,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:11:51,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:11:51,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:11:58,520 INFO L134 CoverageAnalysis]: Checked inductivity of 7457 backedges. 1739 proven. 1546 refuted. 0 times theorem prover too weak. 4172 trivial. 0 not checked. [2019-09-07 21:11:58,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:11:58,520 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-07 21:11:58,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:11:58,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:11:58,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 2508 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 21:11:58,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:11:58,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:58,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:58,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:58,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:58,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:58,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:58,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:58,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:58,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:58,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:58,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:58,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:58,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:58,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:58,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:58,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:58,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:58,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:58,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:58,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:58,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:58,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:58,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:58,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:58,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:58,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:11:59,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:12:00,577 INFO L134 CoverageAnalysis]: Checked inductivity of 7457 backedges. 4437 proven. 2 refuted. 0 times theorem prover too weak. 3018 trivial. 0 not checked. [2019-09-07 21:12:00,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:12:00,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5] total 17 [2019-09-07 21:12:00,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 21:12:00,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 21:12:00,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-09-07 21:12:00,588 INFO L87 Difference]: Start difference. First operand 15457 states and 15854 transitions. Second operand 17 states. [2019-09-07 21:12:16,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:12:16,360 INFO L93 Difference]: Finished difference Result 31939 states and 32847 transitions. [2019-09-07 21:12:16,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-07 21:12:16,361 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 1976 [2019-09-07 21:12:16,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:12:16,388 INFO L225 Difference]: With dead ends: 31939 [2019-09-07 21:12:16,388 INFO L226 Difference]: Without dead ends: 18853 [2019-09-07 21:12:16,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2059 GetRequests, 2006 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 762 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=586, Invalid=2384, Unknown=0, NotChecked=0, Total=2970 [2019-09-07 21:12:16,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18853 states. [2019-09-07 21:12:16,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18853 to 18508. [2019-09-07 21:12:16,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18508 states. [2019-09-07 21:12:16,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18508 states to 18508 states and 18983 transitions. [2019-09-07 21:12:16,611 INFO L78 Accepts]: Start accepts. Automaton has 18508 states and 18983 transitions. Word has length 1976 [2019-09-07 21:12:16,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:12:16,611 INFO L475 AbstractCegarLoop]: Abstraction has 18508 states and 18983 transitions. [2019-09-07 21:12:16,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 21:12:16,612 INFO L276 IsEmpty]: Start isEmpty. Operand 18508 states and 18983 transitions. [2019-09-07 21:12:16,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2015 [2019-09-07 21:12:16,654 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:12:16,655 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:12:16,655 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:12:16,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:12:16,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1739901066, now seen corresponding path program 1 times [2019-09-07 21:12:16,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:12:16,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:12:16,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:12:16,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:12:16,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:12:16,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:12:25,140 INFO L134 CoverageAnalysis]: Checked inductivity of 7666 backedges. 1368 proven. 4815 refuted. 0 times theorem prover too weak. 1483 trivial. 0 not checked. [2019-09-07 21:12:25,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:12:25,140 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) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:12:25,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:12:25,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:12:25,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 2541 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 21:12:25,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:12:25,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:12:27,669 INFO L134 CoverageAnalysis]: Checked inductivity of 7666 backedges. 4959 proven. 2 refuted. 0 times theorem prover too weak. 2705 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-07 21:12:27,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:12:27,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 5] total 26 [2019-09-07 21:12:27,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-07 21:12:27,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-07 21:12:27,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2019-09-07 21:12:27,682 INFO L87 Difference]: Start difference. First operand 18508 states and 18983 transitions. Second operand 26 states. [2019-09-07 21:12:55,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:12:55,482 INFO L93 Difference]: Finished difference Result 35749 states and 36820 transitions. [2019-09-07 21:12:55,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2019-09-07 21:12:55,482 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 2014 [2019-09-07 21:12:55,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:12:55,515 INFO L225 Difference]: With dead ends: 35749 [2019-09-07 21:12:55,516 INFO L226 Difference]: Without dead ends: 19610 [2019-09-07 21:12:55,534 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2250 GetRequests, 2088 SyntacticMatches, 11 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9349 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=2760, Invalid=20496, Unknown=0, NotChecked=0, Total=23256 [2019-09-07 21:12:55,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19610 states. [2019-09-07 21:12:55,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19610 to 17817. [2019-09-07 21:12:55,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17817 states. [2019-09-07 21:12:55,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17817 states to 17817 states and 18207 transitions. [2019-09-07 21:12:55,742 INFO L78 Accepts]: Start accepts. Automaton has 17817 states and 18207 transitions. Word has length 2014 [2019-09-07 21:12:55,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:12:55,743 INFO L475 AbstractCegarLoop]: Abstraction has 17817 states and 18207 transitions. [2019-09-07 21:12:55,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-07 21:12:55,743 INFO L276 IsEmpty]: Start isEmpty. Operand 17817 states and 18207 transitions. [2019-09-07 21:12:55,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2119 [2019-09-07 21:12:55,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:12:55,786 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:12:55,786 INFO L418 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:12:55,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:12:55,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1655874440, now seen corresponding path program 1 times [2019-09-07 21:12:55,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:12:55,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:12:55,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:12:55,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:12:55,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:12:55,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:13:03,518 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 2042 proven. 3470 refuted. 0 times theorem prover too weak. 2588 trivial. 0 not checked. [2019-09-07 21:13:03,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:13:03,519 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-07 21:13:03,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:13:03,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:13:04,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 2680 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 21:13:04,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:13:04,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:13:05,693 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 4265 proven. 2 refuted. 0 times theorem prover too weak. 3833 trivial. 0 not checked. [2019-09-07 21:13:05,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:13:05,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 5] total 25 [2019-09-07 21:13:05,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-07 21:13:05,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-07 21:13:05,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2019-09-07 21:13:05,702 INFO L87 Difference]: Start difference. First operand 17817 states and 18207 transitions. Second operand 25 states. [2019-09-07 21:13:07,698 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 37 [2019-09-07 21:13:12,985 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-09-07 21:13:14,681 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-07 21:13:21,701 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-07 21:13:29,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:13:29,081 INFO L93 Difference]: Finished difference Result 35331 states and 36167 transitions. [2019-09-07 21:13:29,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-07 21:13:29,082 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 2118 [2019-09-07 21:13:29,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:13:29,109 INFO L225 Difference]: With dead ends: 35331 [2019-09-07 21:13:29,109 INFO L226 Difference]: Without dead ends: 19548 [2019-09-07 21:13:29,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2283 GetRequests, 2177 SyntacticMatches, 7 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3479 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=1402, Invalid=8698, Unknown=0, NotChecked=0, Total=10100 [2019-09-07 21:13:29,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19548 states. [2019-09-07 21:13:29,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19548 to 18491. [2019-09-07 21:13:29,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18491 states. [2019-09-07 21:13:29,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18491 states to 18491 states and 18886 transitions. [2019-09-07 21:13:29,349 INFO L78 Accepts]: Start accepts. Automaton has 18491 states and 18886 transitions. Word has length 2118 [2019-09-07 21:13:29,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:13:29,350 INFO L475 AbstractCegarLoop]: Abstraction has 18491 states and 18886 transitions. [2019-09-07 21:13:29,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-07 21:13:29,350 INFO L276 IsEmpty]: Start isEmpty. Operand 18491 states and 18886 transitions. [2019-09-07 21:13:29,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2246 [2019-09-07 21:13:29,437 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:13:29,440 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:13:29,440 INFO L418 AbstractCegarLoop]: === Iteration 20 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:13:29,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:13:29,442 INFO L82 PathProgramCache]: Analyzing trace with hash -745988923, now seen corresponding path program 1 times [2019-09-07 21:13:29,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:13:29,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:13:29,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:13:29,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:13:29,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:13:29,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:13:30,842 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-07 21:13:38,165 INFO L134 CoverageAnalysis]: Checked inductivity of 10141 backedges. 2884 proven. 2290 refuted. 0 times theorem prover too weak. 4967 trivial. 0 not checked. [2019-09-07 21:13:38,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:13:38,166 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-07 21:13:38,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:13:38,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:13:38,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 2856 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:13:38,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:13:38,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:38,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:38,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:38,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:38,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:38,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:38,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:38,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:38,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:38,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:38,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:38,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:38,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:38,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:38,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:38,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:38,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:38,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:38,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:38,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:38,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:38,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:38,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:38,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:38,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:39,094 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 25 [2019-09-07 21:13:40,779 INFO L134 CoverageAnalysis]: Checked inductivity of 10141 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 10014 trivial. 0 not checked. [2019-09-07 21:13:40,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 21:13:40,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [15] total 16 [2019-09-07 21:13:40,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 21:13:40,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 21:13:40,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2019-09-07 21:13:40,788 INFO L87 Difference]: Start difference. First operand 18491 states and 18886 transitions. Second operand 16 states. [2019-09-07 21:13:47,135 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2019-09-07 21:13:47,812 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-07 21:13:48,913 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 46 [2019-09-07 21:13:58,761 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-07 21:13:59,330 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-09-07 21:13:59,681 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-07 21:14:06,338 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-07 21:14:06,711 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2019-09-07 21:14:08,137 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-07 21:14:08,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:14:08,434 INFO L93 Difference]: Finished difference Result 38067 states and 39009 transitions. [2019-09-07 21:14:08,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-07 21:14:08,435 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 2245 [2019-09-07 21:14:08,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:14:08,474 INFO L225 Difference]: With dead ends: 38067 [2019-09-07 21:14:08,474 INFO L226 Difference]: Without dead ends: 20934 [2019-09-07 21:14:08,493 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2330 GetRequests, 2278 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=577, Invalid=2285, Unknown=0, NotChecked=0, Total=2862 [2019-09-07 21:14:08,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20934 states. [2019-09-07 21:14:08,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20934 to 19167. [2019-09-07 21:14:08,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19167 states. [2019-09-07 21:14:08,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19167 states to 19167 states and 19581 transitions. [2019-09-07 21:14:08,694 INFO L78 Accepts]: Start accepts. Automaton has 19167 states and 19581 transitions. Word has length 2245 [2019-09-07 21:14:08,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:14:08,695 INFO L475 AbstractCegarLoop]: Abstraction has 19167 states and 19581 transitions. [2019-09-07 21:14:08,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 21:14:08,696 INFO L276 IsEmpty]: Start isEmpty. Operand 19167 states and 19581 transitions. [2019-09-07 21:14:08,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2471 [2019-09-07 21:14:08,738 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:14:08,739 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:14:08,739 INFO L418 AbstractCegarLoop]: === Iteration 21 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:14:08,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:14:08,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1751473607, now seen corresponding path program 1 times [2019-09-07 21:14:08,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:14:08,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:14:08,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:14:08,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:14:08,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:14:08,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:14:17,978 INFO L134 CoverageAnalysis]: Checked inductivity of 10329 backedges. 3599 proven. 2489 refuted. 0 times theorem prover too weak. 4241 trivial. 0 not checked. [2019-09-07 21:14:17,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:14:17,979 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-07 21:14:17,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:14:18,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:14:18,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 3087 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 21:14:18,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:14:20,452 INFO L134 CoverageAnalysis]: Checked inductivity of 10329 backedges. 3929 proven. 2 refuted. 0 times theorem prover too weak. 6398 trivial. 0 not checked. [2019-09-07 21:14:20,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:14:20,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 5] total 16 [2019-09-07 21:14:20,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 21:14:20,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 21:14:20,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-09-07 21:14:20,462 INFO L87 Difference]: Start difference. First operand 19167 states and 19581 transitions. Second operand 16 states. [2019-09-07 21:14:33,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:14:33,643 INFO L93 Difference]: Finished difference Result 36993 states and 37810 transitions. [2019-09-07 21:14:33,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-07 21:14:33,646 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 2470 [2019-09-07 21:14:33,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:14:33,687 INFO L225 Difference]: With dead ends: 36993 [2019-09-07 21:14:33,688 INFO L226 Difference]: Without dead ends: 19523 [2019-09-07 21:14:33,705 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2574 GetRequests, 2512 SyntacticMatches, 7 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 883 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=571, Invalid=2621, Unknown=0, NotChecked=0, Total=3192 [2019-09-07 21:14:33,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19523 states. [2019-09-07 21:14:33,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19523 to 18823. [2019-09-07 21:14:33,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18823 states. [2019-09-07 21:14:33,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18823 states to 18823 states and 19186 transitions. [2019-09-07 21:14:33,892 INFO L78 Accepts]: Start accepts. Automaton has 18823 states and 19186 transitions. Word has length 2470 [2019-09-07 21:14:33,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:14:33,893 INFO L475 AbstractCegarLoop]: Abstraction has 18823 states and 19186 transitions. [2019-09-07 21:14:33,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 21:14:33,894 INFO L276 IsEmpty]: Start isEmpty. Operand 18823 states and 19186 transitions. [2019-09-07 21:14:33,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2636 [2019-09-07 21:14:33,940 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:14:33,941 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:14:33,942 INFO L418 AbstractCegarLoop]: === Iteration 22 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:14:33,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:14:33,943 INFO L82 PathProgramCache]: Analyzing trace with hash 676269559, now seen corresponding path program 1 times [2019-09-07 21:14:33,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:14:33,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:14:33,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:14:33,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:14:33,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:14:34,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:14:47,472 INFO L134 CoverageAnalysis]: Checked inductivity of 12079 backedges. 1917 proven. 6682 refuted. 0 times theorem prover too weak. 3480 trivial. 0 not checked. [2019-09-07 21:14:47,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:14:47,472 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-07 21:14:47,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:14:48,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:14:48,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 3291 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 21:14:48,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:14:48,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:14:48,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:14:48,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:14:48,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:14:48,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:14:48,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:14:48,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:14:48,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:14:48,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:14:48,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:14:48,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:14:48,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:14:48,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:14:48,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:14:48,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:14:48,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:14:48,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:14:48,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:14:48,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:14:48,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:14:48,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:14:48,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:14:48,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:14:48,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:14:48,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:14:48,476 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 22 [2019-09-07 21:14:48,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:14:51,360 INFO L134 CoverageAnalysis]: Checked inductivity of 12079 backedges. 4269 proven. 2 refuted. 0 times theorem prover too weak. 7808 trivial. 0 not checked. [2019-09-07 21:14:51,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:14:51,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 5] total 31 [2019-09-07 21:14:51,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-07 21:14:51,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-07 21:14:51,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=822, Unknown=0, NotChecked=0, Total=930 [2019-09-07 21:14:51,370 INFO L87 Difference]: Start difference. First operand 18823 states and 19186 transitions. Second operand 31 states. [2019-09-07 21:15:11,891 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 56 [2019-09-07 21:15:17,384 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-09-07 21:15:19,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:15:19,271 INFO L93 Difference]: Finished difference Result 38036 states and 38857 transitions. [2019-09-07 21:15:19,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-07 21:15:19,275 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 2635 [2019-09-07 21:15:19,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:15:19,312 INFO L225 Difference]: With dead ends: 38036 [2019-09-07 21:15:19,312 INFO L226 Difference]: Without dead ends: 20910 [2019-09-07 21:15:19,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2798 GetRequests, 2687 SyntacticMatches, 3 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4138 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=1609, Invalid=10381, Unknown=0, NotChecked=0, Total=11990 [2019-09-07 21:15:19,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20910 states. [2019-09-07 21:15:19,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20910 to 19827. [2019-09-07 21:15:19,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19827 states. [2019-09-07 21:15:19,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19827 states to 19827 states and 20199 transitions. [2019-09-07 21:15:19,520 INFO L78 Accepts]: Start accepts. Automaton has 19827 states and 20199 transitions. Word has length 2635 [2019-09-07 21:15:19,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:15:19,522 INFO L475 AbstractCegarLoop]: Abstraction has 19827 states and 20199 transitions. [2019-09-07 21:15:19,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-07 21:15:19,522 INFO L276 IsEmpty]: Start isEmpty. Operand 19827 states and 20199 transitions. [2019-09-07 21:15:19,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2884 [2019-09-07 21:15:19,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:15:19,577 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:15:19,577 INFO L418 AbstractCegarLoop]: === Iteration 23 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:15:19,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:15:19,577 INFO L82 PathProgramCache]: Analyzing trace with hash 948438729, now seen corresponding path program 1 times [2019-09-07 21:15:19,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:15:19,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:15:19,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:15:19,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:15:19,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:15:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:15:23,711 INFO L134 CoverageAnalysis]: Checked inductivity of 14611 backedges. 1733 proven. 314 refuted. 0 times theorem prover too weak. 12564 trivial. 0 not checked. [2019-09-07 21:15:23,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:15:23,711 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-07 21:15:23,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:15:24,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:15:24,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 3541 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:15:24,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:15:24,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:15:24,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:15:24,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:15:24,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:15:24,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:15:24,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:15:24,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:15:27,213 INFO L134 CoverageAnalysis]: Checked inductivity of 14611 backedges. 6082 proven. 2 refuted. 0 times theorem prover too weak. 8527 trivial. 0 not checked. [2019-09-07 21:15:27,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:15:27,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-09-07 21:15:27,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 21:15:27,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 21:15:27,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 21:15:27,222 INFO L87 Difference]: Start difference. First operand 19827 states and 20199 transitions. Second operand 8 states. [2019-09-07 21:15:37,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:15:37,118 INFO L93 Difference]: Finished difference Result 39653 states and 40418 transitions. [2019-09-07 21:15:37,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 21:15:37,119 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 2883 [2019-09-07 21:15:37,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:15:37,150 INFO L225 Difference]: With dead ends: 39653 [2019-09-07 21:15:37,150 INFO L226 Difference]: Without dead ends: 21525 [2019-09-07 21:15:37,168 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2893 GetRequests, 2884 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-09-07 21:15:37,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21525 states. [2019-09-07 21:15:37,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21525 to 20169. [2019-09-07 21:15:37,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20169 states. [2019-09-07 21:15:37,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20169 states to 20169 states and 20531 transitions. [2019-09-07 21:15:37,384 INFO L78 Accepts]: Start accepts. Automaton has 20169 states and 20531 transitions. Word has length 2883 [2019-09-07 21:15:37,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:15:37,386 INFO L475 AbstractCegarLoop]: Abstraction has 20169 states and 20531 transitions. [2019-09-07 21:15:37,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 21:15:37,387 INFO L276 IsEmpty]: Start isEmpty. Operand 20169 states and 20531 transitions. [2019-09-07 21:15:37,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2950 [2019-09-07 21:15:37,449 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:15:37,450 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:15:37,450 INFO L418 AbstractCegarLoop]: === Iteration 24 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:15:37,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:15:37,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1445004517, now seen corresponding path program 1 times [2019-09-07 21:15:37,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:15:37,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:15:37,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:15:37,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:15:37,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:15:37,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:15:44,140 INFO L134 CoverageAnalysis]: Checked inductivity of 15153 backedges. 1530 proven. 2480 refuted. 0 times theorem prover too weak. 11143 trivial. 0 not checked. [2019-09-07 21:15:44,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:15:44,141 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-07 21:15:44,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:15:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:15:44,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 3607 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 21:15:44,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:15:44,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:15:44,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:15:44,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:15:46,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:15:49,725 INFO L134 CoverageAnalysis]: Checked inductivity of 15153 backedges. 10282 proven. 10 refuted. 0 times theorem prover too weak. 4861 trivial. 0 not checked. [2019-09-07 21:15:49,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:15:49,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2019-09-07 21:15:49,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 21:15:49,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 21:15:49,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=195, Unknown=1, NotChecked=0, Total=240 [2019-09-07 21:15:49,741 INFO L87 Difference]: Start difference. First operand 20169 states and 20531 transitions. Second operand 16 states. [2019-09-07 21:15:59,053 WARN L188 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 44 DAG size of output: 34