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/Problem17_label51.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 22:05:42,457 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 22:05:42,459 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 22:05:42,471 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 22:05:42,471 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 22:05:42,472 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 22:05:42,473 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 22:05:42,477 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 22:05:42,481 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 22:05:42,482 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 22:05:42,483 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 22:05:42,484 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 22:05:42,485 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 22:05:42,486 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 22:05:42,487 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 22:05:42,490 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 22:05:42,490 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 22:05:42,491 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 22:05:42,496 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 22:05:42,499 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 22:05:42,503 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 22:05:42,505 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 22:05:42,507 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 22:05:42,508 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 22:05:42,510 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 22:05:42,510 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 22:05:42,510 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 22:05:42,513 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 22:05:42,513 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 22:05:42,514 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 22:05:42,517 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 22:05:42,518 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 22:05:42,519 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 22:05:42,520 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 22:05:42,523 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 22:05:42,524 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 22:05:42,524 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 22:05:42,525 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 22:05:42,525 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 22:05:42,526 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 22:05:42,526 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 22:05:42,528 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 22:05:42,548 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 22:05:42,548 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 22:05:42,549 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 22:05:42,549 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 22:05:42,550 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 22:05:42,550 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 22:05:42,550 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 22:05:42,550 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 22:05:42,551 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 22:05:42,551 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 22:05:42,551 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 22:05:42,551 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 22:05:42,551 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 22:05:42,552 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 22:05:42,552 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 22:05:42,552 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 22:05:42,552 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 22:05:42,552 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 22:05:42,553 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 22:05:42,553 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 22:05:42,553 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 22:05:42,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 22:05:42,554 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 22:05:42,554 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 22:05:42,554 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 22:05:42,554 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 22:05:42,555 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 22:05:42,555 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 22:05:42,555 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 22:05:42,583 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 22:05:42,600 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 22:05:42,604 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 22:05:42,605 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 22:05:42,606 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 22:05:42,607 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label51.c [2019-09-07 22:05:42,676 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed00e51a2/c1e5ad6b1d0f46ca9aa3b5ca17925137/FLAGc146faf42 [2019-09-07 22:05:43,412 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 22:05:43,413 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label51.c [2019-09-07 22:05:43,437 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed00e51a2/c1e5ad6b1d0f46ca9aa3b5ca17925137/FLAGc146faf42 [2019-09-07 22:05:43,501 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed00e51a2/c1e5ad6b1d0f46ca9aa3b5ca17925137 [2019-09-07 22:05:43,510 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 22:05:43,511 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 22:05:43,513 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 22:05:43,513 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 22:05:43,516 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 22:05:43,517 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:05:43" (1/1) ... [2019-09-07 22:05:43,520 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62cb8da3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:05:43, skipping insertion in model container [2019-09-07 22:05:43,521 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:05:43" (1/1) ... [2019-09-07 22:05:43,528 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 22:05:43,634 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 22:05:44,978 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 22:05:44,992 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 22:05:45,365 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 22:05:45,387 INFO L192 MainTranslator]: Completed translation [2019-09-07 22:05:45,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:05:45 WrapperNode [2019-09-07 22:05:45,388 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 22:05:45,388 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 22:05:45,389 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 22:05:45,389 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 22:05:45,401 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:05:45" (1/1) ... [2019-09-07 22:05:45,402 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:05:45" (1/1) ... [2019-09-07 22:05:45,443 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:05:45" (1/1) ... [2019-09-07 22:05:45,443 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:05:45" (1/1) ... [2019-09-07 22:05:45,593 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:05:45" (1/1) ... [2019-09-07 22:05:45,625 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:05:45" (1/1) ... [2019-09-07 22:05:45,646 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:05:45" (1/1) ... [2019-09-07 22:05:45,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 22:05:45,664 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 22:05:45,665 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 22:05:45,665 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 22:05:45,666 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:05:45" (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 22:05:45,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 22:05:45,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 22:05:45,743 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 22:05:45,744 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 22:05:45,745 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 22:05:45,745 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 22:05:45,745 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 22:05:45,746 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 22:05:45,746 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 22:05:45,746 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 22:05:45,746 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 22:05:45,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 22:05:45,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 22:05:49,978 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 22:05:49,978 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 22:05:49,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:05:49 BoogieIcfgContainer [2019-09-07 22:05:49,982 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 22:05:49,983 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 22:05:49,984 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 22:05:49,990 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 22:05:49,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 10:05:43" (1/3) ... [2019-09-07 22:05:49,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ab3aac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:05:49, skipping insertion in model container [2019-09-07 22:05:49,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:05:45" (2/3) ... [2019-09-07 22:05:49,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ab3aac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:05:49, skipping insertion in model container [2019-09-07 22:05:49,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:05:49" (3/3) ... [2019-09-07 22:05:49,998 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem17_label51.c [2019-09-07 22:05:50,010 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 22:05:50,022 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 22:05:50,039 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 22:05:50,089 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 22:05:50,090 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 22:05:50,091 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 22:05:50,091 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 22:05:50,091 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 22:05:50,091 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 22:05:50,091 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 22:05:50,092 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 22:05:50,092 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 22:05:50,135 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states. [2019-09-07 22:05:50,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-07 22:05:50,145 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:05:50,146 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:05:50,148 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:05:50,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:05:50,156 INFO L82 PathProgramCache]: Analyzing trace with hash 480569, now seen corresponding path program 1 times [2019-09-07 22:05:50,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:05:50,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:05:50,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:05:50,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:05:50,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:05:50,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:05:50,499 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 22:05:50,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:05:50,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 22:05:50,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 22:05:50,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 22:05:50,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 22:05:50,524 INFO L87 Difference]: Start difference. First operand 603 states. Second operand 4 states. [2019-09-07 22:05:56,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:05:56,278 INFO L93 Difference]: Finished difference Result 2160 states and 4005 transitions. [2019-09-07 22:05:56,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 22:05:56,280 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-09-07 22:05:56,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:05:56,311 INFO L225 Difference]: With dead ends: 2160 [2019-09-07 22:05:56,311 INFO L226 Difference]: Without dead ends: 1476 [2019-09-07 22:05:56,322 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 22:05:56,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2019-09-07 22:05:56,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 990. [2019-09-07 22:05:56,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 990 states. [2019-09-07 22:05:56,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1715 transitions. [2019-09-07 22:05:56,450 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1715 transitions. Word has length 43 [2019-09-07 22:05:56,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:05:56,451 INFO L475 AbstractCegarLoop]: Abstraction has 990 states and 1715 transitions. [2019-09-07 22:05:56,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 22:05:56,451 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1715 transitions. [2019-09-07 22:05:56,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-07 22:05:56,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:05:56,457 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 22:05:56,457 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:05:56,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:05:56,458 INFO L82 PathProgramCache]: Analyzing trace with hash -452916497, now seen corresponding path program 1 times [2019-09-07 22:05:56,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:05:56,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:05:56,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:05:56,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:05:56,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:05:56,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:05:56,704 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:05:56,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:05:56,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 22:05:56,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 22:05:56,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 22:05:56,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 22:05:56,707 INFO L87 Difference]: Start difference. First operand 990 states and 1715 transitions. Second operand 5 states. [2019-09-07 22:06:00,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:06:00,986 INFO L93 Difference]: Finished difference Result 2903 states and 5092 transitions. [2019-09-07 22:06:00,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 22:06:00,987 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2019-09-07 22:06:00,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:06:01,001 INFO L225 Difference]: With dead ends: 2903 [2019-09-07 22:06:01,001 INFO L226 Difference]: Without dead ends: 1919 [2019-09-07 22:06:01,005 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 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 22:06:01,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1919 states. [2019-09-07 22:06:01,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1919 to 1895. [2019-09-07 22:06:01,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1895 states. [2019-09-07 22:06:01,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1895 states to 1895 states and 2965 transitions. [2019-09-07 22:06:01,069 INFO L78 Accepts]: Start accepts. Automaton has 1895 states and 2965 transitions. Word has length 114 [2019-09-07 22:06:01,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:06:01,069 INFO L475 AbstractCegarLoop]: Abstraction has 1895 states and 2965 transitions. [2019-09-07 22:06:01,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 22:06:01,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1895 states and 2965 transitions. [2019-09-07 22:06:01,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-07 22:06:01,073 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:06:01,073 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 22:06:01,074 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:06:01,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:06:01,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1164800257, now seen corresponding path program 1 times [2019-09-07 22:06:01,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:06:01,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:06:01,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:06:01,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:06:01,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:06:01,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:06:01,178 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:06:01,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:06:01,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 22:06:01,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 22:06:01,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 22:06:01,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 22:06:01,180 INFO L87 Difference]: Start difference. First operand 1895 states and 2965 transitions. Second operand 3 states. [2019-09-07 22:06:04,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:06:04,387 INFO L93 Difference]: Finished difference Result 5557 states and 8868 transitions. [2019-09-07 22:06:04,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 22:06:04,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-09-07 22:06:04,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:06:04,412 INFO L225 Difference]: With dead ends: 5557 [2019-09-07 22:06:04,413 INFO L226 Difference]: Without dead ends: 3668 [2019-09-07 22:06:04,418 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 22:06:04,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3668 states. [2019-09-07 22:06:04,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3668 to 3665. [2019-09-07 22:06:04,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3665 states. [2019-09-07 22:06:04,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3665 states to 3665 states and 5192 transitions. [2019-09-07 22:06:04,517 INFO L78 Accepts]: Start accepts. Automaton has 3665 states and 5192 transitions. Word has length 117 [2019-09-07 22:06:04,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:06:04,518 INFO L475 AbstractCegarLoop]: Abstraction has 3665 states and 5192 transitions. [2019-09-07 22:06:04,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 22:06:04,518 INFO L276 IsEmpty]: Start isEmpty. Operand 3665 states and 5192 transitions. [2019-09-07 22:06:04,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-07 22:06:04,523 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:06:04,523 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2019-09-07 22:06:04,523 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:06:04,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:06:04,524 INFO L82 PathProgramCache]: Analyzing trace with hash 396395147, now seen corresponding path program 1 times [2019-09-07 22:06:04,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:06:04,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:06:04,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:06:04,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:06:04,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:06:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:06:04,767 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:06:04,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:06:04,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-07 22:06:04,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 22:06:04,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 22:06:04,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-07 22:06:04,770 INFO L87 Difference]: Start difference. First operand 3665 states and 5192 transitions. Second operand 7 states. [2019-09-07 22:06:16,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:06:16,867 INFO L93 Difference]: Finished difference Result 12617 states and 19512 transitions. [2019-09-07 22:06:16,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 22:06:16,867 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 144 [2019-09-07 22:06:16,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:06:16,934 INFO L225 Difference]: With dead ends: 12617 [2019-09-07 22:06:16,934 INFO L226 Difference]: Without dead ends: 8958 [2019-09-07 22:06:16,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-09-07 22:06:16,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8958 states. [2019-09-07 22:06:17,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8958 to 8859. [2019-09-07 22:06:17,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8859 states. [2019-09-07 22:06:17,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8859 states to 8859 states and 12662 transitions. [2019-09-07 22:06:17,243 INFO L78 Accepts]: Start accepts. Automaton has 8859 states and 12662 transitions. Word has length 144 [2019-09-07 22:06:17,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:06:17,244 INFO L475 AbstractCegarLoop]: Abstraction has 8859 states and 12662 transitions. [2019-09-07 22:06:17,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 22:06:17,245 INFO L276 IsEmpty]: Start isEmpty. Operand 8859 states and 12662 transitions. [2019-09-07 22:06:17,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-07 22:06:17,254 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:06:17,255 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:06:17,255 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:06:17,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:06:17,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1684892022, now seen corresponding path program 1 times [2019-09-07 22:06:17,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:06:17,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:06:17,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:06:17,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:06:17,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:06:17,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:06:17,425 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:06:17,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:06:17,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 22:06:17,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 22:06:17,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 22:06:17,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 22:06:17,428 INFO L87 Difference]: Start difference. First operand 8859 states and 12662 transitions. Second operand 5 states. [2019-09-07 22:06:22,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:06:22,485 INFO L93 Difference]: Finished difference Result 24547 states and 37836 transitions. [2019-09-07 22:06:22,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 22:06:22,486 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2019-09-07 22:06:22,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:06:22,590 INFO L225 Difference]: With dead ends: 24547 [2019-09-07 22:06:22,590 INFO L226 Difference]: Without dead ends: 15694 [2019-09-07 22:06:22,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 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 22:06:22,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15694 states. [2019-09-07 22:06:23,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15694 to 15482. [2019-09-07 22:06:23,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15482 states. [2019-09-07 22:06:23,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15482 states to 15482 states and 21452 transitions. [2019-09-07 22:06:23,101 INFO L78 Accepts]: Start accepts. Automaton has 15482 states and 21452 transitions. Word has length 156 [2019-09-07 22:06:23,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:06:23,102 INFO L475 AbstractCegarLoop]: Abstraction has 15482 states and 21452 transitions. [2019-09-07 22:06:23,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 22:06:23,102 INFO L276 IsEmpty]: Start isEmpty. Operand 15482 states and 21452 transitions. [2019-09-07 22:06:23,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-07 22:06:23,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:06:23,108 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:06:23,108 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:06:23,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:06:23,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1020283855, now seen corresponding path program 1 times [2019-09-07 22:06:23,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:06:23,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:06:23,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:06:23,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:06:23,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:06:23,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:06:23,397 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 106 proven. 43 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-07 22:06:23,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:06:23,397 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 22:06:23,415 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 22:06:23,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:06:23,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 22:06:23,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:06:23,661 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 22:06:23,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 22:06:23,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2019-09-07 22:06:23,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 22:06:23,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 22:06:23,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-09-07 22:06:23,813 INFO L87 Difference]: Start difference. First operand 15482 states and 21452 transitions. Second operand 8 states. [2019-09-07 22:06:32,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:06:32,627 INFO L93 Difference]: Finished difference Result 35681 states and 53080 transitions. [2019-09-07 22:06:32,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 22:06:32,628 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 213 [2019-09-07 22:06:32,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:06:32,762 INFO L225 Difference]: With dead ends: 35681 [2019-09-07 22:06:32,762 INFO L226 Difference]: Without dead ends: 20205 [2019-09-07 22:06:32,815 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-09-07 22:06:32,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20205 states. [2019-09-07 22:06:33,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20205 to 17917. [2019-09-07 22:06:33,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17917 states. [2019-09-07 22:06:33,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17917 states to 17917 states and 27198 transitions. [2019-09-07 22:06:33,456 INFO L78 Accepts]: Start accepts. Automaton has 17917 states and 27198 transitions. Word has length 213 [2019-09-07 22:06:33,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:06:33,457 INFO L475 AbstractCegarLoop]: Abstraction has 17917 states and 27198 transitions. [2019-09-07 22:06:33,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 22:06:33,457 INFO L276 IsEmpty]: Start isEmpty. Operand 17917 states and 27198 transitions. [2019-09-07 22:06:33,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-09-07 22:06:33,464 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:06:33,468 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:06:33,468 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:06:33,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:06:33,469 INFO L82 PathProgramCache]: Analyzing trace with hash -358083898, now seen corresponding path program 1 times [2019-09-07 22:06:33,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:06:33,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:06:33,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:06:33,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:06:33,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:06:33,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:06:33,686 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-09-07 22:06:33,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:06:33,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 22:06:33,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 22:06:33,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 22:06:33,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 22:06:33,689 INFO L87 Difference]: Start difference. First operand 17917 states and 27198 transitions. Second operand 4 states. [2019-09-07 22:06:40,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:06:40,651 INFO L93 Difference]: Finished difference Result 51327 states and 85524 transitions. [2019-09-07 22:06:40,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 22:06:40,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 223 [2019-09-07 22:06:40,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:06:40,796 INFO L225 Difference]: With dead ends: 51327 [2019-09-07 22:06:40,797 INFO L226 Difference]: Without dead ends: 33416 [2019-09-07 22:06:40,874 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 22:06:40,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33416 states. [2019-09-07 22:06:41,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33416 to 30732. [2019-09-07 22:06:41,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30732 states. [2019-09-07 22:06:41,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30732 states to 30732 states and 46696 transitions. [2019-09-07 22:06:41,680 INFO L78 Accepts]: Start accepts. Automaton has 30732 states and 46696 transitions. Word has length 223 [2019-09-07 22:06:41,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:06:41,682 INFO L475 AbstractCegarLoop]: Abstraction has 30732 states and 46696 transitions. [2019-09-07 22:06:41,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 22:06:41,682 INFO L276 IsEmpty]: Start isEmpty. Operand 30732 states and 46696 transitions. [2019-09-07 22:06:41,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-07 22:06:41,693 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:06:41,693 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:06:41,693 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:06:41,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:06:41,694 INFO L82 PathProgramCache]: Analyzing trace with hash -777779232, now seen corresponding path program 1 times [2019-09-07 22:06:41,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:06:41,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:06:41,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:06:41,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:06:41,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:06:41,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:06:42,009 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:06:42,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:06:42,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 22:06:42,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 22:06:42,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 22:06:42,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 22:06:42,011 INFO L87 Difference]: Start difference. First operand 30732 states and 46696 transitions. Second operand 6 states. [2019-09-07 22:06:51,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:06:51,017 INFO L93 Difference]: Finished difference Result 80876 states and 156067 transitions. [2019-09-07 22:06:51,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 22:06:51,017 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 245 [2019-09-07 22:06:51,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:06:51,440 INFO L225 Difference]: With dead ends: 80876 [2019-09-07 22:06:51,441 INFO L226 Difference]: Without dead ends: 50150 [2019-09-07 22:06:51,535 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-09-07 22:06:51,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50150 states. [2019-09-07 22:06:53,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50150 to 48263. [2019-09-07 22:06:53,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48263 states. [2019-09-07 22:06:53,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48263 states to 48263 states and 78968 transitions. [2019-09-07 22:06:53,775 INFO L78 Accepts]: Start accepts. Automaton has 48263 states and 78968 transitions. Word has length 245 [2019-09-07 22:06:53,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:06:53,775 INFO L475 AbstractCegarLoop]: Abstraction has 48263 states and 78968 transitions. [2019-09-07 22:06:53,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 22:06:53,776 INFO L276 IsEmpty]: Start isEmpty. Operand 48263 states and 78968 transitions. [2019-09-07 22:06:53,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-09-07 22:06:53,802 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:06:53,802 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:06:53,803 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:06:53,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:06:53,803 INFO L82 PathProgramCache]: Analyzing trace with hash -435928406, now seen corresponding path program 1 times [2019-09-07 22:06:53,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:06:53,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:06:53,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:06:53,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:06:53,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:06:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:06:54,125 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 274 proven. 20 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-09-07 22:06:54,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:06:54,125 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 22:06:54,141 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 22:06:54,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:06:54,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 22:06:54,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:06:54,341 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 279 proven. 2 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-09-07 22:06:54,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:06:54,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 22:06:54,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 22:06:54,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 22:06:54,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 22:06:54,355 INFO L87 Difference]: Start difference. First operand 48263 states and 78968 transitions. Second operand 9 states. [2019-09-07 22:07:01,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:07:01,499 INFO L93 Difference]: Finished difference Result 101478 states and 181627 transitions. [2019-09-07 22:07:01,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 22:07:01,499 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 309 [2019-09-07 22:07:01,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:07:01,810 INFO L225 Difference]: With dead ends: 101478 [2019-09-07 22:07:01,810 INFO L226 Difference]: Without dead ends: 53654 [2019-09-07 22:07:02,008 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-09-07 22:07:02,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53654 states. [2019-09-07 22:07:04,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53654 to 42387. [2019-09-07 22:07:04,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42387 states. [2019-09-07 22:07:05,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42387 states to 42387 states and 54490 transitions. [2019-09-07 22:07:05,064 INFO L78 Accepts]: Start accepts. Automaton has 42387 states and 54490 transitions. Word has length 309 [2019-09-07 22:07:05,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:07:05,067 INFO L475 AbstractCegarLoop]: Abstraction has 42387 states and 54490 transitions. [2019-09-07 22:07:05,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 22:07:05,067 INFO L276 IsEmpty]: Start isEmpty. Operand 42387 states and 54490 transitions. [2019-09-07 22:07:05,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-09-07 22:07:05,103 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:07:05,104 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:07:05,105 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:07:05,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:07:05,105 INFO L82 PathProgramCache]: Analyzing trace with hash -279224494, now seen corresponding path program 1 times [2019-09-07 22:07:05,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:07:05,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:07:05,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:07:05,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:07:05,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:07:05,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:07:05,799 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:07:05,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:07:05,800 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:07:05,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:07:05,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:07:05,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 22:07:05,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:07:06,331 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:07:06,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:07:06,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2019-09-07 22:07:06,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 22:07:06,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 22:07:06,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-07 22:07:06,354 INFO L87 Difference]: Start difference. First operand 42387 states and 54490 transitions. Second operand 11 states. [2019-09-07 22:07:29,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:07:29,657 INFO L93 Difference]: Finished difference Result 117731 states and 158195 transitions. [2019-09-07 22:07:29,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-07 22:07:29,657 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 390 [2019-09-07 22:07:29,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:07:29,926 INFO L225 Difference]: With dead ends: 117731 [2019-09-07 22:07:29,926 INFO L226 Difference]: Without dead ends: 75783 [2019-09-07 22:07:30,007 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=431, Invalid=1731, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 22:07:30,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75783 states. [2019-09-07 22:07:31,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75783 to 63386. [2019-09-07 22:07:31,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63386 states. [2019-09-07 22:07:31,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63386 states to 63386 states and 83313 transitions. [2019-09-07 22:07:31,351 INFO L78 Accepts]: Start accepts. Automaton has 63386 states and 83313 transitions. Word has length 390 [2019-09-07 22:07:31,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:07:31,352 INFO L475 AbstractCegarLoop]: Abstraction has 63386 states and 83313 transitions. [2019-09-07 22:07:31,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 22:07:31,352 INFO L276 IsEmpty]: Start isEmpty. Operand 63386 states and 83313 transitions. [2019-09-07 22:07:31,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2019-09-07 22:07:31,384 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:07:31,385 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:07:31,385 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:07:31,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:07:31,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1710889229, now seen corresponding path program 1 times [2019-09-07 22:07:31,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:07:31,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:07:31,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:07:31,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:07:31,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:07:31,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:07:32,205 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 76 proven. 2 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-07 22:07:32,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:07:32,205 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:07:32,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:07:32,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:07:32,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 22:07:32,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:07:32,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:07:32,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:07:32,711 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 76 proven. 2 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-07 22:07:32,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:07:32,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-09-07 22:07:32,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 22:07:32,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 22:07:32,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-07 22:07:32,726 INFO L87 Difference]: Start difference. First operand 63386 states and 83313 transitions. Second operand 10 states. [2019-09-07 22:07:46,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:07:46,223 INFO L93 Difference]: Finished difference Result 158351 states and 213673 transitions. [2019-09-07 22:07:46,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 22:07:46,224 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 418 [2019-09-07 22:07:46,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:07:46,552 INFO L225 Difference]: With dead ends: 158351 [2019-09-07 22:07:46,552 INFO L226 Difference]: Without dead ends: 95404 [2019-09-07 22:07:46,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 417 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2019-09-07 22:07:46,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95404 states. [2019-09-07 22:07:48,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95404 to 78973. [2019-09-07 22:07:48,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78973 states. [2019-09-07 22:07:48,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78973 states to 78973 states and 101854 transitions. [2019-09-07 22:07:48,781 INFO L78 Accepts]: Start accepts. Automaton has 78973 states and 101854 transitions. Word has length 418 [2019-09-07 22:07:48,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:07:48,782 INFO L475 AbstractCegarLoop]: Abstraction has 78973 states and 101854 transitions. [2019-09-07 22:07:48,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 22:07:48,782 INFO L276 IsEmpty]: Start isEmpty. Operand 78973 states and 101854 transitions. [2019-09-07 22:07:48,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2019-09-07 22:07:48,853 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:07:48,854 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:07:48,854 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:07:48,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:07:48,854 INFO L82 PathProgramCache]: Analyzing trace with hash -703345132, now seen corresponding path program 1 times [2019-09-07 22:07:48,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:07:48,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:07:48,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:07:48,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:07:48,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:07:48,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:07:49,256 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2019-09-07 22:07:49,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:07:49,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 22:07:49,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 22:07:49,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 22:07:49,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 22:07:49,258 INFO L87 Difference]: Start difference. First operand 78973 states and 101854 transitions. Second operand 4 states. [2019-09-07 22:07:56,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:07:56,954 INFO L93 Difference]: Finished difference Result 171024 states and 225507 transitions. [2019-09-07 22:07:56,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 22:07:56,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 542 [2019-09-07 22:07:56,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:07:57,203 INFO L225 Difference]: With dead ends: 171024 [2019-09-07 22:07:57,203 INFO L226 Difference]: Without dead ends: 100992 [2019-09-07 22:07:57,286 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 22:07:57,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100992 states. [2019-09-07 22:07:58,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100992 to 93517. [2019-09-07 22:07:58,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93517 states. [2019-09-07 22:07:58,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93517 states to 93517 states and 120793 transitions. [2019-09-07 22:07:58,800 INFO L78 Accepts]: Start accepts. Automaton has 93517 states and 120793 transitions. Word has length 542 [2019-09-07 22:07:58,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:07:58,801 INFO L475 AbstractCegarLoop]: Abstraction has 93517 states and 120793 transitions. [2019-09-07 22:07:58,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 22:07:58,802 INFO L276 IsEmpty]: Start isEmpty. Operand 93517 states and 120793 transitions. [2019-09-07 22:07:58,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 622 [2019-09-07 22:07:58,874 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:07:58,875 INFO L399 BasicCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 22:07:58,875 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:07:58,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:07:58,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1583720069, now seen corresponding path program 1 times [2019-09-07 22:07:58,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:07:58,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:07:58,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:07:58,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:07:58,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:07:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:07:59,619 INFO L134 CoverageAnalysis]: Checked inductivity of 831 backedges. 158 proven. 2 refuted. 0 times theorem prover too weak. 671 trivial. 0 not checked. [2019-09-07 22:07:59,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:07:59,620 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 22:07:59,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:07:59,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:07:59,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-07 22:07:59,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:08:00,000 INFO L134 CoverageAnalysis]: Checked inductivity of 831 backedges. 485 proven. 0 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2019-09-07 22:08:00,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 22:08:00,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-09-07 22:08:00,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 22:08:00,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 22:08:00,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 22:08:00,013 INFO L87 Difference]: Start difference. First operand 93517 states and 120793 transitions. Second operand 4 states. [2019-09-07 22:08:06,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:08:06,537 INFO L93 Difference]: Finished difference Result 225922 states and 294902 transitions. [2019-09-07 22:08:06,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 22:08:06,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 621 [2019-09-07 22:08:06,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:08:06,902 INFO L225 Difference]: With dead ends: 225922 [2019-09-07 22:08:06,903 INFO L226 Difference]: Without dead ends: 132844 [2019-09-07 22:08:07,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 623 GetRequests, 621 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 22:08:07,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132844 states. [2019-09-07 22:08:08,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132844 to 111243. [2019-09-07 22:08:08,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111243 states. [2019-09-07 22:08:13,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111243 states to 111243 states and 140332 transitions. [2019-09-07 22:08:13,072 INFO L78 Accepts]: Start accepts. Automaton has 111243 states and 140332 transitions. Word has length 621 [2019-09-07 22:08:13,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:08:13,072 INFO L475 AbstractCegarLoop]: Abstraction has 111243 states and 140332 transitions. [2019-09-07 22:08:13,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 22:08:13,072 INFO L276 IsEmpty]: Start isEmpty. Operand 111243 states and 140332 transitions. [2019-09-07 22:08:13,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 770 [2019-09-07 22:08:13,193 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:08:13,194 INFO L399 BasicCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:08:13,194 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:08:13,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:08:13,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1473139867, now seen corresponding path program 1 times [2019-09-07 22:08:13,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:08:13,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:08:13,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:08:13,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:08:13,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:08:13,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:08:13,939 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 561 proven. 2 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2019-09-07 22:08:13,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:08:13,939 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) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:08:13,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:08:14,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:08:14,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 1062 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 22:08:14,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:08:14,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:08:14,874 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 353 proven. 0 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2019-09-07 22:08:14,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 22:08:14,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-07 22:08:14,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 22:08:14,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 22:08:14,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-07 22:08:14,886 INFO L87 Difference]: Start difference. First operand 111243 states and 140332 transitions. Second operand 8 states. [2019-09-07 22:08:25,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:08:25,890 INFO L93 Difference]: Finished difference Result 205375 states and 260270 transitions. [2019-09-07 22:08:25,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-07 22:08:25,891 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 769 [2019-09-07 22:08:25,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:08:26,141 INFO L225 Difference]: With dead ends: 205375 [2019-09-07 22:08:26,141 INFO L226 Difference]: Without dead ends: 105631 [2019-09-07 22:08:26,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 831 GetRequests, 796 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=234, Invalid=1098, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 22:08:26,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105631 states. [2019-09-07 22:08:27,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105631 to 102231. [2019-09-07 22:08:27,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102231 states. [2019-09-07 22:08:27,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102231 states to 102231 states and 125194 transitions. [2019-09-07 22:08:27,995 INFO L78 Accepts]: Start accepts. Automaton has 102231 states and 125194 transitions. Word has length 769 [2019-09-07 22:08:27,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:08:27,995 INFO L475 AbstractCegarLoop]: Abstraction has 102231 states and 125194 transitions. [2019-09-07 22:08:27,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 22:08:27,996 INFO L276 IsEmpty]: Start isEmpty. Operand 102231 states and 125194 transitions. [2019-09-07 22:08:28,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 836 [2019-09-07 22:08:28,066 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:08:28,067 INFO L399 BasicCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:08:28,067 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:08:28,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:08:28,068 INFO L82 PathProgramCache]: Analyzing trace with hash -2101763893, now seen corresponding path program 1 times [2019-09-07 22:08:28,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:08:28,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:08:28,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:08:28,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:08:28,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:08:28,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:08:29,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1145 backedges. 198 proven. 663 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2019-09-07 22:08:29,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:08:29,305 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 22:08:29,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:08:29,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:08:29,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 1168 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 22:08:29,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:08:29,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:08:29,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1145 backedges. 664 proven. 2 refuted. 0 times theorem prover too weak. 479 trivial. 0 not checked. [2019-09-07 22:08:29,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:08:29,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 13 [2019-09-07 22:08:29,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 22:08:29,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 22:08:29,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-09-07 22:08:29,882 INFO L87 Difference]: Start difference. First operand 102231 states and 125194 transitions. Second operand 13 states. [2019-09-07 22:08:56,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:08:56,583 INFO L93 Difference]: Finished difference Result 237896 states and 313516 transitions. [2019-09-07 22:08:56,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-09-07 22:08:56,583 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 835 [2019-09-07 22:08:56,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:08:56,964 INFO L225 Difference]: With dead ends: 237896 [2019-09-07 22:08:56,964 INFO L226 Difference]: Without dead ends: 138723 [2019-09-07 22:08:57,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 980 GetRequests, 902 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2196 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=953, Invalid=5367, Unknown=0, NotChecked=0, Total=6320 [2019-09-07 22:08:57,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138723 states. [2019-09-07 22:08:58,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138723 to 117794. [2019-09-07 22:08:58,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117794 states. [2019-09-07 22:08:58,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117794 states to 117794 states and 136556 transitions. [2019-09-07 22:08:58,900 INFO L78 Accepts]: Start accepts. Automaton has 117794 states and 136556 transitions. Word has length 835 [2019-09-07 22:08:58,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:08:58,900 INFO L475 AbstractCegarLoop]: Abstraction has 117794 states and 136556 transitions. [2019-09-07 22:08:58,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 22:08:58,901 INFO L276 IsEmpty]: Start isEmpty. Operand 117794 states and 136556 transitions. [2019-09-07 22:08:59,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 845 [2019-09-07 22:08:59,478 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:08:59,479 INFO L399 BasicCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:08:59,479 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:08:59,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:08:59,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1939673559, now seen corresponding path program 1 times [2019-09-07 22:08:59,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:08:59,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:08:59,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:08:59,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:08:59,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:08:59,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:09:00,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 370 proven. 202 refuted. 0 times theorem prover too weak. 619 trivial. 0 not checked. [2019-09-07 22:09:00,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:09:00,127 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 22:09:00,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:09:00,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:09:00,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 1178 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 22:09:00,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:09:00,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:09:00,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:09:00,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:09:00,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:09:00,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:09:00,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:09:00,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:09:02,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 664 proven. 2 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2019-09-07 22:09:02,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:09:02,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-09-07 22:09:02,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 22:09:02,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 22:09:02,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-07 22:09:02,668 INFO L87 Difference]: Start difference. First operand 117794 states and 136556 transitions. Second operand 8 states. [2019-09-07 22:09:43,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:09:43,609 INFO L93 Difference]: Finished difference Result 252462 states and 292443 transitions. [2019-09-07 22:09:43,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-07 22:09:43,609 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 844 [2019-09-07 22:09:43,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:09:43,858 INFO L225 Difference]: With dead ends: 252462 [2019-09-07 22:09:43,858 INFO L226 Difference]: Without dead ends: 128904 [2019-09-07 22:09:43,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 914 GetRequests, 874 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=319, Invalid=1403, Unknown=0, NotChecked=0, Total=1722 [2019-09-07 22:09:44,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128904 states. [2019-09-07 22:09:45,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128904 to 122339. [2019-09-07 22:09:45,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122339 states. [2019-09-07 22:09:45,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122339 states to 122339 states and 138288 transitions. [2019-09-07 22:09:45,306 INFO L78 Accepts]: Start accepts. Automaton has 122339 states and 138288 transitions. Word has length 844 [2019-09-07 22:09:45,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:09:45,307 INFO L475 AbstractCegarLoop]: Abstraction has 122339 states and 138288 transitions. [2019-09-07 22:09:45,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 22:09:45,307 INFO L276 IsEmpty]: Start isEmpty. Operand 122339 states and 138288 transitions. [2019-09-07 22:09:45,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 968 [2019-09-07 22:09:45,382 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:09:45,383 INFO L399 BasicCegarLoop]: trace histogram [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, 6, 6, 6, 6, 6, 6, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:09:45,383 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:09:45,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:09:45,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1931677276, now seen corresponding path program 1 times [2019-09-07 22:09:45,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:09:45,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:09:45,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:09:45,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:09:45,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:09:45,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:09:47,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1746 backedges. 826 proven. 2 refuted. 0 times theorem prover too weak. 918 trivial. 0 not checked. [2019-09-07 22:09:47,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:09:47,045 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) [2019-09-07 22:09:47,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:09:47,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:09:47,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 1338 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 22:09:47,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:09:47,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:09:47,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:09:49,519 WARN L188 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 35 DAG size of output: 21 [2019-09-07 22:09:49,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:09:51,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1746 backedges. 907 proven. 2 refuted. 0 times theorem prover too weak. 837 trivial. 0 not checked. [2019-09-07 22:09:51,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:09:51,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 11 [2019-09-07 22:09:51,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 22:09:51,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 22:09:51,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-09-07 22:09:51,738 INFO L87 Difference]: Start difference. First operand 122339 states and 138288 transitions. Second operand 11 states. [2019-09-07 22:14:20,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:14:20,703 INFO L93 Difference]: Finished difference Result 275187 states and 314261 transitions. [2019-09-07 22:14:20,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-07 22:14:20,704 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 967 [2019-09-07 22:14:20,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:14:21,001 INFO L225 Difference]: With dead ends: 275187 [2019-09-07 22:14:21,002 INFO L226 Difference]: Without dead ends: 153289 [2019-09-07 22:14:21,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1087 GetRequests, 1016 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1894 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=784, Invalid=4470, Unknown=2, NotChecked=0, Total=5256 [2019-09-07 22:14:21,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153289 states. [2019-09-07 22:14:22,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153289 to 148436. [2019-09-07 22:14:22,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148436 states. [2019-09-07 22:14:23,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148436 states to 148436 states and 167380 transitions. [2019-09-07 22:14:23,162 INFO L78 Accepts]: Start accepts. Automaton has 148436 states and 167380 transitions. Word has length 967 [2019-09-07 22:14:23,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:14:23,163 INFO L475 AbstractCegarLoop]: Abstraction has 148436 states and 167380 transitions. [2019-09-07 22:14:23,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 22:14:23,163 INFO L276 IsEmpty]: Start isEmpty. Operand 148436 states and 167380 transitions. [2019-09-07 22:14:23,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 996 [2019-09-07 22:14:23,246 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:14:23,247 INFO L399 BasicCegarLoop]: trace histogram [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, 5, 5, 5, 5, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 22:14:23,247 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:14:23,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:14:23,247 INFO L82 PathProgramCache]: Analyzing trace with hash 593928954, now seen corresponding path program 1 times [2019-09-07 22:14:23,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:14:23,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:14:23,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:14:23,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:14:23,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:14:23,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:14:25,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1355 backedges. 723 proven. 70 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2019-09-07 22:14:25,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:14:25,139 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 22:14:25,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:14:25,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:14:25,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 1354 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 22:14:25,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:14:25,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:14:25,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:14:26,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1355 backedges. 723 proven. 70 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 22:14:26,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:14:26,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2019-09-07 22:14:26,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 22:14:26,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 22:14:26,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-09-07 22:14:26,942 INFO L87 Difference]: Start difference. First operand 148436 states and 167380 transitions. Second operand 13 states. [2019-09-07 22:14:43,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:14:43,875 INFO L93 Difference]: Finished difference Result 317085 states and 356966 transitions. [2019-09-07 22:14:43,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 22:14:43,875 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 995 [2019-09-07 22:14:43,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:14:44,231 INFO L225 Difference]: With dead ends: 317085 [2019-09-07 22:14:44,231 INFO L226 Difference]: Without dead ends: 169090 [2019-09-07 22:14:44,365 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1023 GetRequests, 1005 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2019-09-07 22:14:44,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169090 states. [2019-09-07 22:14:46,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169090 to 161605. [2019-09-07 22:14:46,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161605 states. [2019-09-07 22:14:46,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161605 states to 161605 states and 180685 transitions. [2019-09-07 22:14:46,748 INFO L78 Accepts]: Start accepts. Automaton has 161605 states and 180685 transitions. Word has length 995 [2019-09-07 22:14:46,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:14:46,749 INFO L475 AbstractCegarLoop]: Abstraction has 161605 states and 180685 transitions. [2019-09-07 22:14:46,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 22:14:46,749 INFO L276 IsEmpty]: Start isEmpty. Operand 161605 states and 180685 transitions. [2019-09-07 22:14:46,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1083 [2019-09-07 22:14:46,848 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:14:46,849 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 22:14:46,849 INFO L418 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:14:46,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:14:46,849 INFO L82 PathProgramCache]: Analyzing trace with hash -656198057, now seen corresponding path program 1 times [2019-09-07 22:14:46,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:14:46,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:14:46,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:14:46,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:14:46,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:14:46,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:14:50,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1591 backedges. 954 proven. 9 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2019-09-07 22:14:50,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:14:50,127 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 22:14:50,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:14:50,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:14:50,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 1439 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 22:14:50,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:14:51,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1591 backedges. 954 proven. 9 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2019-09-07 22:14:51,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:14:51,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-07 22:14:51,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 22:14:51,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 22:14:51,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-07 22:14:51,039 INFO L87 Difference]: Start difference. First operand 161605 states and 180685 transitions. Second operand 9 states. [2019-09-07 22:15:00,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:15:00,109 INFO L93 Difference]: Finished difference Result 333763 states and 373219 transitions. [2019-09-07 22:15:00,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 22:15:00,109 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1082 [2019-09-07 22:15:00,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:15:00,421 INFO L225 Difference]: With dead ends: 333763 [2019-09-07 22:15:00,421 INFO L226 Difference]: Without dead ends: 172166 [2019-09-07 22:15:00,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1125 GetRequests, 1101 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2019-09-07 22:15:00,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172166 states. [2019-09-07 22:15:02,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172166 to 168638. [2019-09-07 22:15:02,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168638 states. [2019-09-07 22:15:02,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168638 states to 168638 states and 186981 transitions. [2019-09-07 22:15:02,367 INFO L78 Accepts]: Start accepts. Automaton has 168638 states and 186981 transitions. Word has length 1082 [2019-09-07 22:15:02,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:15:02,368 INFO L475 AbstractCegarLoop]: Abstraction has 168638 states and 186981 transitions. [2019-09-07 22:15:02,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 22:15:02,368 INFO L276 IsEmpty]: Start isEmpty. Operand 168638 states and 186981 transitions. [2019-09-07 22:15:03,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1157 [2019-09-07 22:15:03,050 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:15:03,050 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:15:03,051 INFO L418 AbstractCegarLoop]: === Iteration 20 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:15:03,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:15:03,051 INFO L82 PathProgramCache]: Analyzing trace with hash 13080119, now seen corresponding path program 1 times [2019-09-07 22:15:03,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:15:03,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:15:03,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:15:03,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:15:03,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:15:03,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:15:04,080 INFO L134 CoverageAnalysis]: Checked inductivity of 2064 backedges. 249 proven. 4 refuted. 0 times theorem prover too weak. 1811 trivial. 0 not checked. [2019-09-07 22:15:04,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:15:04,080 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 22:15:04,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:15:06,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:15:06,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 1552 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-07 22:15:06,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:15:07,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2064 backedges. 1315 proven. 0 refuted. 0 times theorem prover too weak. 749 trivial. 0 not checked. [2019-09-07 22:15:07,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 22:15:07,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-07 22:15:07,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 22:15:07,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 22:15:07,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-07 22:15:07,145 INFO L87 Difference]: Start difference. First operand 168638 states and 186981 transitions. Second operand 5 states. [2019-09-07 22:15:09,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:15:09,910 INFO L93 Difference]: Finished difference Result 320524 states and 356120 transitions. [2019-09-07 22:15:09,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 22:15:09,910 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1156 [2019-09-07 22:15:09,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:15:10,215 INFO L225 Difference]: With dead ends: 320524 [2019-09-07 22:15:10,215 INFO L226 Difference]: Without dead ends: 152332 [2019-09-07 22:15:10,356 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1159 GetRequests, 1155 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-07 22:15:10,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152332 states. [2019-09-07 22:15:12,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152332 to 148411. [2019-09-07 22:15:12,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148411 states. [2019-09-07 22:15:12,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148411 states to 148411 states and 164924 transitions. [2019-09-07 22:15:12,406 INFO L78 Accepts]: Start accepts. Automaton has 148411 states and 164924 transitions. Word has length 1156 [2019-09-07 22:15:12,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:15:12,406 INFO L475 AbstractCegarLoop]: Abstraction has 148411 states and 164924 transitions. [2019-09-07 22:15:12,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 22:15:12,407 INFO L276 IsEmpty]: Start isEmpty. Operand 148411 states and 164924 transitions. [2019-09-07 22:15:12,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1179 [2019-09-07 22:15:12,510 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:15:12,511 INFO L399 BasicCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 22:15:12,511 INFO L418 AbstractCegarLoop]: === Iteration 21 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:15:12,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:15:12,512 INFO L82 PathProgramCache]: Analyzing trace with hash 416707374, now seen corresponding path program 1 times [2019-09-07 22:15:12,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:15:12,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:15:12,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:15:12,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:15:12,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:15:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:15:14,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2033 backedges. 480 proven. 409 refuted. 0 times theorem prover too weak. 1144 trivial. 0 not checked. [2019-09-07 22:15:14,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:15:14,056 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 22:15:14,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:15:14,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:15:14,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 1577 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 22:15:14,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:15:14,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:15:17,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2033 backedges. 1313 proven. 2 refuted. 0 times theorem prover too weak. 718 trivial. 0 not checked. [2019-09-07 22:15:17,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:15:17,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-09-07 22:15:17,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 22:15:17,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 22:15:17,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-09-07 22:15:17,096 INFO L87 Difference]: Start difference. First operand 148411 states and 164924 transitions. Second operand 8 states. [2019-09-07 22:15:24,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:15:24,634 INFO L93 Difference]: Finished difference Result 288641 states and 320402 transitions. [2019-09-07 22:15:24,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 22:15:24,636 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1178 [2019-09-07 22:15:24,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:15:24,891 INFO L225 Difference]: With dead ends: 288641 [2019-09-07 22:15:24,891 INFO L226 Difference]: Without dead ends: 140676 [2019-09-07 22:15:24,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1211 GetRequests, 1189 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2019-09-07 22:15:25,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140676 states. [2019-09-07 22:15:26,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140676 to 138443. [2019-09-07 22:15:26,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138443 states. [2019-09-07 22:15:26,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138443 states to 138443 states and 152092 transitions. [2019-09-07 22:15:26,371 INFO L78 Accepts]: Start accepts. Automaton has 138443 states and 152092 transitions. Word has length 1178 [2019-09-07 22:15:26,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:15:26,372 INFO L475 AbstractCegarLoop]: Abstraction has 138443 states and 152092 transitions. [2019-09-07 22:15:26,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 22:15:26,372 INFO L276 IsEmpty]: Start isEmpty. Operand 138443 states and 152092 transitions. [2019-09-07 22:15:26,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1261 [2019-09-07 22:15:26,484 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:15:26,484 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 22:15:26,484 INFO L418 AbstractCegarLoop]: === Iteration 22 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:15:26,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:15:26,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1016653627, now seen corresponding path program 1 times [2019-09-07 22:15:26,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:15:26,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:15:26,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:15:26,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:15:26,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:15:26,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:15:28,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2727 backedges. 717 proven. 228 refuted. 0 times theorem prover too weak. 1782 trivial. 0 not checked. [2019-09-07 22:15:28,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:15:28,282 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 22:15:28,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:15:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:15:28,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 1694 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 22:15:28,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:15:28,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:15:28,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:15:28,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:15:28,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:15:28,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:15:28,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:15:28,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:15:28,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:15:28,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:15:28,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:15:28,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:15:28,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:15:28,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:15:28,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:15:28,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:15:28,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:15:28,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:15:29,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2727 backedges. 1468 proven. 667 refuted. 0 times theorem prover too weak. 592 trivial. 0 not checked. [2019-09-07 22:15:29,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:15:29,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12] total 16 [2019-09-07 22:15:29,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 22:15:29,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 22:15:29,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-07 22:15:29,782 INFO L87 Difference]: Start difference. First operand 138443 states and 152092 transitions. Second operand 16 states. [2019-09-07 22:16:12,180 WARN L188 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 29 [2019-09-07 22:16:15,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:16:15,726 INFO L93 Difference]: Finished difference Result 309379 states and 343120 transitions. [2019-09-07 22:16:15,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2019-09-07 22:16:15,728 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 1260 [2019-09-07 22:16:15,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:16:16,086 INFO L225 Difference]: With dead ends: 309379 [2019-09-07 22:16:16,086 INFO L226 Difference]: Without dead ends: 171382 [2019-09-07 22:16:16,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1553 GetRequests, 1372 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14135 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=3086, Invalid=30220, Unknown=0, NotChecked=0, Total=33306 [2019-09-07 22:16:16,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171382 states. [2019-09-07 22:16:18,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171382 to 156612. [2019-09-07 22:16:18,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156612 states. [2019-09-07 22:16:18,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156612 states to 156612 states and 169094 transitions. [2019-09-07 22:16:18,641 INFO L78 Accepts]: Start accepts. Automaton has 156612 states and 169094 transitions. Word has length 1260 [2019-09-07 22:16:18,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:16:18,642 INFO L475 AbstractCegarLoop]: Abstraction has 156612 states and 169094 transitions. [2019-09-07 22:16:18,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 22:16:18,642 INFO L276 IsEmpty]: Start isEmpty. Operand 156612 states and 169094 transitions. [2019-09-07 22:16:18,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1370 [2019-09-07 22:16:18,784 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:16:18,784 INFO L399 BasicCegarLoop]: trace histogram [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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-07 22:16:18,785 INFO L418 AbstractCegarLoop]: === Iteration 23 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:16:18,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:16:18,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1278029535, now seen corresponding path program 1 times [2019-09-07 22:16:18,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:16:18,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:16:18,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:16:18,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:16:18,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:16:18,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:16:21,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2737 backedges. 1187 proven. 158 refuted. 0 times theorem prover too weak. 1392 trivial. 0 not checked. [2019-09-07 22:16:21,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:16:21,130 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 22:16:21,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:16:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:16:21,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 1829 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 22:16:21,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:16:21,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:16:21,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:16:26,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2737 backedges. 1549 proven. 70 refuted. 0 times theorem prover too weak. 1118 trivial. 0 not checked. [2019-09-07 22:16:26,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:16:26,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 16 [2019-09-07 22:16:26,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 22:16:26,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 22:16:26,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-09-07 22:16:26,009 INFO L87 Difference]: Start difference. First operand 156612 states and 169094 transitions. Second operand 16 states. [2019-09-07 22:16:48,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:16:48,935 INFO L93 Difference]: Finished difference Result 361464 states and 393433 transitions. [2019-09-07 22:16:48,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-07 22:16:48,936 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 1369 [2019-09-07 22:16:48,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:16:49,337 INFO L225 Difference]: With dead ends: 361464 [2019-09-07 22:16:49,338 INFO L226 Difference]: Without dead ends: 206174 [2019-09-07 22:16:49,455 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1431 GetRequests, 1395 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=404, Invalid=1002, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 22:16:49,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206174 states. [2019-09-07 22:16:52,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206174 to 194015. [2019-09-07 22:16:52,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194015 states. [2019-09-07 22:16:52,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194015 states to 194015 states and 209563 transitions. [2019-09-07 22:16:52,249 INFO L78 Accepts]: Start accepts. Automaton has 194015 states and 209563 transitions. Word has length 1369 [2019-09-07 22:16:52,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:16:52,250 INFO L475 AbstractCegarLoop]: Abstraction has 194015 states and 209563 transitions. [2019-09-07 22:16:52,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 22:16:52,250 INFO L276 IsEmpty]: Start isEmpty. Operand 194015 states and 209563 transitions. [2019-09-07 22:16:52,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1447 [2019-09-07 22:16:52,397 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:16:52,398 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-07 22:16:52,398 INFO L418 AbstractCegarLoop]: === Iteration 24 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:16:52,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:16:52,398 INFO L82 PathProgramCache]: Analyzing trace with hash -791172180, now seen corresponding path program 1 times [2019-09-07 22:16:52,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:16:52,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:16:52,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:16:52,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:16:52,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:16:52,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:16:57,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3009 backedges. 1678 proven. 76 refuted. 0 times theorem prover too weak. 1255 trivial. 0 not checked. [2019-09-07 22:16:57,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:16:57,145 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 22:16:57,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:16:57,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:16:57,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 1907 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 22:16:57,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:16:57,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:16:57,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:16:57,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:16:57,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:16:57,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:16:57,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:16:57,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:16:57,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:16:57,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:16:57,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:16:57,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:16:57,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:16:57,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:16:57,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:16:57,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:16:57,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:16:57,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:16:57,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:16:57,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:16:57,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:16:57,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:16:57,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:16:57,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:16:57,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:16:57,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:16:58,205 WARN L188 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 29 [2019-09-07 22:16:58,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:16:58,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:16:58,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:16:59,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3009 backedges. 1665 proven. 404 refuted. 0 times theorem prover too weak. 940 trivial. 0 not checked. [2019-09-07 22:16:59,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:16:59,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2019-09-07 22:16:59,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 22:16:59,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 22:16:59,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-09-07 22:16:59,328 INFO L87 Difference]: Start difference. First operand 194015 states and 209563 transitions. Second operand 15 states. [2019-09-07 22:17:28,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:17:28,885 INFO L93 Difference]: Finished difference Result 394854 states and 426467 transitions. [2019-09-07 22:17:28,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-07 22:17:28,886 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 1446 [2019-09-07 22:17:28,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:17:28,889 INFO L225 Difference]: With dead ends: 394854 [2019-09-07 22:17:28,889 INFO L226 Difference]: Without dead ends: 0 [2019-09-07 22:17:29,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1561 GetRequests, 1497 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1452 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=823, Invalid=3467, Unknown=0, NotChecked=0, Total=4290 [2019-09-07 22:17:29,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-07 22:17:29,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-07 22:17:29,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-07 22:17:29,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-07 22:17:29,522 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1446 [2019-09-07 22:17:29,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:17:29,523 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-07 22:17:29,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 22:17:29,523 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-07 22:17:29,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-07 22:17:29,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-07 22:17:29,689 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 149 [2019-09-07 22:17:31,264 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 146 [2019-09-07 22:17:31,895 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 152 [2019-09-07 22:17:32,275 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 146 [2019-09-07 22:17:33,478 WARN L188 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 146 [2019-09-07 22:17:34,112 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 148 [2019-09-07 22:17:34,302 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 148 [2019-09-07 22:17:35,702 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 152 [2019-09-07 22:17:36,421 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 146 [2019-09-07 22:17:36,646 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 149 [2019-09-07 22:17:38,012 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 148