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/Problem12_label17.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 18:46:52,616 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 18:46:52,618 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 18:46:52,629 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 18:46:52,630 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 18:46:52,631 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 18:46:52,632 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 18:46:52,634 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 18:46:52,635 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 18:46:52,636 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 18:46:52,637 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 18:46:52,638 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 18:46:52,639 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 18:46:52,639 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 18:46:52,640 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 18:46:52,641 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 18:46:52,642 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 18:46:52,643 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 18:46:52,645 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 18:46:52,647 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 18:46:52,652 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 18:46:52,653 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 18:46:52,656 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 18:46:52,657 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 18:46:52,661 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 18:46:52,662 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 18:46:52,662 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 18:46:52,663 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 18:46:52,664 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 18:46:52,665 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 18:46:52,665 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 18:46:52,666 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 18:46:52,667 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 18:46:52,670 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 18:46:52,671 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 18:46:52,671 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 18:46:52,671 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 18:46:52,672 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 18:46:52,672 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 18:46:52,674 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 18:46:52,675 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 18:46:52,677 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 18:46:52,693 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 18:46:52,693 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 18:46:52,695 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 18:46:52,695 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 18:46:52,695 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 18:46:52,695 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 18:46:52,695 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 18:46:52,696 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 18:46:52,696 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 18:46:52,696 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 18:46:52,696 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 18:46:52,696 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 18:46:52,697 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 18:46:52,697 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 18:46:52,697 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 18:46:52,697 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 18:46:52,697 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 18:46:52,698 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 18:46:52,698 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 18:46:52,698 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 18:46:52,698 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 18:46:52,698 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 18:46:52,699 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 18:46:52,699 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 18:46:52,699 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 18:46:52,699 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 18:46:52,699 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 18:46:52,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 18:46:52,700 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 18:46:52,729 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 18:46:52,746 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 18:46:52,750 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 18:46:52,751 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 18:46:52,751 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 18:46:52,752 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label17.c [2019-09-07 18:46:52,816 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd047696e/d7781e38272f4edb8bbc2c093837eaaa/FLAGc924f7c73 [2019-09-07 18:46:53,614 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 18:46:53,616 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label17.c [2019-09-07 18:46:53,658 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd047696e/d7781e38272f4edb8bbc2c093837eaaa/FLAGc924f7c73 [2019-09-07 18:46:54,156 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd047696e/d7781e38272f4edb8bbc2c093837eaaa [2019-09-07 18:46:54,167 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 18:46:54,168 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 18:46:54,169 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 18:46:54,169 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 18:46:54,172 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 18:46:54,173 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 06:46:54" (1/1) ... [2019-09-07 18:46:54,176 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fd7f237 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:46:54, skipping insertion in model container [2019-09-07 18:46:54,176 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 06:46:54" (1/1) ... [2019-09-07 18:46:54,183 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 18:46:54,349 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 18:46:56,174 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 18:46:56,183 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 18:46:56,797 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 18:46:56,825 INFO L192 MainTranslator]: Completed translation [2019-09-07 18:46:56,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:46:56 WrapperNode [2019-09-07 18:46:56,827 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 18:46:56,827 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 18:46:56,827 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 18:46:56,828 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 18:46:56,840 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:46:56" (1/1) ... [2019-09-07 18:46:56,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:46:56" (1/1) ... [2019-09-07 18:46:56,899 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:46:56" (1/1) ... [2019-09-07 18:46:56,899 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:46:56" (1/1) ... [2019-09-07 18:46:57,000 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:46:56" (1/1) ... [2019-09-07 18:46:57,036 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:46:56" (1/1) ... [2019-09-07 18:46:57,077 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:46:56" (1/1) ... [2019-09-07 18:46:57,119 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 18:46:57,120 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 18:46:57,120 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 18:46:57,120 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 18:46:57,121 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:46:56" (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 18:46:57,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 18:46:57,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 18:46:57,184 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 18:46:57,184 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 18:46:57,184 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2019-09-07 18:46:57,184 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2019-09-07 18:46:57,184 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 18:46:57,185 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 18:46:57,185 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 18:46:57,185 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2019-09-07 18:46:57,185 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2019-09-07 18:46:57,185 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 18:46:57,186 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 18:46:57,186 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 18:46:57,187 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 18:46:57,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 18:46:57,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 18:47:01,821 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 18:47:01,821 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 18:47:01,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 06:47:01 BoogieIcfgContainer [2019-09-07 18:47:01,828 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 18:47:01,832 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 18:47:01,832 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 18:47:01,835 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 18:47:01,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 06:46:54" (1/3) ... [2019-09-07 18:47:01,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52cfb9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 06:47:01, skipping insertion in model container [2019-09-07 18:47:01,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:46:56" (2/3) ... [2019-09-07 18:47:01,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52cfb9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 06:47:01, skipping insertion in model container [2019-09-07 18:47:01,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 06:47:01" (3/3) ... [2019-09-07 18:47:01,840 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem12_label17.c [2019-09-07 18:47:01,851 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 18:47:01,860 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 18:47:01,877 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 18:47:01,925 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 18:47:01,926 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 18:47:01,926 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 18:47:01,926 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 18:47:01,927 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 18:47:01,927 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 18:47:01,927 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 18:47:01,927 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 18:47:01,927 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 18:47:01,962 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states. [2019-09-07 18:47:01,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-07 18:47:01,970 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:47:01,971 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:47:01,973 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:47:01,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:47:01,979 INFO L82 PathProgramCache]: Analyzing trace with hash 648916661, now seen corresponding path program 1 times [2019-09-07 18:47:01,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:47:01,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:47:02,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:47:02,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:47:02,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:47:02,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:47:02,257 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 18:47:02,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:47:02,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 18:47:02,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 18:47:02,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 18:47:02,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 18:47:02,282 INFO L87 Difference]: Start difference. First operand 839 states. Second operand 3 states. [2019-09-07 18:47:07,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:47:07,164 INFO L93 Difference]: Finished difference Result 2443 states and 4697 transitions. [2019-09-07 18:47:07,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 18:47:07,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-09-07 18:47:07,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:47:07,199 INFO L225 Difference]: With dead ends: 2443 [2019-09-07 18:47:07,199 INFO L226 Difference]: Without dead ends: 1542 [2019-09-07 18:47:07,210 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 18:47:07,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2019-09-07 18:47:07,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1542. [2019-09-07 18:47:07,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1542 states. [2019-09-07 18:47:07,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2750 transitions. [2019-09-07 18:47:07,344 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2750 transitions. Word has length 46 [2019-09-07 18:47:07,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:47:07,345 INFO L475 AbstractCegarLoop]: Abstraction has 1542 states and 2750 transitions. [2019-09-07 18:47:07,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 18:47:07,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2750 transitions. [2019-09-07 18:47:07,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-07 18:47:07,355 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:47:07,356 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:47:07,356 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:47:07,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:47:07,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1964642049, now seen corresponding path program 1 times [2019-09-07 18:47:07,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:47:07,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:47:07,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:47:07,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:47:07,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:47:07,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:47:07,625 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:47:07,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:47:07,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 18:47:07,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 18:47:07,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 18:47:07,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 18:47:07,628 INFO L87 Difference]: Start difference. First operand 1542 states and 2750 transitions. Second operand 5 states. [2019-09-07 18:47:14,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:47:14,013 INFO L93 Difference]: Finished difference Result 4690 states and 8403 transitions. [2019-09-07 18:47:14,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 18:47:14,015 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 119 [2019-09-07 18:47:14,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:47:14,037 INFO L225 Difference]: With dead ends: 4690 [2019-09-07 18:47:14,037 INFO L226 Difference]: Without dead ends: 3154 [2019-09-07 18:47:14,041 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 18:47:14,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3154 states. [2019-09-07 18:47:14,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3154 to 3122. [2019-09-07 18:47:14,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2019-09-07 18:47:14,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 5336 transitions. [2019-09-07 18:47:14,147 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 5336 transitions. Word has length 119 [2019-09-07 18:47:14,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:47:14,149 INFO L475 AbstractCegarLoop]: Abstraction has 3122 states and 5336 transitions. [2019-09-07 18:47:14,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 18:47:14,150 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 5336 transitions. [2019-09-07 18:47:14,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-07 18:47:14,152 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:47:14,152 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 18:47:14,152 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:47:14,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:47:14,153 INFO L82 PathProgramCache]: Analyzing trace with hash -779589284, now seen corresponding path program 1 times [2019-09-07 18:47:14,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:47:14,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:47:14,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:47:14,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:47:14,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:47:14,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:47:14,347 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:47:14,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:47:14,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 18:47:14,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 18:47:14,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 18:47:14,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 18:47:14,349 INFO L87 Difference]: Start difference. First operand 3122 states and 5336 transitions. Second operand 6 states. [2019-09-07 18:47:21,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:47:21,221 INFO L93 Difference]: Finished difference Result 9491 states and 16483 transitions. [2019-09-07 18:47:21,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 18:47:21,223 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 124 [2019-09-07 18:47:21,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:47:21,263 INFO L225 Difference]: With dead ends: 9491 [2019-09-07 18:47:21,263 INFO L226 Difference]: Without dead ends: 6375 [2019-09-07 18:47:21,271 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 18:47:21,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6375 states. [2019-09-07 18:47:21,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6375 to 6333. [2019-09-07 18:47:21,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6333 states. [2019-09-07 18:47:21,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6333 states to 6333 states and 10771 transitions. [2019-09-07 18:47:21,470 INFO L78 Accepts]: Start accepts. Automaton has 6333 states and 10771 transitions. Word has length 124 [2019-09-07 18:47:21,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:47:21,472 INFO L475 AbstractCegarLoop]: Abstraction has 6333 states and 10771 transitions. [2019-09-07 18:47:21,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 18:47:21,473 INFO L276 IsEmpty]: Start isEmpty. Operand 6333 states and 10771 transitions. [2019-09-07 18:47:21,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-07 18:47:21,477 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:47:21,477 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 18:47:21,478 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:47:21,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:47:21,478 INFO L82 PathProgramCache]: Analyzing trace with hash 876645324, now seen corresponding path program 1 times [2019-09-07 18:47:21,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:47:21,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:47:21,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:47:21,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:47:21,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:47:21,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:47:21,713 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:47:21,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:47:21,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 18:47:21,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 18:47:21,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 18:47:21,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 18:47:21,715 INFO L87 Difference]: Start difference. First operand 6333 states and 10771 transitions. Second operand 6 states. [2019-09-07 18:47:27,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:47:27,569 INFO L93 Difference]: Finished difference Result 15980 states and 27530 transitions. [2019-09-07 18:47:27,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 18:47:27,570 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 132 [2019-09-07 18:47:27,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:47:27,615 INFO L225 Difference]: With dead ends: 15980 [2019-09-07 18:47:27,616 INFO L226 Difference]: Without dead ends: 9653 [2019-09-07 18:47:27,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 18:47:27,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9653 states. [2019-09-07 18:47:27,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9653 to 9576. [2019-09-07 18:47:27,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9576 states. [2019-09-07 18:47:27,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9576 states to 9576 states and 15604 transitions. [2019-09-07 18:47:27,884 INFO L78 Accepts]: Start accepts. Automaton has 9576 states and 15604 transitions. Word has length 132 [2019-09-07 18:47:27,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:47:27,885 INFO L475 AbstractCegarLoop]: Abstraction has 9576 states and 15604 transitions. [2019-09-07 18:47:27,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 18:47:27,885 INFO L276 IsEmpty]: Start isEmpty. Operand 9576 states and 15604 transitions. [2019-09-07 18:47:27,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-07 18:47:27,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:47:27,889 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 18:47:27,889 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:47:27,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:47:27,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1432409659, now seen corresponding path program 1 times [2019-09-07 18:47:27,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:47:27,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:47:27,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:47:27,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:47:27,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:47:27,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:47:28,095 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:47:28,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:47:28,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 18:47:28,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 18:47:28,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 18:47:28,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 18:47:28,097 INFO L87 Difference]: Start difference. First operand 9576 states and 15604 transitions. Second operand 6 states. [2019-09-07 18:47:34,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:47:34,031 INFO L93 Difference]: Finished difference Result 24200 states and 40441 transitions. [2019-09-07 18:47:34,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 18:47:34,032 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 165 [2019-09-07 18:47:34,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:47:34,208 INFO L225 Difference]: With dead ends: 24200 [2019-09-07 18:47:34,209 INFO L226 Difference]: Without dead ends: 14630 [2019-09-07 18:47:34,232 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 18:47:34,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14630 states. [2019-09-07 18:47:34,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14630 to 14577. [2019-09-07 18:47:34,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14577 states. [2019-09-07 18:47:34,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14577 states to 14577 states and 21948 transitions. [2019-09-07 18:47:34,524 INFO L78 Accepts]: Start accepts. Automaton has 14577 states and 21948 transitions. Word has length 165 [2019-09-07 18:47:34,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:47:34,524 INFO L475 AbstractCegarLoop]: Abstraction has 14577 states and 21948 transitions. [2019-09-07 18:47:34,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 18:47:34,525 INFO L276 IsEmpty]: Start isEmpty. Operand 14577 states and 21948 transitions. [2019-09-07 18:47:34,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-09-07 18:47:34,531 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:47:34,531 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 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 18:47:34,532 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:47:34,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:47:34,532 INFO L82 PathProgramCache]: Analyzing trace with hash -657661340, now seen corresponding path program 1 times [2019-09-07 18:47:34,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:47:34,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:47:34,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:47:34,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:47:34,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:47:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:47:34,744 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 81 proven. 67 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-07 18:47:34,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:47:34,745 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 18:47:34,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:47:34,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:47:34,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 18:47:34,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:47:35,010 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 151 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:47:35,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:47:35,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 18:47:35,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 18:47:35,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 18:47:35,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-07 18:47:35,027 INFO L87 Difference]: Start difference. First operand 14577 states and 21948 transitions. Second operand 9 states. [2019-09-07 18:47:49,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:47:49,292 INFO L93 Difference]: Finished difference Result 44402 states and 76819 transitions. [2019-09-07 18:47:49,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-07 18:47:49,292 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 215 [2019-09-07 18:47:49,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:47:49,469 INFO L225 Difference]: With dead ends: 44402 [2019-09-07 18:47:49,470 INFO L226 Difference]: Without dead ends: 29831 [2019-09-07 18:47:49,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=252, Invalid=804, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 18:47:49,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29831 states. [2019-09-07 18:47:50,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29831 to 26070. [2019-09-07 18:47:50,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26070 states. [2019-09-07 18:47:50,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26070 states to 26070 states and 36460 transitions. [2019-09-07 18:47:50,671 INFO L78 Accepts]: Start accepts. Automaton has 26070 states and 36460 transitions. Word has length 215 [2019-09-07 18:47:50,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:47:50,673 INFO L475 AbstractCegarLoop]: Abstraction has 26070 states and 36460 transitions. [2019-09-07 18:47:50,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 18:47:50,676 INFO L276 IsEmpty]: Start isEmpty. Operand 26070 states and 36460 transitions. [2019-09-07 18:47:50,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-07 18:47:50,686 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:47:50,686 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:47:50,686 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:47:50,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:47:50,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1488254059, now seen corresponding path program 1 times [2019-09-07 18:47:50,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:47:50,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:47:50,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:47:50,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:47:50,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:47:50,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:47:50,910 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 78 proven. 69 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 18:47:50,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:47:50,911 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 18:47:51,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:47:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:47:51,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 18:47:51,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:47:51,279 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-09-07 18:47:51,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 18:47:51,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2019-09-07 18:47:51,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 18:47:51,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 18:47:51,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-07 18:47:51,296 INFO L87 Difference]: Start difference. First operand 26070 states and 36460 transitions. Second operand 6 states. [2019-09-07 18:47:59,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:47:59,403 INFO L93 Difference]: Finished difference Result 74524 states and 110091 transitions. [2019-09-07 18:47:59,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 18:47:59,404 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 240 [2019-09-07 18:47:59,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:47:59,554 INFO L225 Difference]: With dead ends: 74524 [2019-09-07 18:47:59,555 INFO L226 Difference]: Without dead ends: 48460 [2019-09-07 18:47:59,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-09-07 18:47:59,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48460 states. [2019-09-07 18:48:00,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48460 to 44829. [2019-09-07 18:48:00,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44829 states. [2019-09-07 18:48:00,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44829 states to 44829 states and 61156 transitions. [2019-09-07 18:48:00,496 INFO L78 Accepts]: Start accepts. Automaton has 44829 states and 61156 transitions. Word has length 240 [2019-09-07 18:48:00,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:48:00,497 INFO L475 AbstractCegarLoop]: Abstraction has 44829 states and 61156 transitions. [2019-09-07 18:48:00,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 18:48:00,497 INFO L276 IsEmpty]: Start isEmpty. Operand 44829 states and 61156 transitions. [2019-09-07 18:48:00,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-09-07 18:48:00,503 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:48:00,503 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:48:00,503 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:48:00,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:48:00,504 INFO L82 PathProgramCache]: Analyzing trace with hash -996883098, now seen corresponding path program 1 times [2019-09-07 18:48:00,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:48:00,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:48:00,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:48:00,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:48:00,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:48:00,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:48:01,937 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-07 18:48:01,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:48:01,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 18:48:01,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 18:48:01,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 18:48:01,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 18:48:01,939 INFO L87 Difference]: Start difference. First operand 44829 states and 61156 transitions. Second operand 4 states. [2019-09-07 18:48:09,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:48:09,218 INFO L93 Difference]: Finished difference Result 113083 states and 157112 transitions. [2019-09-07 18:48:09,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 18:48:09,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 267 [2019-09-07 18:48:09,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:48:09,422 INFO L225 Difference]: With dead ends: 113083 [2019-09-07 18:48:09,422 INFO L226 Difference]: Without dead ends: 68260 [2019-09-07 18:48:09,490 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 18:48:09,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68260 states. [2019-09-07 18:48:12,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68260 to 66676. [2019-09-07 18:48:12,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66676 states. [2019-09-07 18:48:12,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66676 states to 66676 states and 90710 transitions. [2019-09-07 18:48:12,558 INFO L78 Accepts]: Start accepts. Automaton has 66676 states and 90710 transitions. Word has length 267 [2019-09-07 18:48:12,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:48:12,559 INFO L475 AbstractCegarLoop]: Abstraction has 66676 states and 90710 transitions. [2019-09-07 18:48:12,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 18:48:12,559 INFO L276 IsEmpty]: Start isEmpty. Operand 66676 states and 90710 transitions. [2019-09-07 18:48:12,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-09-07 18:48:12,570 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:48:12,571 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:48:12,571 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:48:12,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:48:12,571 INFO L82 PathProgramCache]: Analyzing trace with hash 687577576, now seen corresponding path program 1 times [2019-09-07 18:48:12,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:48:12,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:48:12,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:48:12,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:48:12,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:48:12,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:48:12,889 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 151 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:48:12,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:48: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 18:48:12,911 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 18:48:13,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:48:13,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 18:48:13,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:48:13,117 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 151 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 18:48:13,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:48:13,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 18:48:13,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 18:48:13,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 18:48:13,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 18:48:13,125 INFO L87 Difference]: Start difference. First operand 66676 states and 90710 transitions. Second operand 9 states. [2019-09-07 18:48:24,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:48:24,605 INFO L93 Difference]: Finished difference Result 161809 states and 240320 transitions. [2019-09-07 18:48:24,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 18:48:24,607 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 325 [2019-09-07 18:48:24,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:48:24,930 INFO L225 Difference]: With dead ends: 161809 [2019-09-07 18:48:24,931 INFO L226 Difference]: Without dead ends: 86900 [2019-09-07 18:48:25,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-09-07 18:48:25,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86900 states. [2019-09-07 18:48:27,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86900 to 79552. [2019-09-07 18:48:27,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79552 states. [2019-09-07 18:48:27,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79552 states to 79552 states and 107846 transitions. [2019-09-07 18:48:27,605 INFO L78 Accepts]: Start accepts. Automaton has 79552 states and 107846 transitions. Word has length 325 [2019-09-07 18:48:27,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:48:27,609 INFO L475 AbstractCegarLoop]: Abstraction has 79552 states and 107846 transitions. [2019-09-07 18:48:27,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 18:48:27,609 INFO L276 IsEmpty]: Start isEmpty. Operand 79552 states and 107846 transitions. [2019-09-07 18:48:27,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2019-09-07 18:48:27,627 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:48:27,627 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:48:27,627 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:48:27,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:48:27,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1851928877, now seen corresponding path program 1 times [2019-09-07 18:48:27,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:48:27,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:48:27,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:48:27,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:48:27,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:48:27,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:48:27,909 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 285 proven. 2 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-07 18:48:27,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:48:27,909 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 18:48:27,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:48:28,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:48:28,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 18:48:28,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:48:28,177 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 285 proven. 2 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-07 18:48:28,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:48:28,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 18:48:28,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 18:48:28,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 18:48:28,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 18:48:28,191 INFO L87 Difference]: Start difference. First operand 79552 states and 107846 transitions. Second operand 9 states. [2019-09-07 18:48:42,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:48:42,097 INFO L93 Difference]: Finished difference Result 185540 states and 269913 transitions. [2019-09-07 18:48:42,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 18:48:42,097 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 361 [2019-09-07 18:48:42,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:48:42,471 INFO L225 Difference]: With dead ends: 185540 [2019-09-07 18:48:42,471 INFO L226 Difference]: Without dead ends: 105994 [2019-09-07 18:48:42,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-09-07 18:48:42,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105994 states. [2019-09-07 18:48:44,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105994 to 104144. [2019-09-07 18:48:44,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104144 states. [2019-09-07 18:48:44,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104144 states to 104144 states and 144397 transitions. [2019-09-07 18:48:44,764 INFO L78 Accepts]: Start accepts. Automaton has 104144 states and 144397 transitions. Word has length 361 [2019-09-07 18:48:44,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:48:44,765 INFO L475 AbstractCegarLoop]: Abstraction has 104144 states and 144397 transitions. [2019-09-07 18:48:44,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 18:48:44,765 INFO L276 IsEmpty]: Start isEmpty. Operand 104144 states and 144397 transitions. [2019-09-07 18:48:44,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2019-09-07 18:48:44,791 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:48:44,791 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:48:44,791 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:48:44,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:48:44,792 INFO L82 PathProgramCache]: Analyzing trace with hash -656871621, now seen corresponding path program 1 times [2019-09-07 18:48:44,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:48:44,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:48:44,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:48:44,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:48:44,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:48:44,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:48:45,105 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 224 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:48:45,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:48:45,105 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 18:48:45,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:48:45,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:48:45,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 18:48:45,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:48:45,351 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 224 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:48:45,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:48:45,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 18:48:45,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 18:48:45,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 18:48:45,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 18:48:45,366 INFO L87 Difference]: Start difference. First operand 104144 states and 144397 transitions. Second operand 9 states. [2019-09-07 18:48:56,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:48:56,911 INFO L93 Difference]: Finished difference Result 219350 states and 301157 transitions. [2019-09-07 18:48:56,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 18:48:56,912 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 398 [2019-09-07 18:48:56,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:48:57,175 INFO L225 Difference]: With dead ends: 219350 [2019-09-07 18:48:57,175 INFO L226 Difference]: Without dead ends: 115216 [2019-09-07 18:48:57,344 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 399 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-09-07 18:48:57,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115216 states. [2019-09-07 18:48:58,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115216 to 108076. [2019-09-07 18:48:58,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108076 states. [2019-09-07 18:49:03,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108076 states to 108076 states and 126181 transitions. [2019-09-07 18:49:03,250 INFO L78 Accepts]: Start accepts. Automaton has 108076 states and 126181 transitions. Word has length 398 [2019-09-07 18:49:03,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:49:03,251 INFO L475 AbstractCegarLoop]: Abstraction has 108076 states and 126181 transitions. [2019-09-07 18:49:03,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 18:49:03,251 INFO L276 IsEmpty]: Start isEmpty. Operand 108076 states and 126181 transitions. [2019-09-07 18:49:03,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2019-09-07 18:49:03,268 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:49:03,269 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:49:03,269 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:49:03,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:49:03,270 INFO L82 PathProgramCache]: Analyzing trace with hash -850445221, now seen corresponding path program 1 times [2019-09-07 18:49:03,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:49:03,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:49:03,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:49:03,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:49:03,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:49:03,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:49:03,491 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-09-07 18:49:03,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:49:03,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 18:49:03,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 18:49:03,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 18:49:03,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 18:49:03,493 INFO L87 Difference]: Start difference. First operand 108076 states and 126181 transitions. Second operand 3 states. [2019-09-07 18:49:07,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:49:07,948 INFO L93 Difference]: Finished difference Result 236976 states and 278594 transitions. [2019-09-07 18:49:07,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 18:49:07,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 414 [2019-09-07 18:49:07,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:49:08,836 INFO L225 Difference]: With dead ends: 236976 [2019-09-07 18:49:08,836 INFO L226 Difference]: Without dead ends: 128910 [2019-09-07 18:49:08,923 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 18:49:09,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128910 states. [2019-09-07 18:49:10,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128910 to 122718. [2019-09-07 18:49:10,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122718 states. [2019-09-07 18:49:10,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122718 states to 122718 states and 142628 transitions. [2019-09-07 18:49:10,248 INFO L78 Accepts]: Start accepts. Automaton has 122718 states and 142628 transitions. Word has length 414 [2019-09-07 18:49:10,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:49:10,249 INFO L475 AbstractCegarLoop]: Abstraction has 122718 states and 142628 transitions. [2019-09-07 18:49:10,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 18:49:10,250 INFO L276 IsEmpty]: Start isEmpty. Operand 122718 states and 142628 transitions. [2019-09-07 18:49:10,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1100 [2019-09-07 18:49:10,377 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:49:10,378 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:49:10,378 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:49:10,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:49:10,379 INFO L82 PathProgramCache]: Analyzing trace with hash 227959630, now seen corresponding path program 1 times [2019-09-07 18:49:10,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:49:10,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:49:10,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:49:10,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:49:10,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:49:10,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:49:12,276 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 156 proven. 350 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2019-09-07 18:49:12,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:49:12,277 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:49:12,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:49:12,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:49:12,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 1453 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 18:49:12,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:49:13,471 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2019-09-07 18:49:13,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 18:49:13,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 18:49:13,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 18:49:13,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 18:49:13,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 18:49:13,479 INFO L87 Difference]: Start difference. First operand 122718 states and 142628 transitions. Second operand 9 states. [2019-09-07 18:49:23,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:49:23,751 INFO L93 Difference]: Finished difference Result 269482 states and 315123 transitions. [2019-09-07 18:49:23,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 18:49:23,754 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1099 [2019-09-07 18:49:23,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:49:24,026 INFO L225 Difference]: With dead ends: 269482 [2019-09-07 18:49:24,027 INFO L226 Difference]: Without dead ends: 144433 [2019-09-07 18:49:24,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1125 GetRequests, 1107 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2019-09-07 18:49:24,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144433 states. [2019-09-07 18:49:25,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144433 to 131228. [2019-09-07 18:49:25,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131228 states. [2019-09-07 18:49:25,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131228 states to 131228 states and 148550 transitions. [2019-09-07 18:49:25,885 INFO L78 Accepts]: Start accepts. Automaton has 131228 states and 148550 transitions. Word has length 1099 [2019-09-07 18:49:25,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:49:25,885 INFO L475 AbstractCegarLoop]: Abstraction has 131228 states and 148550 transitions. [2019-09-07 18:49:25,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 18:49:25,886 INFO L276 IsEmpty]: Start isEmpty. Operand 131228 states and 148550 transitions. [2019-09-07 18:49:26,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1242 [2019-09-07 18:49:26,030 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:49:26,031 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:49:26,032 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:49:26,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:49:26,032 INFO L82 PathProgramCache]: Analyzing trace with hash 2130395650, now seen corresponding path program 1 times [2019-09-07 18:49:26,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:49:26,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:49:26,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:49:26,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:49:26,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:49:26,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:49:29,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1557 backedges. 972 proven. 6 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2019-09-07 18:49:29,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:49:29,796 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 18:49:29,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:49:30,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:49:30,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 1690 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 18:49:30,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:49:31,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1557 backedges. 748 proven. 2 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2019-09-07 18:49:31,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:49:31,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-07 18:49:31,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 18:49:31,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 18:49:31,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-07 18:49:31,181 INFO L87 Difference]: Start difference. First operand 131228 states and 148550 transitions. Second operand 6 states. [2019-09-07 18:49:41,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:49:41,569 INFO L93 Difference]: Finished difference Result 316293 states and 363356 transitions. [2019-09-07 18:49:41,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 18:49:41,569 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1241 [2019-09-07 18:49:41,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:49:41,908 INFO L225 Difference]: With dead ends: 316293 [2019-09-07 18:49:41,908 INFO L226 Difference]: Without dead ends: 185838 [2019-09-07 18:49:42,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1261 GetRequests, 1251 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-09-07 18:49:42,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185838 states. [2019-09-07 18:49:44,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185838 to 172460. [2019-09-07 18:49:44,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172460 states. [2019-09-07 18:49:44,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172460 states to 172460 states and 194332 transitions. [2019-09-07 18:49:44,306 INFO L78 Accepts]: Start accepts. Automaton has 172460 states and 194332 transitions. Word has length 1241 [2019-09-07 18:49:44,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:49:44,306 INFO L475 AbstractCegarLoop]: Abstraction has 172460 states and 194332 transitions. [2019-09-07 18:49:44,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 18:49:44,307 INFO L276 IsEmpty]: Start isEmpty. Operand 172460 states and 194332 transitions. [2019-09-07 18:49:44,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1207 [2019-09-07 18:49:44,436 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:49:44,437 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:49:44,437 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:49:44,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:49:44,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1589990133, now seen corresponding path program 1 times [2019-09-07 18:49:44,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:49:44,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:49:44,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:49:44,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:49:44,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:49:44,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:49:51,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1049 backedges. 589 proven. 42 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2019-09-07 18:49:51,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:49:51,425 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 18:49:51,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:49:51,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:49:51,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 1562 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 18:49:51,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:49:51,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:49:52,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1049 backedges. 629 proven. 2 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2019-09-07 18:49:52,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:49:52,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 5] total 20 [2019-09-07 18:49:52,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 18:49:52,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 18:49:52,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2019-09-07 18:49:52,526 INFO L87 Difference]: Start difference. First operand 172460 states and 194332 transitions. Second operand 20 states. [2019-09-07 18:49:56,085 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-09-07 18:50:23,718 WARN L188 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 28 [2019-09-07 18:50:24,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:50:24,920 INFO L93 Difference]: Finished difference Result 436365 states and 502286 transitions. [2019-09-07 18:50:24,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-07 18:50:24,920 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1206 [2019-09-07 18:50:24,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:50:25,494 INFO L225 Difference]: With dead ends: 436365 [2019-09-07 18:50:25,495 INFO L226 Difference]: Without dead ends: 264678 [2019-09-07 18:50:25,645 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1333 GetRequests, 1256 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1841 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1301, Invalid=4705, Unknown=0, NotChecked=0, Total=6006 [2019-09-07 18:50:25,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264678 states. [2019-09-07 18:50:28,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264678 to 254323. [2019-09-07 18:50:28,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254323 states. [2019-09-07 18:50:28,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254323 states to 254323 states and 285235 transitions. [2019-09-07 18:50:28,892 INFO L78 Accepts]: Start accepts. Automaton has 254323 states and 285235 transitions. Word has length 1206 [2019-09-07 18:50:28,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:50:28,894 INFO L475 AbstractCegarLoop]: Abstraction has 254323 states and 285235 transitions. [2019-09-07 18:50:28,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 18:50:28,894 INFO L276 IsEmpty]: Start isEmpty. Operand 254323 states and 285235 transitions. [2019-09-07 18:50:29,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1450 [2019-09-07 18:50:29,124 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:50:29,125 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:50:29,126 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:50:29,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:50:29,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1135200951, now seen corresponding path program 1 times [2019-09-07 18:50:29,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:50:29,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:50:29,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:50:29,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:50:29,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:50:29,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:50:31,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1608 backedges. 935 proven. 85 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2019-09-07 18:50:31,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:50:31,770 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:50:31,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:50:32,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:50:32,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 1874 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 18:50:32,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:50:32,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:50:34,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1608 backedges. 553 proven. 0 refuted. 0 times theorem prover too weak. 1055 trivial. 0 not checked. [2019-09-07 18:50:34,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 18:50:34,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2019-09-07 18:50:34,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 18:50:34,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 18:50:34,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-09-07 18:50:34,455 INFO L87 Difference]: Start difference. First operand 254323 states and 285235 transitions. Second operand 12 states. [2019-09-07 18:51:13,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:51:13,002 INFO L93 Difference]: Finished difference Result 622688 states and 687542 transitions. [2019-09-07 18:51:13,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-09-07 18:51:13,002 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 1449 [2019-09-07 18:51:13,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:51:13,709 INFO L225 Difference]: With dead ends: 622688 [2019-09-07 18:51:13,710 INFO L226 Difference]: Without dead ends: 368363 [2019-09-07 18:51:14,509 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1573 GetRequests, 1508 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1471 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=751, Invalid=3671, Unknown=0, NotChecked=0, Total=4422 [2019-09-07 18:51:14,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368363 states. [2019-09-07 18:51:21,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368363 to 339753. [2019-09-07 18:51:21,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339753 states. [2019-09-07 18:51:22,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339753 states to 339753 states and 370971 transitions. [2019-09-07 18:51:22,849 INFO L78 Accepts]: Start accepts. Automaton has 339753 states and 370971 transitions. Word has length 1449 [2019-09-07 18:51:22,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:51:22,849 INFO L475 AbstractCegarLoop]: Abstraction has 339753 states and 370971 transitions. [2019-09-07 18:51:22,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 18:51:22,849 INFO L276 IsEmpty]: Start isEmpty. Operand 339753 states and 370971 transitions. [2019-09-07 18:51:23,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1513 [2019-09-07 18:51:23,081 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:51:23,082 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:51:23,083 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:51:23,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:51:23,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1824372033, now seen corresponding path program 1 times [2019-09-07 18:51:23,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:51:23,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:51:23,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:51:23,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:51:23,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:51:23,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:51:29,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1314 backedges. 457 proven. 131 refuted. 0 times theorem prover too weak. 726 trivial. 0 not checked. [2019-09-07 18:51:29,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:51:29,167 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 18:51:29,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:51:29,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:51:29,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 1893 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 18:51:29,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:51:29,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:51:29,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:51:29,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:51:29,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:51:29,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:51:29,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:51:29,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:51:29,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:51:48,486 WARN L188 SmtUtils]: Spent 16.75 s on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-07 18:51:50,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 18:51:56,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 18:52:01,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 18:52:02,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1314 backedges. 896 proven. 41 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2019-09-07 18:52:02,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:52:02,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2019-09-07 18:52:02,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 18:52:02,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 18:52:02,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=111, Unknown=1, NotChecked=0, Total=156 [2019-09-07 18:52:02,865 INFO L87 Difference]: Start difference. First operand 339753 states and 370971 transitions. Second operand 13 states. [2019-09-07 18:53:35,496 WARN L188 SmtUtils]: Spent 8.29 s on a formula simplification that was a NOOP. DAG size: 51 [2019-09-07 18:54:16,256 WARN L188 SmtUtils]: Spent 16.72 s on a formula simplification that was a NOOP. DAG size: 54 [2019-09-07 18:54:36,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:54:36,677 INFO L93 Difference]: Finished difference Result 837164 states and 920757 transitions. [2019-09-07 18:54:36,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-07 18:54:36,677 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 1512 [2019-09-07 18:54:36,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:54:36,683 INFO L225 Difference]: With dead ends: 837164 [2019-09-07 18:54:36,683 INFO L226 Difference]: Without dead ends: 0 [2019-09-07 18:54:37,153 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1566 GetRequests, 1528 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 62.9s TimeCoverageRelationStatistics Valid=325, Invalid=727, Unknown=4, NotChecked=0, Total=1056 [2019-09-07 18:54:37,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-07 18:54:37,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-07 18:54:37,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-07 18:54:37,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-07 18:54:37,157 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1512 [2019-09-07 18:54:37,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:54:37,158 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-07 18:54:37,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 18:54:37,158 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-07 18:54:37,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-07 18:54:37,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-07 18:56:02,659 WARN L188 SmtUtils]: Spent 1.19 m on a formula simplification. DAG size of input: 2956 DAG size of output: 2709 [2019-09-07 18:57:15,042 WARN L188 SmtUtils]: Spent 1.21 m on a formula simplification. DAG size of input: 2956 DAG size of output: 2709 [2019-09-07 18:57:52,488 WARN L188 SmtUtils]: Spent 37.30 s on a formula simplification. DAG size of input: 1976 DAG size of output: 210 [2019-09-07 18:58:29,540 WARN L188 SmtUtils]: Spent 36.84 s on a formula simplification. DAG size of input: 1976 DAG size of output: 210 [2019-09-07 18:59:06,352 WARN L188 SmtUtils]: Spent 36.70 s on a formula simplification. DAG size of input: 1976 DAG size of output: 210