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/Problem15_label04.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 20:14:23,651 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 20:14:23,654 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 20:14:23,668 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 20:14:23,668 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 20:14:23,669 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 20:14:23,671 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 20:14:23,672 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 20:14:23,674 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 20:14:23,675 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 20:14:23,676 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 20:14:23,677 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 20:14:23,677 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 20:14:23,678 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 20:14:23,679 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 20:14:23,680 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 20:14:23,681 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 20:14:23,682 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 20:14:23,684 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 20:14:23,685 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 20:14:23,687 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 20:14:23,688 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 20:14:23,689 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 20:14:23,690 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 20:14:23,692 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 20:14:23,692 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 20:14:23,693 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 20:14:23,694 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 20:14:23,694 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 20:14:23,695 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 20:14:23,697 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 20:14:23,698 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 20:14:23,700 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 20:14:23,700 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 20:14:23,702 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 20:14:23,702 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 20:14:23,702 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 20:14:23,703 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 20:14:23,703 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 20:14:23,706 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 20:14:23,707 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 20:14:23,708 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 20:14:23,734 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 20:14:23,734 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 20:14:23,737 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 20:14:23,737 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 20:14:23,737 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 20:14:23,738 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 20:14:23,738 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 20:14:23,738 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 20:14:23,738 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 20:14:23,738 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 20:14:23,739 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 20:14:23,740 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 20:14:23,740 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 20:14:23,740 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 20:14:23,740 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 20:14:23,741 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 20:14:23,741 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 20:14:23,741 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 20:14:23,741 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 20:14:23,741 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 20:14:23,742 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 20:14:23,742 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 20:14:23,742 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 20:14:23,742 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 20:14:23,743 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 20:14:23,743 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 20:14:23,743 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 20:14:23,743 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 20:14:23,744 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 20:14:23,780 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 20:14:23,792 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 20:14:23,798 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 20:14:23,801 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 20:14:23,802 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 20:14:23,803 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label04.c [2019-09-07 20:14:23,866 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7df6fb149/3c537f47fb2341479e1a6541ce60c1b5/FLAGc88a9d9d0 [2019-09-07 20:14:24,483 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 20:14:24,485 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label04.c [2019-09-07 20:14:24,509 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7df6fb149/3c537f47fb2341479e1a6541ce60c1b5/FLAGc88a9d9d0 [2019-09-07 20:14:24,684 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7df6fb149/3c537f47fb2341479e1a6541ce60c1b5 [2019-09-07 20:14:24,697 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 20:14:24,699 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 20:14:24,700 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 20:14:24,700 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 20:14:24,703 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 20:14:24,704 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 08:14:24" (1/1) ... [2019-09-07 20:14:24,707 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fe21a7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:14:24, skipping insertion in model container [2019-09-07 20:14:24,708 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 08:14:24" (1/1) ... [2019-09-07 20:14:24,715 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 20:14:24,799 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 20:14:25,684 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 20:14:25,702 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 20:14:26,066 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 20:14:26,089 INFO L192 MainTranslator]: Completed translation [2019-09-07 20:14:26,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:14:26 WrapperNode [2019-09-07 20:14:26,091 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 20:14:26,092 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 20:14:26,092 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 20:14:26,092 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 20:14:26,107 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:14:26" (1/1) ... [2019-09-07 20:14:26,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:14:26" (1/1) ... [2019-09-07 20:14:26,159 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:14:26" (1/1) ... [2019-09-07 20:14:26,159 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:14:26" (1/1) ... [2019-09-07 20:14:26,239 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:14:26" (1/1) ... [2019-09-07 20:14:26,284 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:14:26" (1/1) ... [2019-09-07 20:14:26,311 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:14:26" (1/1) ... [2019-09-07 20:14:26,338 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 20:14:26,339 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 20:14:26,339 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 20:14:26,339 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 20:14:26,341 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:14:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 20:14:26,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 20:14:26,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 20:14:26,414 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 20:14:26,414 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 20:14:26,414 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 20:14:26,414 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 20:14:26,415 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 20:14:26,415 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 20:14:26,415 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 20:14:26,415 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 20:14:26,416 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 20:14:26,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 20:14:26,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 20:14:30,689 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 20:14:30,689 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 20:14:30,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 08:14:30 BoogieIcfgContainer [2019-09-07 20:14:30,694 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 20:14:30,733 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 20:14:30,733 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 20:14:30,741 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 20:14:30,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 08:14:24" (1/3) ... [2019-09-07 20:14:30,743 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39f9d392 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 08:14:30, skipping insertion in model container [2019-09-07 20:14:30,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:14:26" (2/3) ... [2019-09-07 20:14:30,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39f9d392 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 08:14:30, skipping insertion in model container [2019-09-07 20:14:30,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 08:14:30" (3/3) ... [2019-09-07 20:14:30,752 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label04.c [2019-09-07 20:14:30,765 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 20:14:30,775 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 20:14:30,793 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 20:14:30,839 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 20:14:30,840 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 20:14:30,841 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 20:14:30,841 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 20:14:30,841 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 20:14:30,841 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 20:14:30,841 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 20:14:30,842 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 20:14:30,842 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 20:14:30,886 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states. [2019-09-07 20:14:30,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-07 20:14:30,895 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:14:30,896 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] [2019-09-07 20:14:30,898 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:14:30,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:14:30,905 INFO L82 PathProgramCache]: Analyzing trace with hash -2134000803, now seen corresponding path program 1 times [2019-09-07 20:14:30,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:14:30,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:14:30,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:14:30,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:14:30,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:14:31,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:14:31,377 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 20:14:31,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:14:31,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 20:14:31,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:14:31,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:14:31,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:14:31,403 INFO L87 Difference]: Start difference. First operand 437 states. Second operand 4 states. [2019-09-07 20:14:38,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:14:38,355 INFO L93 Difference]: Finished difference Result 1510 states and 2773 transitions. [2019-09-07 20:14:38,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:14:38,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-09-07 20:14:38,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:14:38,386 INFO L225 Difference]: With dead ends: 1510 [2019-09-07 20:14:38,386 INFO L226 Difference]: Without dead ends: 1006 [2019-09-07 20:14:38,399 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 20:14:38,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2019-09-07 20:14:38,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 1004. [2019-09-07 20:14:38,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1004 states. [2019-09-07 20:14:38,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1509 transitions. [2019-09-07 20:14:38,517 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1509 transitions. Word has length 37 [2019-09-07 20:14:38,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:14:38,518 INFO L475 AbstractCegarLoop]: Abstraction has 1004 states and 1509 transitions. [2019-09-07 20:14:38,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:14:38,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1509 transitions. [2019-09-07 20:14:38,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-07 20:14:38,524 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:14:38,524 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:14:38,525 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:14:38,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:14:38,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1961730458, now seen corresponding path program 1 times [2019-09-07 20:14:38,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:14:38,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:14:38,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:14:38,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:14:38,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:14:38,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:14:38,728 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:14:38,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:14:38,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 20:14:38,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:14:38,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:14:38,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:14:38,731 INFO L87 Difference]: Start difference. First operand 1004 states and 1509 transitions. Second operand 4 states. [2019-09-07 20:14:43,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:14:43,991 INFO L93 Difference]: Finished difference Result 3854 states and 5903 transitions. [2019-09-07 20:14:43,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:14:43,992 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-07 20:14:43,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:14:44,009 INFO L225 Difference]: With dead ends: 3854 [2019-09-07 20:14:44,009 INFO L226 Difference]: Without dead ends: 2856 [2019-09-07 20:14:44,014 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 20:14:44,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2856 states. [2019-09-07 20:14:44,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2856 to 2544. [2019-09-07 20:14:44,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2544 states. [2019-09-07 20:14:44,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2544 states to 2544 states and 3555 transitions. [2019-09-07 20:14:44,105 INFO L78 Accepts]: Start accepts. Automaton has 2544 states and 3555 transitions. Word has length 106 [2019-09-07 20:14:44,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:14:44,106 INFO L475 AbstractCegarLoop]: Abstraction has 2544 states and 3555 transitions. [2019-09-07 20:14:44,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:14:44,106 INFO L276 IsEmpty]: Start isEmpty. Operand 2544 states and 3555 transitions. [2019-09-07 20:14:44,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-07 20:14:44,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:14:44,117 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:14:44,118 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:14:44,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:14:44,118 INFO L82 PathProgramCache]: Analyzing trace with hash -747995886, now seen corresponding path program 1 times [2019-09-07 20:14:44,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:14:44,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:14:44,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:14:44,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:14:44,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:14:44,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:14:44,568 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 97 proven. 237 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-07 20:14:44,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:14:44,569 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 20:14:44,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:14:44,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:14:44,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 20:14:44,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:14:44,944 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 237 proven. 2 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-07 20:14:44,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:14:44,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2019-09-07 20:14:44,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 20:14:44,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 20:14:44,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-07 20:14:44,968 INFO L87 Difference]: Start difference. First operand 2544 states and 3555 transitions. Second operand 11 states. [2019-09-07 20:14:59,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:14:59,108 INFO L93 Difference]: Finished difference Result 14353 states and 21131 transitions. [2019-09-07 20:14:59,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-07 20:14:59,108 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 310 [2019-09-07 20:14:59,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:14:59,180 INFO L225 Difference]: With dead ends: 14353 [2019-09-07 20:14:59,181 INFO L226 Difference]: Without dead ends: 11815 [2019-09-07 20:14:59,202 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 793 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=520, Invalid=2132, Unknown=0, NotChecked=0, Total=2652 [2019-09-07 20:14:59,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11815 states. [2019-09-07 20:14:59,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11815 to 9861. [2019-09-07 20:14:59,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9861 states. [2019-09-07 20:14:59,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9861 states to 9861 states and 12558 transitions. [2019-09-07 20:14:59,559 INFO L78 Accepts]: Start accepts. Automaton has 9861 states and 12558 transitions. Word has length 310 [2019-09-07 20:14:59,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:14:59,563 INFO L475 AbstractCegarLoop]: Abstraction has 9861 states and 12558 transitions. [2019-09-07 20:14:59,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 20:14:59,563 INFO L276 IsEmpty]: Start isEmpty. Operand 9861 states and 12558 transitions. [2019-09-07 20:14:59,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-07 20:14:59,572 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:14:59,573 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:14:59,573 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:14:59,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:14:59,574 INFO L82 PathProgramCache]: Analyzing trace with hash 923420616, now seen corresponding path program 1 times [2019-09-07 20:14:59,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:14:59,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:14:59,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:14:59,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:14:59,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:14:59,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:15:00,059 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 157 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:15:00,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:15:00,060 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:15:00,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:15:00,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:15:00,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:15:00,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:15:00,320 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 157 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:15:00,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:15:00,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 20:15:00,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:15:00,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:15:00,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:15:00,325 INFO L87 Difference]: Start difference. First operand 9861 states and 12558 transitions. Second operand 9 states. [2019-09-07 20:15:07,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:15:07,864 INFO L93 Difference]: Finished difference Result 25738 states and 36291 transitions. [2019-09-07 20:15:07,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 20:15:07,864 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 336 [2019-09-07 20:15:07,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:15:07,953 INFO L225 Difference]: With dead ends: 25738 [2019-09-07 20:15:07,953 INFO L226 Difference]: Without dead ends: 16190 [2019-09-07 20:15:07,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2019-09-07 20:15:08,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16190 states. [2019-09-07 20:15:08,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16190 to 15848. [2019-09-07 20:15:08,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15848 states. [2019-09-07 20:15:08,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15848 states to 15848 states and 20965 transitions. [2019-09-07 20:15:08,476 INFO L78 Accepts]: Start accepts. Automaton has 15848 states and 20965 transitions. Word has length 336 [2019-09-07 20:15:08,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:15:08,478 INFO L475 AbstractCegarLoop]: Abstraction has 15848 states and 20965 transitions. [2019-09-07 20:15:08,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:15:08,478 INFO L276 IsEmpty]: Start isEmpty. Operand 15848 states and 20965 transitions. [2019-09-07 20:15:08,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2019-09-07 20:15:08,495 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:15:08,496 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:15:08,496 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:15:08,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:15:08,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1443515374, now seen corresponding path program 1 times [2019-09-07 20:15:08,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:15:08,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:15:08,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:15:08,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:15:08,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:15:08,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:15:09,054 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-09-07 20:15:09,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:15:09,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 20:15:09,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 20:15:09,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 20:15:09,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:15:09,056 INFO L87 Difference]: Start difference. First operand 15848 states and 20965 transitions. Second operand 3 states. [2019-09-07 20:15:11,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:15:11,566 INFO L93 Difference]: Finished difference Result 34820 states and 47600 transitions. [2019-09-07 20:15:11,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 20:15:11,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 476 [2019-09-07 20:15:11,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:15:11,650 INFO L225 Difference]: With dead ends: 34820 [2019-09-07 20:15:11,651 INFO L226 Difference]: Without dead ends: 19285 [2019-09-07 20:15:11,712 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:15:11,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19285 states. [2019-09-07 20:15:12,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19285 to 19283. [2019-09-07 20:15:12,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19283 states. [2019-09-07 20:15:12,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19283 states to 19283 states and 25998 transitions. [2019-09-07 20:15:12,277 INFO L78 Accepts]: Start accepts. Automaton has 19283 states and 25998 transitions. Word has length 476 [2019-09-07 20:15:12,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:15:12,278 INFO L475 AbstractCegarLoop]: Abstraction has 19283 states and 25998 transitions. [2019-09-07 20:15:12,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 20:15:12,278 INFO L276 IsEmpty]: Start isEmpty. Operand 19283 states and 25998 transitions. [2019-09-07 20:15:12,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2019-09-07 20:15:12,303 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:15:12,303 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:15:12,303 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:15:12,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:15:12,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1329971470, now seen corresponding path program 1 times [2019-09-07 20:15:12,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:15:12,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:15:12,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:15:12,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:15:12,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:15:12,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:15:12,889 INFO L134 CoverageAnalysis]: Checked inductivity of 681 backedges. 403 proven. 2 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-09-07 20:15:12,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:15:12,889 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 20:15:12,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:15:13,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:15:13,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 801 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:15:13,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:15:13,312 INFO L134 CoverageAnalysis]: Checked inductivity of 681 backedges. 403 proven. 2 refuted. 0 times theorem prover too weak. 276 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 20:15:13,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:15:13,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-07 20:15:13,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 20:15:13,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 20:15:13,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-07 20:15:13,331 INFO L87 Difference]: Start difference. First operand 19283 states and 25998 transitions. Second operand 6 states. [2019-09-07 20:15:17,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:15:17,685 INFO L93 Difference]: Finished difference Result 42700 states and 58185 transitions. [2019-09-07 20:15:17,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 20:15:17,685 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 542 [2019-09-07 20:15:17,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:15:17,761 INFO L225 Difference]: With dead ends: 42700 [2019-09-07 20:15:17,761 INFO L226 Difference]: Without dead ends: 23730 [2019-09-07 20:15:17,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 546 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-09-07 20:15:17,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23730 states. [2019-09-07 20:15:18,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23730 to 20585. [2019-09-07 20:15:18,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20585 states. [2019-09-07 20:15:18,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20585 states to 20585 states and 27928 transitions. [2019-09-07 20:15:18,271 INFO L78 Accepts]: Start accepts. Automaton has 20585 states and 27928 transitions. Word has length 542 [2019-09-07 20:15:18,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:15:18,274 INFO L475 AbstractCegarLoop]: Abstraction has 20585 states and 27928 transitions. [2019-09-07 20:15:18,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 20:15:18,274 INFO L276 IsEmpty]: Start isEmpty. Operand 20585 states and 27928 transitions. [2019-09-07 20:15:18,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2019-09-07 20:15:18,305 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:15:18,306 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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 20:15:18,306 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:15:18,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:15:18,307 INFO L82 PathProgramCache]: Analyzing trace with hash -326852525, now seen corresponding path program 1 times [2019-09-07 20:15:18,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:15:18,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:15:18,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:15:18,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:15:18,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:15:18,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:15:18,856 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 134 proven. 2 refuted. 0 times theorem prover too weak. 632 trivial. 0 not checked. [2019-09-07 20:15:18,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:15:18,856 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 20:15:18,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:15:19,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:15:19,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-07 20:15:19,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:15:19,282 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 393 proven. 0 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2019-09-07 20:15:19,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:15:19,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2019-09-07 20:15:19,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 20:15:19,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 20:15:19,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:15:19,298 INFO L87 Difference]: Start difference. First operand 20585 states and 27928 transitions. Second operand 3 states. [2019-09-07 20:15:21,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:15:21,940 INFO L93 Difference]: Finished difference Result 41164 states and 55933 transitions. [2019-09-07 20:15:21,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 20:15:21,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 576 [2019-09-07 20:15:21,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:15:22,011 INFO L225 Difference]: With dead ends: 41164 [2019-09-07 20:15:22,011 INFO L226 Difference]: Without dead ends: 20892 [2019-09-07 20:15:22,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 578 GetRequests, 577 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:15:22,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20892 states. [2019-09-07 20:15:22,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20892 to 20581. [2019-09-07 20:15:22,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20581 states. [2019-09-07 20:15:22,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20581 states to 20581 states and 27888 transitions. [2019-09-07 20:15:22,575 INFO L78 Accepts]: Start accepts. Automaton has 20581 states and 27888 transitions. Word has length 576 [2019-09-07 20:15:22,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:15:22,576 INFO L475 AbstractCegarLoop]: Abstraction has 20581 states and 27888 transitions. [2019-09-07 20:15:22,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 20:15:22,576 INFO L276 IsEmpty]: Start isEmpty. Operand 20581 states and 27888 transitions. [2019-09-07 20:15:22,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 586 [2019-09-07 20:15:22,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:15:22,612 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:15:22,612 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:15:22,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:15:22,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1368900461, now seen corresponding path program 1 times [2019-09-07 20:15:22,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:15:22,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:15:22,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:15:22,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:15:22,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:15:22,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:15:23,606 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 404 proven. 2 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2019-09-07 20:15:23,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:15:23,606 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:15:23,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:15:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:15:23,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 843 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:15:23,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:15:24,051 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 404 proven. 2 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2019-09-07 20:15:24,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:15:24,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 20:15:24,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:15:24,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:15:24,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:15:24,066 INFO L87 Difference]: Start difference. First operand 20581 states and 27888 transitions. Second operand 9 states. [2019-09-07 20:15:30,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:15:30,349 INFO L93 Difference]: Finished difference Result 42745 states and 58692 transitions. [2019-09-07 20:15:30,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 20:15:30,349 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 585 [2019-09-07 20:15:30,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:15:30,421 INFO L225 Difference]: With dead ends: 42745 [2019-09-07 20:15:30,422 INFO L226 Difference]: Without dead ends: 22477 [2019-09-07 20:15:30,473 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 590 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-09-07 20:15:30,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22477 states. [2019-09-07 20:15:30,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22477 to 21515. [2019-09-07 20:15:30,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21515 states. [2019-09-07 20:15:30,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21515 states to 21515 states and 28103 transitions. [2019-09-07 20:15:30,951 INFO L78 Accepts]: Start accepts. Automaton has 21515 states and 28103 transitions. Word has length 585 [2019-09-07 20:15:30,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:15:30,952 INFO L475 AbstractCegarLoop]: Abstraction has 21515 states and 28103 transitions. [2019-09-07 20:15:30,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:15:30,952 INFO L276 IsEmpty]: Start isEmpty. Operand 21515 states and 28103 transitions. [2019-09-07 20:15:30,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2019-09-07 20:15:30,979 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:15:30,980 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 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] [2019-09-07 20:15:30,980 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:15:30,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:15:30,981 INFO L82 PathProgramCache]: Analyzing trace with hash 241312243, now seen corresponding path program 1 times [2019-09-07 20:15:30,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:15:30,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:15:30,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:15:30,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:15:30,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:15:31,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:15:31,780 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 480 proven. 2 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-09-07 20:15:31,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:15:31,780 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 20:15:31,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:15:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:15:31,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 854 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:15:31,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:15:32,342 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 480 proven. 2 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-09-07 20:15:32,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:15:32,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 20:15:32,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:15:32,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:15:32,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:15:32,357 INFO L87 Difference]: Start difference. First operand 21515 states and 28103 transitions. Second operand 9 states. [2019-09-07 20:15:37,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:15:37,980 INFO L93 Difference]: Finished difference Result 41745 states and 53982 transitions. [2019-09-07 20:15:37,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 20:15:37,981 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 595 [2019-09-07 20:15:37,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:15:38,037 INFO L225 Difference]: With dead ends: 41745 [2019-09-07 20:15:38,038 INFO L226 Difference]: Without dead ends: 20543 [2019-09-07 20:15:38,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 616 GetRequests, 601 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-09-07 20:15:38,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20543 states. [2019-09-07 20:15:38,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20543 to 19374. [2019-09-07 20:15:38,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19374 states. [2019-09-07 20:15:38,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19374 states to 19374 states and 22203 transitions. [2019-09-07 20:15:38,441 INFO L78 Accepts]: Start accepts. Automaton has 19374 states and 22203 transitions. Word has length 595 [2019-09-07 20:15:38,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:15:38,442 INFO L475 AbstractCegarLoop]: Abstraction has 19374 states and 22203 transitions. [2019-09-07 20:15:38,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:15:38,443 INFO L276 IsEmpty]: Start isEmpty. Operand 19374 states and 22203 transitions. [2019-09-07 20:15:38,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2019-09-07 20:15:38,467 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:15:38,468 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-09-07 20:15:38,468 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:15:38,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:15:38,469 INFO L82 PathProgramCache]: Analyzing trace with hash 906112487, now seen corresponding path program 1 times [2019-09-07 20:15:38,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:15:38,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:15:38,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:15:38,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:15:38,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:15:38,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:15:39,042 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 385 proven. 100 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2019-09-07 20:15:39,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:15:39,042 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:15:39,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:15:39,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:15:39,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 854 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 20:15:39,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:15:39,449 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 646 proven. 2 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-09-07 20:15:39,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:15:39,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2019-09-07 20:15:39,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:15:39,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:15:39,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:15:39,457 INFO L87 Difference]: Start difference. First operand 19374 states and 22203 transitions. Second operand 9 states. [2019-09-07 20:15:48,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:15:48,937 INFO L93 Difference]: Finished difference Result 53292 states and 66206 transitions. [2019-09-07 20:15:48,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 20:15:48,937 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 597 [2019-09-07 20:15:48,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:15:49,055 INFO L225 Difference]: With dead ends: 53292 [2019-09-07 20:15:49,055 INFO L226 Difference]: Without dead ends: 34231 [2019-09-07 20:15:49,098 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 602 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-09-07 20:15:49,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34231 states. [2019-09-07 20:15:49,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34231 to 33874. [2019-09-07 20:15:49,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33874 states. [2019-09-07 20:15:49,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33874 states to 33874 states and 42551 transitions. [2019-09-07 20:15:49,800 INFO L78 Accepts]: Start accepts. Automaton has 33874 states and 42551 transitions. Word has length 597 [2019-09-07 20:15:49,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:15:49,800 INFO L475 AbstractCegarLoop]: Abstraction has 33874 states and 42551 transitions. [2019-09-07 20:15:49,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:15:49,800 INFO L276 IsEmpty]: Start isEmpty. Operand 33874 states and 42551 transitions. [2019-09-07 20:15:49,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 637 [2019-09-07 20:15:49,833 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:15:49,833 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:15:49,834 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:15:49,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:15:49,834 INFO L82 PathProgramCache]: Analyzing trace with hash 523101454, now seen corresponding path program 1 times [2019-09-07 20:15:49,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:15:49,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:15:49,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:15:49,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:15:49,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:15:49,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:15:50,425 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 701 trivial. 0 not checked. [2019-09-07 20:15:50,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:15:50,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 20:15:50,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 20:15:50,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 20:15:50,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:15:50,429 INFO L87 Difference]: Start difference. First operand 33874 states and 42551 transitions. Second operand 3 states. [2019-09-07 20:15:53,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:15:53,284 INFO L93 Difference]: Finished difference Result 67409 states and 84709 transitions. [2019-09-07 20:15:53,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 20:15:53,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 636 [2019-09-07 20:15:53,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:15:53,354 INFO L225 Difference]: With dead ends: 67409 [2019-09-07 20:15:53,354 INFO L226 Difference]: Without dead ends: 33848 [2019-09-07 20:15:53,415 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:15:53,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33848 states. [2019-09-07 20:15:53,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33848 to 31643. [2019-09-07 20:15:53,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31643 states. [2019-09-07 20:15:54,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31643 states to 31643 states and 39609 transitions. [2019-09-07 20:15:54,010 INFO L78 Accepts]: Start accepts. Automaton has 31643 states and 39609 transitions. Word has length 636 [2019-09-07 20:15:54,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:15:54,011 INFO L475 AbstractCegarLoop]: Abstraction has 31643 states and 39609 transitions. [2019-09-07 20:15:54,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 20:15:54,011 INFO L276 IsEmpty]: Start isEmpty. Operand 31643 states and 39609 transitions. [2019-09-07 20:15:54,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 649 [2019-09-07 20:15:54,037 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:15:54,037 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 20:15:54,037 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:15:54,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:15:54,038 INFO L82 PathProgramCache]: Analyzing trace with hash 376194482, now seen corresponding path program 1 times [2019-09-07 20:15:54,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:15:54,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:15:54,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:15:54,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:15:54,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:15:54,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:15:55,813 INFO L134 CoverageAnalysis]: Checked inductivity of 877 backedges. 533 proven. 2 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-09-07 20:15:55,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:15:55,814 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 20:15:55,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:15:56,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:15:56,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 906 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 20:15:56,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:15:56,359 INFO L134 CoverageAnalysis]: Checked inductivity of 877 backedges. 533 proven. 2 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-09-07 20:15:56,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:15:56,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2019-09-07 20:15:56,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 20:15:56,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 20:15:56,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-07 20:15:56,368 INFO L87 Difference]: Start difference. First operand 31643 states and 39609 transitions. Second operand 8 states. [2019-09-07 20:16:05,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:16:05,291 INFO L93 Difference]: Finished difference Result 82864 states and 116922 transitions. [2019-09-07 20:16:05,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 20:16:05,293 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 648 [2019-09-07 20:16:05,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:16:05,605 INFO L225 Difference]: With dead ends: 82864 [2019-09-07 20:16:05,605 INFO L226 Difference]: Without dead ends: 47485 [2019-09-07 20:16:05,715 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 670 GetRequests, 655 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-09-07 20:16:05,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47485 states. [2019-09-07 20:16:06,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47485 to 39681. [2019-09-07 20:16:06,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39681 states. [2019-09-07 20:16:07,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39681 states to 39681 states and 50965 transitions. [2019-09-07 20:16:07,098 INFO L78 Accepts]: Start accepts. Automaton has 39681 states and 50965 transitions. Word has length 648 [2019-09-07 20:16:07,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:16:07,099 INFO L475 AbstractCegarLoop]: Abstraction has 39681 states and 50965 transitions. [2019-09-07 20:16:07,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 20:16:07,099 INFO L276 IsEmpty]: Start isEmpty. Operand 39681 states and 50965 transitions. [2019-09-07 20:16:07,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2019-09-07 20:16:07,129 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:16:07,130 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-09-07 20:16:07,130 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:16:07,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:16:07,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1226970874, now seen corresponding path program 1 times [2019-09-07 20:16:07,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:16:07,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:16:07,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:16:07,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:16:07,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:16:07,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:16:07,859 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 541 proven. 2 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2019-09-07 20:16:07,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:16:07,860 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:16:07,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:16:08,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:16:08,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 937 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 20:16:08,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:16:08,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:16:08,469 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 465 proven. 0 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2019-09-07 20:16:08,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:16:08,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-07 20:16:08,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 20:16:08,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 20:16:08,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-07 20:16:08,474 INFO L87 Difference]: Start difference. First operand 39681 states and 50965 transitions. Second operand 8 states. [2019-09-07 20:16:18,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:16:18,953 INFO L93 Difference]: Finished difference Result 91318 states and 116891 transitions. [2019-09-07 20:16:18,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 20:16:18,953 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 675 [2019-09-07 20:16:18,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:16:19,073 INFO L225 Difference]: With dead ends: 91318 [2019-09-07 20:16:19,073 INFO L226 Difference]: Without dead ends: 46232 [2019-09-07 20:16:19,154 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 719 GetRequests, 693 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2019-09-07 20:16:19,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46232 states. [2019-09-07 20:16:19,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46232 to 45903. [2019-09-07 20:16:19,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45903 states. [2019-09-07 20:16:20,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45903 states to 45903 states and 56911 transitions. [2019-09-07 20:16:20,159 INFO L78 Accepts]: Start accepts. Automaton has 45903 states and 56911 transitions. Word has length 675 [2019-09-07 20:16:20,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:16:20,160 INFO L475 AbstractCegarLoop]: Abstraction has 45903 states and 56911 transitions. [2019-09-07 20:16:20,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 20:16:20,160 INFO L276 IsEmpty]: Start isEmpty. Operand 45903 states and 56911 transitions. [2019-09-07 20:16:20,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 744 [2019-09-07 20:16:20,205 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:16:20,208 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:16:20,208 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:16:20,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:16:20,209 INFO L82 PathProgramCache]: Analyzing trace with hash -855392811, now seen corresponding path program 1 times [2019-09-07 20:16:20,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:16:20,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:16:20,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:16:20,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:16:20,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:16:20,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:16:22,788 INFO L134 CoverageAnalysis]: Checked inductivity of 670 backedges. 95 proven. 303 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2019-09-07 20:16:22,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:16:22,788 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:16:22,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:16:23,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:16:23,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 966 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 20:16:23,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:16:23,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:16:23,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 20:16:23,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 20:16:23,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 20:16:23,931 INFO L134 CoverageAnalysis]: Checked inductivity of 670 backedges. 584 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-07 20:16:23,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:16:23,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2019-09-07 20:16:23,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 20:16:23,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 20:16:23,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-09-07 20:16:23,937 INFO L87 Difference]: Start difference. First operand 45903 states and 56911 transitions. Second operand 10 states. [2019-09-07 20:16:31,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:16:31,856 INFO L93 Difference]: Finished difference Result 92885 states and 117422 transitions. [2019-09-07 20:16:31,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 20:16:31,856 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 743 [2019-09-07 20:16:31,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:16:32,009 INFO L225 Difference]: With dead ends: 92885 [2019-09-07 20:16:32,009 INFO L226 Difference]: Without dead ends: 49765 [2019-09-07 20:16:32,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 779 GetRequests, 754 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=437, Unknown=0, NotChecked=0, Total=600 [2019-09-07 20:16:32,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49765 states. [2019-09-07 20:16:33,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49765 to 45459. [2019-09-07 20:16:33,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45459 states. [2019-09-07 20:16:33,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45459 states to 45459 states and 56391 transitions. [2019-09-07 20:16:33,512 INFO L78 Accepts]: Start accepts. Automaton has 45459 states and 56391 transitions. Word has length 743 [2019-09-07 20:16:33,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:16:33,513 INFO L475 AbstractCegarLoop]: Abstraction has 45459 states and 56391 transitions. [2019-09-07 20:16:33,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 20:16:33,514 INFO L276 IsEmpty]: Start isEmpty. Operand 45459 states and 56391 transitions. [2019-09-07 20:16:33,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 776 [2019-09-07 20:16:33,572 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:16:33,573 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-07 20:16:33,573 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:16:33,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:16:33,574 INFO L82 PathProgramCache]: Analyzing trace with hash -264443275, now seen corresponding path program 1 times [2019-09-07 20:16:33,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:16:33,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:16:33,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:16:33,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:16:33,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:16:33,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:16:35,102 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 131 proven. 716 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-09-07 20:16:35,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:16:35,103 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:16:35,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:16:35,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:16:35,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 1032 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:16:35,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:16:35,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:16:35,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:16:35,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:16:35,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:16:35,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:16:35,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:16:35,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:16:35,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:16:35,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:16:35,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:16:35,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:16:35,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:16:35,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:16:35,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:16:35,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:16:35,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:16:35,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:16:35,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:16:35,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:16:35,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:16:35,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:16:35,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:16:35,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:16:35,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:16:35,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:16:36,197 WARN L188 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 25 [2019-09-07 20:16:36,866 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2019-09-07 20:16:36,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:16:36,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-09-07 20:16:36,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 20:16:36,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 20:16:36,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-07 20:16:36,872 INFO L87 Difference]: Start difference. First operand 45459 states and 56391 transitions. Second operand 12 states. [2019-09-07 20:17:15,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:17:15,874 INFO L93 Difference]: Finished difference Result 105387 states and 130151 transitions. [2019-09-07 20:17:15,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-07 20:17:15,875 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 775 [2019-09-07 20:17:15,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:17:16,011 INFO L225 Difference]: With dead ends: 105387 [2019-09-07 20:17:16,012 INFO L226 Difference]: Without dead ends: 60554 [2019-09-07 20:17:16,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 842 GetRequests, 801 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=351, Invalid=1455, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 20:17:16,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60554 states. [2019-09-07 20:17:16,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60554 to 53270. [2019-09-07 20:17:16,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53270 states. [2019-09-07 20:17:17,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53270 states to 53270 states and 60121 transitions. [2019-09-07 20:17:17,023 INFO L78 Accepts]: Start accepts. Automaton has 53270 states and 60121 transitions. Word has length 775 [2019-09-07 20:17:17,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:17:17,024 INFO L475 AbstractCegarLoop]: Abstraction has 53270 states and 60121 transitions. [2019-09-07 20:17:17,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 20:17:17,024 INFO L276 IsEmpty]: Start isEmpty. Operand 53270 states and 60121 transitions. [2019-09-07 20:17:17,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 807 [2019-09-07 20:17:17,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:17:17,059 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:17:17,059 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:17:17,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:17:17,060 INFO L82 PathProgramCache]: Analyzing trace with hash -270727954, now seen corresponding path program 1 times [2019-09-07 20:17:17,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:17:17,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:17:17,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:17:17,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:17:17,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:17:17,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:17:18,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1007 backedges. 221 proven. 398 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2019-09-07 20:17:18,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:17:18,424 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:17:18,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:17:18,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:17:18,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 1066 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 20:17:18,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:17:18,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 20:17:18,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 20:17:20,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1007 backedges. 702 proven. 41 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-07 20:17:20,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:17:20,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 13 [2019-09-07 20:17:20,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 20:17:20,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 20:17:20,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-09-07 20:17:20,652 INFO L87 Difference]: Start difference. First operand 53270 states and 60121 transitions. Second operand 13 states. [2019-09-07 20:17:36,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:17:36,770 INFO L93 Difference]: Finished difference Result 122614 states and 139805 transitions. [2019-09-07 20:17:36,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-07 20:17:36,771 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 806 [2019-09-07 20:17:36,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:17:36,917 INFO L225 Difference]: With dead ends: 122614 [2019-09-07 20:17:36,917 INFO L226 Difference]: Without dead ends: 62406 [2019-09-07 20:17:36,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 932 GetRequests, 859 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1944 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1042, Invalid=4508, Unknown=0, NotChecked=0, Total=5550 [2019-09-07 20:17:37,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62406 states. [2019-09-07 20:17:37,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62406 to 53713. [2019-09-07 20:17:37,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53713 states. [2019-09-07 20:17:37,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53713 states to 53713 states and 58821 transitions. [2019-09-07 20:17:37,838 INFO L78 Accepts]: Start accepts. Automaton has 53713 states and 58821 transitions. Word has length 806 [2019-09-07 20:17:37,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:17:37,838 INFO L475 AbstractCegarLoop]: Abstraction has 53713 states and 58821 transitions. [2019-09-07 20:17:37,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 20:17:37,839 INFO L276 IsEmpty]: Start isEmpty. Operand 53713 states and 58821 transitions. [2019-09-07 20:17:37,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 840 [2019-09-07 20:17:37,877 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:17:37,877 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:17:37,878 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:17:37,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:17:37,878 INFO L82 PathProgramCache]: Analyzing trace with hash -2001535043, now seen corresponding path program 1 times [2019-09-07 20:17:37,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:17:37,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:17:37,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:17:37,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:17:37,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:17:37,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:17:39,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 521 proven. 122 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2019-09-07 20:17:39,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:17:39,113 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:17:39,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:17:39,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:17:39,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 1144 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 20:17:39,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:17:40,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 990 proven. 2 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2019-09-07 20:17:40,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:17:40,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2019-09-07 20:17:40,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:17:40,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:17:40,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:17:40,017 INFO L87 Difference]: Start difference. First operand 53713 states and 58821 transitions. Second operand 9 states. [2019-09-07 20:17:48,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:17:48,961 INFO L93 Difference]: Finished difference Result 125531 states and 137695 transitions. [2019-09-07 20:17:48,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 20:17:48,961 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 839 [2019-09-07 20:17:48,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:17:49,069 INFO L225 Difference]: With dead ends: 125531 [2019-09-07 20:17:49,069 INFO L226 Difference]: Without dead ends: 56129 [2019-09-07 20:17:49,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 865 GetRequests, 848 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2019-09-07 20:17:49,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56129 states. [2019-09-07 20:17:49,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56129 to 46347. [2019-09-07 20:17:49,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46347 states. [2019-09-07 20:17:49,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46347 states to 46347 states and 48855 transitions. [2019-09-07 20:17:49,684 INFO L78 Accepts]: Start accepts. Automaton has 46347 states and 48855 transitions. Word has length 839 [2019-09-07 20:17:49,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:17:49,890 INFO L475 AbstractCegarLoop]: Abstraction has 46347 states and 48855 transitions. [2019-09-07 20:17:49,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:17:49,890 INFO L276 IsEmpty]: Start isEmpty. Operand 46347 states and 48855 transitions. [2019-09-07 20:17:49,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 843 [2019-09-07 20:17:49,911 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:17:49,912 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 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 20:17:49,912 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:17:49,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:17:49,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1701015407, now seen corresponding path program 1 times [2019-09-07 20:17:49,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:17:49,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:17:49,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:17:49,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:17:49,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:17:50,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:17:50,673 INFO L134 CoverageAnalysis]: Checked inductivity of 856 backedges. 339 proven. 247 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2019-09-07 20:17:50,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:17:50,673 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:17:50,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:17:50,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:17:50,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 1067 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:17:50,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:17:51,253 INFO L134 CoverageAnalysis]: Checked inductivity of 856 backedges. 823 proven. 2 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-07 20:17:51,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:17:51,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 20:17:51,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:17:51,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:17:51,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:17:51,259 INFO L87 Difference]: Start difference. First operand 46347 states and 48855 transitions. Second operand 9 states. [2019-09-07 20:17:56,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:17:56,240 INFO L93 Difference]: Finished difference Result 91251 states and 96395 transitions. [2019-09-07 20:17:56,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 20:17:56,242 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 842 [2019-09-07 20:17:56,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:17:56,310 INFO L225 Difference]: With dead ends: 91251 [2019-09-07 20:17:56,310 INFO L226 Difference]: Without dead ends: 45524 [2019-09-07 20:17:56,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 873 GetRequests, 853 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2019-09-07 20:17:56,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45524 states. [2019-09-07 20:17:56,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45524 to 45350. [2019-09-07 20:17:56,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45350 states. [2019-09-07 20:17:56,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45350 states to 45350 states and 47395 transitions. [2019-09-07 20:17:56,826 INFO L78 Accepts]: Start accepts. Automaton has 45350 states and 47395 transitions. Word has length 842 [2019-09-07 20:17:56,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:17:56,826 INFO L475 AbstractCegarLoop]: Abstraction has 45350 states and 47395 transitions. [2019-09-07 20:17:56,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:17:56,827 INFO L276 IsEmpty]: Start isEmpty. Operand 45350 states and 47395 transitions. [2019-09-07 20:17:56,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 949 [2019-09-07 20:17:56,852 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:17:56,852 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:17:56,852 INFO L418 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:17:56,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:17:56,853 INFO L82 PathProgramCache]: Analyzing trace with hash 624010363, now seen corresponding path program 1 times [2019-09-07 20:17:56,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:17:56,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:17:56,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:17:56,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:17:56,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:17:56,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:17:58,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1361 backedges. 132 proven. 1014 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2019-09-07 20:17:58,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:17:58,615 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 20:17:58,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:17:58,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:17:58,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 1208 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 20:17:58,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:17:58,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:58,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:58,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:58,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:58,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:58,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:58,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:58,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:58,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:58,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:58,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:58,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:58,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:58,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:58,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:58,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:58,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:58,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:58,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:58,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:58,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:58,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:58,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:58,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:58,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:59,483 WARN L188 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 31 [2019-09-07 20:18:00,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1361 backedges. 736 proven. 29 refuted. 0 times theorem prover too weak. 596 trivial. 0 not checked. [2019-09-07 20:18:00,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:18:00,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2019-09-07 20:18:00,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 20:18:00,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 20:18:00,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-09-07 20:18:00,176 INFO L87 Difference]: Start difference. First operand 45350 states and 47395 transitions. Second operand 12 states. [2019-09-07 20:18:15,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:18:15,342 INFO L93 Difference]: Finished difference Result 118331 states and 124481 transitions. [2019-09-07 20:18:15,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-07 20:18:15,343 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 948 [2019-09-07 20:18:15,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:18:15,476 INFO L225 Difference]: With dead ends: 118331 [2019-09-07 20:18:15,476 INFO L226 Difference]: Without dead ends: 73292 [2019-09-07 20:18:15,531 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 984 GetRequests, 960 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2019-09-07 20:18:15,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73292 states. [2019-09-07 20:18:16,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73292 to 69995. [2019-09-07 20:18:16,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69995 states. [2019-09-07 20:18:16,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69995 states to 69995 states and 73047 transitions. [2019-09-07 20:18:16,344 INFO L78 Accepts]: Start accepts. Automaton has 69995 states and 73047 transitions. Word has length 948 [2019-09-07 20:18:16,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:18:16,344 INFO L475 AbstractCegarLoop]: Abstraction has 69995 states and 73047 transitions. [2019-09-07 20:18:16,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 20:18:16,345 INFO L276 IsEmpty]: Start isEmpty. Operand 69995 states and 73047 transitions. [2019-09-07 20:18:16,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 962 [2019-09-07 20:18:16,373 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:18:16,373 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 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 20:18:16,374 INFO L418 AbstractCegarLoop]: === Iteration 20 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:18:16,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:18:16,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1263192415, now seen corresponding path program 1 times [2019-09-07 20:18:16,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:18:16,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:18:16,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:18:16,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:18:16,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:18:16,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:18:18,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1231 backedges. 760 proven. 2 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2019-09-07 20:18:18,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:18:18,103 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:18:18,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:18:18,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:18:18,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 1224 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 20:18:18,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:18:19,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1231 backedges. 760 proven. 2 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2019-09-07 20:18:19,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:18:19,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2019-09-07 20:18:19,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 20:18:19,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 20:18:19,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-07 20:18:19,009 INFO L87 Difference]: Start difference. First operand 69995 states and 73047 transitions. Second operand 8 states. [2019-09-07 20:18:25,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:18:25,393 INFO L93 Difference]: Finished difference Result 131657 states and 139528 transitions. [2019-09-07 20:18:25,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 20:18:25,394 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 961 [2019-09-07 20:18:25,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:18:25,563 INFO L225 Difference]: With dead ends: 131657 [2019-09-07 20:18:25,563 INFO L226 Difference]: Without dead ends: 71348 [2019-09-07 20:18:25,630 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 982 GetRequests, 967 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-09-07 20:18:25,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71348 states. [2019-09-07 20:18:26,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71348 to 66588. [2019-09-07 20:18:26,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66588 states. [2019-09-07 20:18:26,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66588 states to 66588 states and 69492 transitions. [2019-09-07 20:18:26,490 INFO L78 Accepts]: Start accepts. Automaton has 66588 states and 69492 transitions. Word has length 961 [2019-09-07 20:18:26,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:18:26,491 INFO L475 AbstractCegarLoop]: Abstraction has 66588 states and 69492 transitions. [2019-09-07 20:18:26,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 20:18:26,491 INFO L276 IsEmpty]: Start isEmpty. Operand 66588 states and 69492 transitions. [2019-09-07 20:18:26,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1031 [2019-09-07 20:18:26,542 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:18:26,543 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:18:26,543 INFO L418 AbstractCegarLoop]: === Iteration 21 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:18:26,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:18:26,543 INFO L82 PathProgramCache]: Analyzing trace with hash 552358180, now seen corresponding path program 1 times [2019-09-07 20:18:26,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:18:26,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:18:26,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:18:26,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:18:26,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:18:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:18:27,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1486 backedges. 576 proven. 247 refuted. 0 times theorem prover too weak. 663 trivial. 0 not checked. [2019-09-07 20:18:27,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:18:27,790 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:18:27,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:18:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:18:28,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 1290 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-07 20:18:28,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:18:28,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1486 backedges. 4 proven. 841 refuted. 0 times theorem prover too weak. 641 trivial. 0 not checked. [2019-09-07 20:18:29,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:18:29,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 13 [2019-09-07 20:18:29,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 20:18:29,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 20:18:29,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-07 20:18:29,754 INFO L87 Difference]: Start difference. First operand 66588 states and 69492 transitions. Second operand 13 states. [2019-09-07 20:18:49,340 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 18 [2019-09-07 20:18:50,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:18:50,622 INFO L93 Difference]: Finished difference Result 161042 states and 172134 transitions. [2019-09-07 20:18:50,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-09-07 20:18:50,623 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 1030 [2019-09-07 20:18:50,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:18:50,821 INFO L225 Difference]: With dead ends: 161042 [2019-09-07 20:18:50,822 INFO L226 Difference]: Without dead ends: 95696 [2019-09-07 20:18:50,877 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1181 GetRequests, 1084 SyntacticMatches, 4 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3400 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1483, Invalid=7447, Unknown=0, NotChecked=0, Total=8930 [2019-09-07 20:18:50,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95696 states. [2019-09-07 20:18:51,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95696 to 81029. [2019-09-07 20:18:51,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81029 states. [2019-09-07 20:18:52,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81029 states to 81029 states and 83972 transitions. [2019-09-07 20:18:52,050 INFO L78 Accepts]: Start accepts. Automaton has 81029 states and 83972 transitions. Word has length 1030 [2019-09-07 20:18:52,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:18:52,051 INFO L475 AbstractCegarLoop]: Abstraction has 81029 states and 83972 transitions. [2019-09-07 20:18:52,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 20:18:52,051 INFO L276 IsEmpty]: Start isEmpty. Operand 81029 states and 83972 transitions. [2019-09-07 20:18:52,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1157 [2019-09-07 20:18:52,104 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:18:52,104 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:18:52,105 INFO L418 AbstractCegarLoop]: === Iteration 22 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:18:52,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:18:52,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1544255797, now seen corresponding path program 1 times [2019-09-07 20:18:52,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:18:52,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:18:52,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:18:52,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:18:52,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:18:52,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:18:53,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2679 backedges. 248 proven. 8 refuted. 0 times theorem prover too weak. 2423 trivial. 0 not checked. [2019-09-07 20:18:53,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:18:53,689 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:18:53,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:18:54,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:18:54,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 1531 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-07 20:18:54,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:18:54,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2679 backedges. 1524 proven. 0 refuted. 0 times theorem prover too weak. 1155 trivial. 0 not checked. [2019-09-07 20:18:54,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:18:54,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2019-09-07 20:18:54,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 20:18:54,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 20:18:54,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:18:54,608 INFO L87 Difference]: Start difference. First operand 81029 states and 83972 transitions. Second operand 3 states. [2019-09-07 20:18:56,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:18:56,886 INFO L93 Difference]: Finished difference Result 153506 states and 159140 transitions. [2019-09-07 20:18:56,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 20:18:56,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1156 [2019-09-07 20:18:56,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:18:57,014 INFO L225 Difference]: With dead ends: 153506 [2019-09-07 20:18:57,014 INFO L226 Difference]: Without dead ends: 82191 [2019-09-07 20:18:57,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1158 GetRequests, 1156 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:18:57,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82191 states. [2019-09-07 20:18:57,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82191 to 77213. [2019-09-07 20:18:57,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77213 states. [2019-09-07 20:18:57,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77213 states to 77213 states and 79957 transitions. [2019-09-07 20:18:57,993 INFO L78 Accepts]: Start accepts. Automaton has 77213 states and 79957 transitions. Word has length 1156 [2019-09-07 20:18:57,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:18:57,993 INFO L475 AbstractCegarLoop]: Abstraction has 77213 states and 79957 transitions. [2019-09-07 20:18:57,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 20:18:57,994 INFO L276 IsEmpty]: Start isEmpty. Operand 77213 states and 79957 transitions. [2019-09-07 20:18:58,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1196 [2019-09-07 20:18:58,046 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:18:58,047 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:18:58,047 INFO L418 AbstractCegarLoop]: === Iteration 23 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:18:58,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:18:58,048 INFO L82 PathProgramCache]: Analyzing trace with hash -510472381, now seen corresponding path program 1 times [2019-09-07 20:18:58,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:18:58,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:18:58,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:18:58,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:18:58,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:18:58,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:19:00,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2013 backedges. 1338 proven. 232 refuted. 0 times theorem prover too weak. 443 trivial. 0 not checked. [2019-09-07 20:19:00,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:19:00,227 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:19:00,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:19:00,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:19:00,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 1495 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 20:19:00,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:19:02,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2013 backedges. 1020 proven. 2 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2019-09-07 20:19:02,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:19:02,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2019-09-07 20:19:02,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 20:19:02,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 20:19:02,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-09-07 20:19:02,482 INFO L87 Difference]: Start difference. First operand 77213 states and 79957 transitions. Second operand 13 states. [2019-09-07 20:19:15,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:19:15,535 INFO L93 Difference]: Finished difference Result 151800 states and 159437 transitions. [2019-09-07 20:19:15,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-07 20:19:15,536 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 1195 [2019-09-07 20:19:15,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:19:15,717 INFO L225 Difference]: With dead ends: 151800 [2019-09-07 20:19:15,717 INFO L226 Difference]: Without dead ends: 86787 [2019-09-07 20:19:15,786 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1317 GetRequests, 1240 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2131 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=952, Invalid=5210, Unknown=0, NotChecked=0, Total=6162 [2019-09-07 20:19:15,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86787 states. [2019-09-07 20:19:16,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86787 to 76309. [2019-09-07 20:19:16,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76309 states. [2019-09-07 20:19:16,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76309 states to 76309 states and 78976 transitions. [2019-09-07 20:19:16,828 INFO L78 Accepts]: Start accepts. Automaton has 76309 states and 78976 transitions. Word has length 1195 [2019-09-07 20:19:16,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:19:16,829 INFO L475 AbstractCegarLoop]: Abstraction has 76309 states and 78976 transitions. [2019-09-07 20:19:16,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 20:19:16,829 INFO L276 IsEmpty]: Start isEmpty. Operand 76309 states and 78976 transitions. [2019-09-07 20:19:16,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1241 [2019-09-07 20:19:16,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:19:16,886 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 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 20:19:16,886 INFO L418 AbstractCegarLoop]: === Iteration 24 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:19:16,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:19:16,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1812897045, now seen corresponding path program 1 times [2019-09-07 20:19:16,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:19:16,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:19:16,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:19:16,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:19:16,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:19:17,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:19:18,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2253 backedges. 177 proven. 1291 refuted. 0 times theorem prover too weak. 785 trivial. 0 not checked. [2019-09-07 20:19:18,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:19:18,712 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:19:18,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:19:19,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:19:19,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 1537 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 20:19:19,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:19:19,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:19:19,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:19:27,818 WARN L188 SmtUtils]: Spent 4.66 s on a formula simplification that was a NOOP. DAG size: 30 [2019-09-07 20:19:29,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:19:32,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2253 backedges. 1409 proven. 64 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-09-07 20:19:32,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:19:32,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2019-09-07 20:19:32,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 20:19:32,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 20:19:32,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=119, Unknown=2, NotChecked=0, Total=156 [2019-09-07 20:19:32,971 INFO L87 Difference]: Start difference. First operand 76309 states and 78976 transitions. Second operand 13 states. [2019-09-07 20:19:36,771 WARN L188 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 34 [2019-09-07 20:19:42,924 WARN L188 SmtUtils]: Spent 6.11 s on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2019-09-07 20:19:47,224 WARN L188 SmtUtils]: Spent 4.17 s on a formula simplification that was a NOOP. DAG size: 39 [2019-09-07 20:19:54,761 WARN L188 SmtUtils]: Spent 5.48 s on a formula simplification. DAG size of input: 35 DAG size of output: 24 [2019-09-07 20:20:01,881 WARN L188 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 33 DAG size of output: 21 [2019-09-07 20:20:33,339 WARN L188 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 35 DAG size of output: 28 [2019-09-07 20:20:56,844 WARN L188 SmtUtils]: Spent 4.06 s on a formula simplification that was a NOOP. DAG size: 32 [2019-09-07 20:24:34,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:24:34,824 INFO L93 Difference]: Finished difference Result 154225 states and 160584 transitions. [2019-09-07 20:24:34,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-07 20:24:34,824 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 1240 [2019-09-07 20:24:34,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:24:34,970 INFO L225 Difference]: With dead ends: 154225 [2019-09-07 20:24:34,970 INFO L226 Difference]: Without dead ends: 84179 [2019-09-07 20:24:35,041 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1289 GetRequests, 1256 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 47.5s TimeCoverageRelationStatistics Valid=218, Invalid=899, Unknown=5, NotChecked=0, Total=1122 [2019-09-07 20:24:35,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84179 states. [2019-09-07 20:24:35,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84179 to 76295. [2019-09-07 20:24:35,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76295 states. [2019-09-07 20:24:36,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76295 states to 76295 states and 78765 transitions. [2019-09-07 20:24:36,072 INFO L78 Accepts]: Start accepts. Automaton has 76295 states and 78765 transitions. Word has length 1240 [2019-09-07 20:24:36,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:24:36,073 INFO L475 AbstractCegarLoop]: Abstraction has 76295 states and 78765 transitions. [2019-09-07 20:24:36,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 20:24:36,073 INFO L276 IsEmpty]: Start isEmpty. Operand 76295 states and 78765 transitions. [2019-09-07 20:24:36,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1248 [2019-09-07 20:24:36,123 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:24:36,124 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-09-07 20:24:36,124 INFO L418 AbstractCegarLoop]: === Iteration 25 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:24:36,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:24:36,125 INFO L82 PathProgramCache]: Analyzing trace with hash 2050601411, now seen corresponding path program 1 times [2019-09-07 20:24:36,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:24:36,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:24:36,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:24:36,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:24:36,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:24:36,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:24:37,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3327 backedges. 692 proven. 317 refuted. 0 times theorem prover too weak. 2318 trivial. 0 not checked. [2019-09-07 20:24:37,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:24:37,217 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:24:37,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:24:37,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:24:37,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 1662 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 20:24:37,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:24:37,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:24:37,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:24:38,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3327 backedges. 1825 proven. 2 refuted. 0 times theorem prover too weak. 1500 trivial. 0 not checked. [2019-09-07 20:24:38,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:24:38,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2019-09-07 20:24:38,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:24:38,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:24:38,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:24:38,333 INFO L87 Difference]: Start difference. First operand 76295 states and 78765 transitions. Second operand 9 states. [2019-09-07 20:24:46,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:24:46,340 INFO L93 Difference]: Finished difference Result 122267 states and 126183 transitions. [2019-09-07 20:24:46,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 20:24:46,341 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1247 [2019-09-07 20:24:46,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:24:46,342 INFO L225 Difference]: With dead ends: 122267 [2019-09-07 20:24:46,342 INFO L226 Difference]: Without dead ends: 0 [2019-09-07 20:24:46,423 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1276 GetRequests, 1256 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2019-09-07 20:24:46,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-07 20:24:46,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-07 20:24:46,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-07 20:24:46,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-07 20:24:46,424 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1247 [2019-09-07 20:24:46,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:24:46,424 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-07 20:24:46,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:24:46,424 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-07 20:24:46,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-07 20:24:46,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-07 20:24:51,477 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-09-07 20:25:34,960 WARN L188 SmtUtils]: Spent 41.61 s on a formula simplification. DAG size of input: 4887 DAG size of output: 3926 [2019-09-07 20:26:14,804 WARN L188 SmtUtils]: Spent 39.83 s on a formula simplification. DAG size of input: 4887 DAG size of output: 3926 [2019-09-07 20:26:17,527 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 33