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_label15.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 21:35:39,919 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 21:35:39,921 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 21:35:39,932 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 21:35:39,933 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 21:35:39,934 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 21:35:39,935 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 21:35:39,937 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 21:35:39,939 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 21:35:39,939 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 21:35:39,940 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 21:35:39,942 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 21:35:39,942 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 21:35:39,943 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 21:35:39,944 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 21:35:39,945 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 21:35:39,946 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 21:35:39,947 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 21:35:39,948 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 21:35:39,951 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 21:35:39,952 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 21:35:39,953 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 21:35:39,954 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 21:35:39,955 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 21:35:39,957 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 21:35:39,957 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 21:35:39,958 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 21:35:39,959 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 21:35:39,959 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 21:35:39,960 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 21:35:39,960 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 21:35:39,961 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 21:35:39,962 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 21:35:39,963 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 21:35:39,964 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 21:35:39,964 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 21:35:39,965 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 21:35:39,965 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 21:35:39,965 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 21:35:39,966 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 21:35:39,967 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 21:35:39,968 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 21:35:39,982 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 21:35:39,982 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 21:35:39,983 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 21:35:39,983 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 21:35:39,983 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 21:35:39,984 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 21:35:39,984 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 21:35:39,984 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 21:35:39,984 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 21:35:39,984 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 21:35:39,985 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 21:35:39,985 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 21:35:39,985 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 21:35:39,985 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 21:35:39,985 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 21:35:39,986 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 21:35:39,986 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 21:35:39,986 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 21:35:39,986 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 21:35:39,986 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 21:35:39,987 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 21:35:39,987 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 21:35:39,987 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 21:35:39,987 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 21:35:39,987 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 21:35:39,988 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 21:35:39,988 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 21:35:39,988 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 21:35:39,988 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 21:35:40,016 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 21:35:40,028 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 21:35:40,032 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 21:35:40,033 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 21:35:40,033 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 21:35:40,034 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label15.c [2019-09-07 21:35:40,100 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64af23bc1/0954e42a63134a1dac134784909f78ba/FLAG65fb724ae [2019-09-07 21:35:40,827 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 21:35:40,829 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label15.c [2019-09-07 21:35:40,854 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64af23bc1/0954e42a63134a1dac134784909f78ba/FLAG65fb724ae [2019-09-07 21:35:40,935 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64af23bc1/0954e42a63134a1dac134784909f78ba [2019-09-07 21:35:40,947 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 21:35:40,949 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 21:35:40,953 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 21:35:40,953 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 21:35:40,957 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 21:35:40,958 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 09:35:40" (1/1) ... [2019-09-07 21:35:40,960 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dc0faf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:35:40, skipping insertion in model container [2019-09-07 21:35:40,961 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 09:35:40" (1/1) ... [2019-09-07 21:35:40,968 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 21:35:41,072 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 21:35:42,123 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 21:35:42,134 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 21:35:42,543 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 21:35:42,565 INFO L192 MainTranslator]: Completed translation [2019-09-07 21:35:42,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:35:42 WrapperNode [2019-09-07 21:35:42,566 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 21:35:42,567 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 21:35:42,567 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 21:35:42,567 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 21:35:42,581 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:35:42" (1/1) ... [2019-09-07 21:35:42,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:35:42" (1/1) ... [2019-09-07 21:35:42,638 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:35:42" (1/1) ... [2019-09-07 21:35:42,640 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:35:42" (1/1) ... [2019-09-07 21:35:42,755 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:35:42" (1/1) ... [2019-09-07 21:35:42,776 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:35:42" (1/1) ... [2019-09-07 21:35:42,803 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:35:42" (1/1) ... [2019-09-07 21:35:42,820 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 21:35:42,820 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 21:35:42,821 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 21:35:42,821 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 21:35:42,822 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:35:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 21:35:42,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 21:35:42,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 21:35:42,884 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 21:35:42,884 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 21:35:42,884 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 21:35:42,885 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 21:35:42,885 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 21:35:42,885 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 21:35:42,885 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 21:35:42,886 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 21:35:42,886 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 21:35:42,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 21:35:42,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 21:35:46,682 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 21:35:46,682 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 21:35:46,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 09:35:46 BoogieIcfgContainer [2019-09-07 21:35:46,685 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 21:35:46,686 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 21:35:46,686 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 21:35:46,689 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 21:35:46,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 09:35:40" (1/3) ... [2019-09-07 21:35:46,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@291ffa7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 09:35:46, skipping insertion in model container [2019-09-07 21:35:46,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:35:42" (2/3) ... [2019-09-07 21:35:46,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@291ffa7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 09:35:46, skipping insertion in model container [2019-09-07 21:35:46,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 09:35:46" (3/3) ... [2019-09-07 21:35:46,693 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem17_label15.c [2019-09-07 21:35:46,703 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 21:35:46,711 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 21:35:46,729 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 21:35:46,763 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 21:35:46,764 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 21:35:46,764 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 21:35:46,764 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 21:35:46,764 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 21:35:46,765 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 21:35:46,765 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 21:35:46,765 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 21:35:46,765 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 21:35:46,793 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states. [2019-09-07 21:35:46,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-07 21:35:46,800 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:35:46,801 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] [2019-09-07 21:35:46,803 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:35:46,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:35:46,808 INFO L82 PathProgramCache]: Analyzing trace with hash -138531991, now seen corresponding path program 1 times [2019-09-07 21:35:46,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:35:46,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:35:46,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:35:46,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:35:46,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:35:46,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:35:47,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:35:47,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:35:47,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 21:35:47,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 21:35:47,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 21:35:47,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 21:35:47,154 INFO L87 Difference]: Start difference. First operand 603 states. Second operand 4 states. [2019-09-07 21:35:52,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:35:52,776 INFO L93 Difference]: Finished difference Result 2160 states and 4005 transitions. [2019-09-07 21:35:52,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 21:35:52,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-09-07 21:35:52,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:35:52,809 INFO L225 Difference]: With dead ends: 2160 [2019-09-07 21:35:52,809 INFO L226 Difference]: Without dead ends: 1476 [2019-09-07 21:35:52,823 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 21:35:52,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2019-09-07 21:35:52,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 990. [2019-09-07 21:35:52,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 990 states. [2019-09-07 21:35:52,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1715 transitions. [2019-09-07 21:35:52,937 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1715 transitions. Word has length 42 [2019-09-07 21:35:52,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:35:52,937 INFO L475 AbstractCegarLoop]: Abstraction has 990 states and 1715 transitions. [2019-09-07 21:35:52,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 21:35:52,938 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1715 transitions. [2019-09-07 21:35:52,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-07 21:35:52,943 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:35:52,944 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:35:52,944 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:35:52,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:35:52,945 INFO L82 PathProgramCache]: Analyzing trace with hash 830983668, now seen corresponding path program 1 times [2019-09-07 21:35:52,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:35:52,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:35:52,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:35:52,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:35:52,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:35:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:35:53,205 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:35:53,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:35:53,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 21:35:53,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 21:35:53,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 21:35:53,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 21:35:53,209 INFO L87 Difference]: Start difference. First operand 990 states and 1715 transitions. Second operand 5 states. [2019-09-07 21:35:57,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:35:57,796 INFO L93 Difference]: Finished difference Result 2903 states and 5092 transitions. [2019-09-07 21:35:57,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 21:35:57,798 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2019-09-07 21:35:57,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:35:57,811 INFO L225 Difference]: With dead ends: 2903 [2019-09-07 21:35:57,811 INFO L226 Difference]: Without dead ends: 1919 [2019-09-07 21:35:57,815 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 21:35:57,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1919 states. [2019-09-07 21:35:57,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1919 to 1895. [2019-09-07 21:35:57,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1895 states. [2019-09-07 21:35:57,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1895 states to 1895 states and 2965 transitions. [2019-09-07 21:35:57,879 INFO L78 Accepts]: Start accepts. Automaton has 1895 states and 2965 transitions. Word has length 113 [2019-09-07 21:35:57,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:35:57,879 INFO L475 AbstractCegarLoop]: Abstraction has 1895 states and 2965 transitions. [2019-09-07 21:35:57,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 21:35:57,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1895 states and 2965 transitions. [2019-09-07 21:35:57,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-07 21:35:57,883 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:35:57,883 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:35:57,883 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:35:57,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:35:57,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1423483904, now seen corresponding path program 1 times [2019-09-07 21:35:57,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:35:57,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:35:57,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:35:57,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:35:57,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:35:57,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:35:58,101 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:35:58,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:35:58,101 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:35:58,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:35:58,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:35:58,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 21:35:58,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:35:58,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:35:58,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:36:03,406 WARN L188 SmtUtils]: Spent 3.10 s on a formula simplification that was a NOOP. DAG size: 30 [2019-09-07 21:36:05,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:36:05,542 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-09-07 21:36:05,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:36:05,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2019-09-07 21:36:05,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 21:36:05,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 21:36:05,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=51, Unknown=1, NotChecked=0, Total=72 [2019-09-07 21:36:05,561 INFO L87 Difference]: Start difference. First operand 1895 states and 2965 transitions. Second operand 9 states. [2019-09-07 21:36:08,822 WARN L188 SmtUtils]: Spent 2.98 s on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2019-09-07 21:36:12,997 WARN L188 SmtUtils]: Spent 3.22 s on a formula simplification that was a NOOP. DAG size: 32 [2019-09-07 21:36:24,930 WARN L188 SmtUtils]: Spent 2.83 s on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2019-09-07 21:36:29,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:36:29,346 INFO L93 Difference]: Finished difference Result 9436 states and 16208 transitions. [2019-09-07 21:36:29,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 21:36:29,347 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-07 21:36:29,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:36:29,405 INFO L225 Difference]: With dead ends: 9436 [2019-09-07 21:36:29,405 INFO L226 Difference]: Without dead ends: 7547 [2019-09-07 21:36:29,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 115 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=80, Invalid=191, Unknown=1, NotChecked=0, Total=272 [2019-09-07 21:36:29,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7547 states. [2019-09-07 21:36:29,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7547 to 7402. [2019-09-07 21:36:29,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7402 states. [2019-09-07 21:36:29,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7402 states to 7402 states and 10777 transitions. [2019-09-07 21:36:29,732 INFO L78 Accepts]: Start accepts. Automaton has 7402 states and 10777 transitions. Word has length 116 [2019-09-07 21:36:29,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:36:29,734 INFO L475 AbstractCegarLoop]: Abstraction has 7402 states and 10777 transitions. [2019-09-07 21:36:29,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 21:36:29,734 INFO L276 IsEmpty]: Start isEmpty. Operand 7402 states and 10777 transitions. [2019-09-07 21:36:29,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-07 21:36:29,743 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:36:29,744 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:36:29,745 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:36:29,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:36:29,745 INFO L82 PathProgramCache]: Analyzing trace with hash -165798160, now seen corresponding path program 1 times [2019-09-07 21:36:29,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:36:29,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:36:29,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:36:29,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:36:29,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:36:29,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:36:29,888 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:36:29,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:36:29,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 21:36:29,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 21:36:29,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 21:36:29,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 21:36:29,890 INFO L87 Difference]: Start difference. First operand 7402 states and 10777 transitions. Second operand 5 states. [2019-09-07 21:36:35,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:36:35,039 INFO L93 Difference]: Finished difference Result 22356 states and 34818 transitions. [2019-09-07 21:36:35,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 21:36:35,040 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 131 [2019-09-07 21:36:35,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:36:35,125 INFO L225 Difference]: With dead ends: 22356 [2019-09-07 21:36:35,125 INFO L226 Difference]: Without dead ends: 14960 [2019-09-07 21:36:35,151 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 21:36:35,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14960 states. [2019-09-07 21:36:35,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14960 to 14771. [2019-09-07 21:36:35,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14771 states. [2019-09-07 21:36:35,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14771 states to 14771 states and 20526 transitions. [2019-09-07 21:36:35,589 INFO L78 Accepts]: Start accepts. Automaton has 14771 states and 20526 transitions. Word has length 131 [2019-09-07 21:36:35,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:36:35,590 INFO L475 AbstractCegarLoop]: Abstraction has 14771 states and 20526 transitions. [2019-09-07 21:36:35,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 21:36:35,590 INFO L276 IsEmpty]: Start isEmpty. Operand 14771 states and 20526 transitions. [2019-09-07 21:36:35,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-07 21:36:35,593 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:36:35,593 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:36:35,593 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:36:35,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:36:35,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1005026072, now seen corresponding path program 1 times [2019-09-07 21:36:35,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:36:35,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:36:35,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:36:35,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:36:35,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:36:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:36:35,762 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:36:35,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:36:35,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-07 21:36:35,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 21:36:35,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 21:36:35,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-07 21:36:35,766 INFO L87 Difference]: Start difference. First operand 14771 states and 20526 transitions. Second operand 7 states. [2019-09-07 21:36:46,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:36:46,214 INFO L93 Difference]: Finished difference Result 43013 states and 70031 transitions. [2019-09-07 21:36:46,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 21:36:46,215 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-09-07 21:36:46,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:36:46,358 INFO L225 Difference]: With dead ends: 43013 [2019-09-07 21:36:46,358 INFO L226 Difference]: Without dead ends: 28248 [2019-09-07 21:36:46,413 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 21:36:46,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28248 states. [2019-09-07 21:36:48,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28248 to 27837. [2019-09-07 21:36:48,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27837 states. [2019-09-07 21:36:48,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27837 states to 27837 states and 40776 transitions. [2019-09-07 21:36:48,435 INFO L78 Accepts]: Start accepts. Automaton has 27837 states and 40776 transitions. Word has length 143 [2019-09-07 21:36:48,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:36:48,436 INFO L475 AbstractCegarLoop]: Abstraction has 27837 states and 40776 transitions. [2019-09-07 21:36:48,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 21:36:48,436 INFO L276 IsEmpty]: Start isEmpty. Operand 27837 states and 40776 transitions. [2019-09-07 21:36:48,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-07 21:36:48,440 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:36:48,441 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 21:36:48,441 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:36:48,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:36:48,441 INFO L82 PathProgramCache]: Analyzing trace with hash -2119369935, now seen corresponding path program 1 times [2019-09-07 21:36:48,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:36:48,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:36:48,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:36:48,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:36:48,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:36:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:36:48,599 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 71 proven. 7 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-07 21:36:48,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:36:48,599 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 21:36:48,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:36:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:36:48,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:36:48,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:36:48,762 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 142 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:36:48,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:36:48,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 21:36:48,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 21:36:48,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 21:36:48,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:36:48,777 INFO L87 Difference]: Start difference. First operand 27837 states and 40776 transitions. Second operand 9 states. [2019-09-07 21:36:54,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:36:54,310 INFO L93 Difference]: Finished difference Result 60353 states and 88788 transitions. [2019-09-07 21:36:54,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 21:36:54,314 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 193 [2019-09-07 21:36:54,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:36:54,388 INFO L225 Difference]: With dead ends: 60353 [2019-09-07 21:36:54,388 INFO L226 Difference]: Without dead ends: 28756 [2019-09-07 21:36:54,464 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-09-07 21:36:54,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28756 states. [2019-09-07 21:36:55,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28756 to 26985. [2019-09-07 21:36:55,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26985 states. [2019-09-07 21:36:55,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26985 states to 26985 states and 32558 transitions. [2019-09-07 21:36:55,113 INFO L78 Accepts]: Start accepts. Automaton has 26985 states and 32558 transitions. Word has length 193 [2019-09-07 21:36:55,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:36:55,117 INFO L475 AbstractCegarLoop]: Abstraction has 26985 states and 32558 transitions. [2019-09-07 21:36:55,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 21:36:55,117 INFO L276 IsEmpty]: Start isEmpty. Operand 26985 states and 32558 transitions. [2019-09-07 21:36:55,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-07 21:36:55,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:36:55,121 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 21:36:55,121 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:36:55,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:36:55,121 INFO L82 PathProgramCache]: Analyzing trace with hash 755962906, now seen corresponding path program 1 times [2019-09-07 21:36:55,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:36:55,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:36:55,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:36:55,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:36:55,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:36:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:36:55,392 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 109 proven. 42 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-07 21:36:55,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:36:55,392 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 21:36:55,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:36:55,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:36:55,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:36:55,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:36:55,549 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Stream closed [2019-09-07 21:36:55,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 21:36:55,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2019-09-07 21:36:55,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 21:36:55,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 21:36:55,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-09-07 21:36:55,556 INFO L87 Difference]: Start difference. First operand 26985 states and 32558 transitions. Second operand 8 states. [2019-09-07 21:37:00,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:37:00,944 INFO L93 Difference]: Finished difference Result 54150 states and 66773 transitions. [2019-09-07 21:37:00,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 21:37:00,944 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 236 [2019-09-07 21:37:00,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:37:01,026 INFO L225 Difference]: With dead ends: 54150 [2019-09-07 21:37:01,027 INFO L226 Difference]: Without dead ends: 27171 [2019-09-07 21:37:01,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-09-07 21:37:01,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27171 states. [2019-09-07 21:37:01,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27171 to 26985. [2019-09-07 21:37:01,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26985 states. [2019-09-07 21:37:01,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26985 states to 26985 states and 32379 transitions. [2019-09-07 21:37:01,786 INFO L78 Accepts]: Start accepts. Automaton has 26985 states and 32379 transitions. Word has length 236 [2019-09-07 21:37:01,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:37:01,787 INFO L475 AbstractCegarLoop]: Abstraction has 26985 states and 32379 transitions. [2019-09-07 21:37:01,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 21:37:01,787 INFO L276 IsEmpty]: Start isEmpty. Operand 26985 states and 32379 transitions. [2019-09-07 21:37:01,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-09-07 21:37:01,807 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:37:01,808 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:37:01,808 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:37:01,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:37:01,808 INFO L82 PathProgramCache]: Analyzing trace with hash -337020954, now seen corresponding path program 1 times [2019-09-07 21:37:01,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:37:01,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:37:01,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:37:01,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:37:01,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:37:01,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:37:02,181 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 260 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-07 21:37:02,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:37:02,181 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 21:37:02,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:37:02,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:37:02,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 21:37:02,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:37:02,443 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 260 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-07 21:37:02,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:37:02,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2019-09-07 21:37:02,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 21:37:02,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 21:37:02,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-07 21:37:02,459 INFO L87 Difference]: Start difference. First operand 26985 states and 32379 transitions. Second operand 8 states. [2019-09-07 21:37:16,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:37:16,066 INFO L93 Difference]: Finished difference Result 82864 states and 104962 transitions. [2019-09-07 21:37:16,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 21:37:16,066 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 380 [2019-09-07 21:37:16,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:37:16,205 INFO L225 Difference]: With dead ends: 82864 [2019-09-07 21:37:16,206 INFO L226 Difference]: Without dead ends: 49604 [2019-09-07 21:37:16,270 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2019-09-07 21:37:16,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49604 states. [2019-09-07 21:37:16,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49604 to 46054. [2019-09-07 21:37:16,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46054 states. [2019-09-07 21:37:16,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46054 states to 46054 states and 55980 transitions. [2019-09-07 21:37:16,970 INFO L78 Accepts]: Start accepts. Automaton has 46054 states and 55980 transitions. Word has length 380 [2019-09-07 21:37:16,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:37:16,970 INFO L475 AbstractCegarLoop]: Abstraction has 46054 states and 55980 transitions. [2019-09-07 21:37:16,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 21:37:16,971 INFO L276 IsEmpty]: Start isEmpty. Operand 46054 states and 55980 transitions. [2019-09-07 21:37:16,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2019-09-07 21:37:16,990 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:37:16,990 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:37:16,990 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:37:16,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:37:16,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1152690730, now seen corresponding path program 1 times [2019-09-07 21:37:16,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:37:16,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:37:16,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:37:16,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:37:16,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:37:17,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:37:17,770 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 322 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-07 21:37:17,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:37:17,770 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) [2019-09-07 21:37:17,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:37:17,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:37:17,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 21:37:17,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:37:17,999 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 21:37:18,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 21:37:18,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-07 21:37:18,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 21:37:18,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 21:37:18,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-07 21:37:18,014 INFO L87 Difference]: Start difference. First operand 46054 states and 55980 transitions. Second operand 7 states. [2019-09-07 21:37:25,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:37:25,687 INFO L93 Difference]: Finished difference Result 103537 states and 126766 transitions. [2019-09-07 21:37:25,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 21:37:25,688 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 436 [2019-09-07 21:37:25,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:37:25,848 INFO L225 Difference]: With dead ends: 103537 [2019-09-07 21:37:25,848 INFO L226 Difference]: Without dead ends: 57058 [2019-09-07 21:37:25,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 444 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-09-07 21:37:25,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57058 states. [2019-09-07 21:37:28,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57058 to 55205. [2019-09-07 21:37:28,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55205 states. [2019-09-07 21:37:28,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55205 states to 55205 states and 65979 transitions. [2019-09-07 21:37:28,415 INFO L78 Accepts]: Start accepts. Automaton has 55205 states and 65979 transitions. Word has length 436 [2019-09-07 21:37:28,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:37:28,416 INFO L475 AbstractCegarLoop]: Abstraction has 55205 states and 65979 transitions. [2019-09-07 21:37:28,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 21:37:28,416 INFO L276 IsEmpty]: Start isEmpty. Operand 55205 states and 65979 transitions. [2019-09-07 21:37:28,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2019-09-07 21:37:28,441 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:37:28,442 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:37:28,442 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:37:28,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:37:28,443 INFO L82 PathProgramCache]: Analyzing trace with hash -230719335, now seen corresponding path program 1 times [2019-09-07 21:37:28,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:37:28,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:37:28,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:37:28,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:37:28,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:37:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:37:28,772 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2019-09-07 21:37:28,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:37:28,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 21:37:28,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 21:37:28,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 21:37:28,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 21:37:28,774 INFO L87 Difference]: Start difference. First operand 55205 states and 65979 transitions. Second operand 4 states. [2019-09-07 21:37:35,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:37:35,906 INFO L93 Difference]: Finished difference Result 127899 states and 154368 transitions. [2019-09-07 21:37:35,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 21:37:35,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 473 [2019-09-07 21:37:35,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:37:36,063 INFO L225 Difference]: With dead ends: 127899 [2019-09-07 21:37:36,063 INFO L226 Difference]: Without dead ends: 72249 [2019-09-07 21:37:36,115 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 21:37:36,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72249 states. [2019-09-07 21:37:37,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72249 to 66141. [2019-09-07 21:37:37,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66141 states. [2019-09-07 21:37:37,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66141 states to 66141 states and 78790 transitions. [2019-09-07 21:37:37,240 INFO L78 Accepts]: Start accepts. Automaton has 66141 states and 78790 transitions. Word has length 473 [2019-09-07 21:37:37,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:37:37,242 INFO L475 AbstractCegarLoop]: Abstraction has 66141 states and 78790 transitions. [2019-09-07 21:37:37,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 21:37:37,242 INFO L276 IsEmpty]: Start isEmpty. Operand 66141 states and 78790 transitions. [2019-09-07 21:37:37,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2019-09-07 21:37:37,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:37:37,283 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-09-07 21:37:37,284 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:37:37,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:37:37,284 INFO L82 PathProgramCache]: Analyzing trace with hash -156895949, now seen corresponding path program 1 times [2019-09-07 21:37:37,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:37:37,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:37:37,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:37:37,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:37:37,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:37:37,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:37:37,669 INFO L134 CoverageAnalysis]: Checked inductivity of 674 backedges. 322 proven. 102 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2019-09-07 21:37:37,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:37:37,670 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 21:37:37,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:37:38,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:37:38,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 754 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 21:37:38,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:37:38,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:37:38,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:37:38,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:37:38,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:37:38,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:37:38,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:37:38,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:37:38,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:37:38,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:37:38,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:37:38,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:37:38,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:37:38,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:37:38,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:37:38,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:37:38,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:37:38,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:37:38,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:37:38,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:37:38,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:37:38,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:37:38,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:37:38,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:37:38,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:37:38,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:37:38,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:37:38,544 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 22 [2019-09-07 21:37:38,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:37:38,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:37:38,978 INFO L134 CoverageAnalysis]: Checked inductivity of 674 backedges. 387 proven. 34 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-09-07 21:37:38,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:37:38,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2019-09-07 21:37:38,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 21:37:38,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 21:37:38,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:37:38,984 INFO L87 Difference]: Start difference. First operand 66141 states and 78790 transitions. Second operand 9 states. [2019-09-07 21:40:22,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:40:22,986 INFO L93 Difference]: Finished difference Result 155592 states and 189172 transitions. [2019-09-07 21:40:22,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-07 21:40:22,987 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 482 [2019-09-07 21:40:22,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:40:23,201 INFO L225 Difference]: With dead ends: 155592 [2019-09-07 21:40:23,202 INFO L226 Difference]: Without dead ends: 85747 [2019-09-07 21:40:23,321 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 507 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=318, Invalid=1404, Unknown=0, NotChecked=0, Total=1722 [2019-09-07 21:40:23,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85747 states. [2019-09-07 21:40:24,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85747 to 78980. [2019-09-07 21:40:24,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78980 states. [2019-09-07 21:40:25,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78980 states to 78980 states and 95919 transitions. [2019-09-07 21:40:25,107 INFO L78 Accepts]: Start accepts. Automaton has 78980 states and 95919 transitions. Word has length 482 [2019-09-07 21:40:25,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:40:25,108 INFO L475 AbstractCegarLoop]: Abstraction has 78980 states and 95919 transitions. [2019-09-07 21:40:25,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 21:40:25,108 INFO L276 IsEmpty]: Start isEmpty. Operand 78980 states and 95919 transitions. [2019-09-07 21:40:25,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2019-09-07 21:40:25,152 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:40:25,152 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-09-07 21:40:25,153 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:40:25,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:40:25,153 INFO L82 PathProgramCache]: Analyzing trace with hash -420852678, now seen corresponding path program 1 times [2019-09-07 21:40:25,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:40:25,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:40:25,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:40:25,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:40:25,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:40:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:40:25,544 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 338 proven. 102 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2019-09-07 21:40:25,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:40:25,545 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) [2019-09-07 21:40:25,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:40:25,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:40:25,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 21:40:25,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:40:25,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:40:25,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:40:25,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:40:26,050 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 538 proven. 2 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2019-09-07 21:40:26,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:40:26,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 11 [2019-09-07 21:40:26,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 21:40:26,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 21:40:26,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-07 21:40:26,056 INFO L87 Difference]: Start difference. First operand 78980 states and 95919 transitions. Second operand 11 states. [2019-09-07 21:42:32,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:42:32,042 INFO L93 Difference]: Finished difference Result 198891 states and 245408 transitions. [2019-09-07 21:42:32,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-07 21:42:32,043 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 525 [2019-09-07 21:42:32,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:42:34,391 INFO L225 Difference]: With dead ends: 198891 [2019-09-07 21:42:34,391 INFO L226 Difference]: Without dead ends: 118579 [2019-09-07 21:42:34,502 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 598 GetRequests, 554 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=368, Invalid=1702, Unknown=0, NotChecked=0, Total=2070 [2019-09-07 21:42:34,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118579 states. [2019-09-07 21:42:35,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118579 to 115228. [2019-09-07 21:42:35,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115228 states. [2019-09-07 21:42:36,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115228 states to 115228 states and 139419 transitions. [2019-09-07 21:42:36,086 INFO L78 Accepts]: Start accepts. Automaton has 115228 states and 139419 transitions. Word has length 525 [2019-09-07 21:42:36,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:42:36,087 INFO L475 AbstractCegarLoop]: Abstraction has 115228 states and 139419 transitions. [2019-09-07 21:42:36,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 21:42:36,087 INFO L276 IsEmpty]: Start isEmpty. Operand 115228 states and 139419 transitions. [2019-09-07 21:42:36,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2019-09-07 21:42:36,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:42:36,121 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 21:42:36,121 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:42:36,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:42:36,122 INFO L82 PathProgramCache]: Analyzing trace with hash 2072188699, now seen corresponding path program 1 times [2019-09-07 21:42:36,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:42:36,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:42:36,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:42:36,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:42:36,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:42:36,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:42:37,014 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 411 proven. 34 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2019-09-07 21:42:37,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:42:37,015 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:42:37,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:42:37,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:42:37,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 822 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:42:37,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:42:37,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:42:37,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:42:37,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:42:37,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:42:37,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:42:37,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:42:37,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:42:37,447 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 16 [2019-09-07 21:42:37,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:42:37,592 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 570 proven. 2 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-07 21:42:37,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:42:37,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-09-07 21:42:37,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 21:42:37,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 21:42:37,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-07 21:42:37,598 INFO L87 Difference]: Start difference. First operand 115228 states and 139419 transitions. Second operand 10 states. [2019-09-07 21:43:34,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:43:34,824 INFO L93 Difference]: Finished difference Result 260802 states and 311400 transitions. [2019-09-07 21:43:34,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-07 21:43:34,825 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 546 [2019-09-07 21:43:34,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:43:35,157 INFO L225 Difference]: With dead ends: 260802 [2019-09-07 21:43:35,157 INFO L226 Difference]: Without dead ends: 142930 [2019-09-07 21:43:35,322 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 650 GetRequests, 593 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1157 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=638, Invalid=2784, Unknown=0, NotChecked=0, Total=3422 [2019-09-07 21:43:35,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142930 states. [2019-09-07 21:43:37,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142930 to 134659. [2019-09-07 21:43:37,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134659 states. [2019-09-07 21:43:37,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134659 states to 134659 states and 157362 transitions. [2019-09-07 21:43:37,559 INFO L78 Accepts]: Start accepts. Automaton has 134659 states and 157362 transitions. Word has length 546 [2019-09-07 21:43:37,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:43:37,560 INFO L475 AbstractCegarLoop]: Abstraction has 134659 states and 157362 transitions. [2019-09-07 21:43:37,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 21:43:37,560 INFO L276 IsEmpty]: Start isEmpty. Operand 134659 states and 157362 transitions. [2019-09-07 21:43:37,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2019-09-07 21:43:37,580 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:43:37,580 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:43:37,581 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:43:37,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:43:37,581 INFO L82 PathProgramCache]: Analyzing trace with hash 700809884, now seen corresponding path program 1 times [2019-09-07 21:43:37,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:43:37,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:43:37,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:43:37,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:43:37,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:43:37,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:43:38,205 INFO L134 CoverageAnalysis]: Checked inductivity of 843 backedges. 528 proven. 2 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2019-09-07 21:43:38,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:43:38,206 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 21:43:38,232 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 21:43:38,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:43:38,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 21:43:38,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:43:38,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:43:38,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:43:44,851 INFO L134 CoverageAnalysis]: Checked inductivity of 843 backedges. 496 proven. 34 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2019-09-07 21:43:44,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:43:44,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2019-09-07 21:43:44,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 21:43:44,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 21:43:44,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=83, Unknown=2, NotChecked=0, Total=110 [2019-09-07 21:43:44,857 INFO L87 Difference]: Start difference. First operand 134659 states and 157362 transitions. Second operand 11 states.