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/Problem18_label34.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 22:36:35,922 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 22:36:35,924 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 22:36:35,936 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 22:36:35,936 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 22:36:35,938 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 22:36:35,939 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 22:36:35,941 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 22:36:35,942 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 22:36:35,943 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 22:36:35,944 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 22:36:35,945 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 22:36:35,946 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 22:36:35,947 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 22:36:35,947 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 22:36:35,949 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 22:36:35,949 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 22:36:35,950 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 22:36:35,952 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 22:36:35,954 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 22:36:35,956 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 22:36:35,957 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 22:36:35,958 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 22:36:35,959 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 22:36:35,961 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 22:36:35,961 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 22:36:35,961 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 22:36:35,962 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 22:36:35,963 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 22:36:35,963 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 22:36:35,964 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 22:36:35,964 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 22:36:35,965 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 22:36:35,966 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 22:36:35,967 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 22:36:35,967 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 22:36:35,968 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 22:36:35,968 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 22:36:35,968 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 22:36:35,969 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 22:36:35,970 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 22:36:35,971 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 22:36:35,985 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 22:36:35,985 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 22:36:35,986 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 22:36:35,987 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 22:36:35,987 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 22:36:35,987 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 22:36:35,987 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 22:36:35,988 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 22:36:35,988 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 22:36:35,988 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 22:36:35,988 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 22:36:35,988 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 22:36:35,989 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 22:36:35,989 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 22:36:35,989 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 22:36:35,989 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 22:36:35,989 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 22:36:35,990 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 22:36:35,990 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 22:36:35,990 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 22:36:35,990 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 22:36:35,990 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 22:36:35,991 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 22:36:35,991 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 22:36:35,991 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 22:36:35,991 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 22:36:35,992 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 22:36:35,992 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 22:36:35,992 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 22:36:36,019 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 22:36:36,033 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 22:36:36,037 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 22:36:36,038 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 22:36:36,038 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 22:36:36,039 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem18_label34.c [2019-09-07 22:36:36,102 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a20cfd608/1c81da218dff4276b64e26a93715bcec/FLAG544d89f92 [2019-09-07 22:36:36,806 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 22:36:36,808 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem18_label34.c [2019-09-07 22:36:36,834 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a20cfd608/1c81da218dff4276b64e26a93715bcec/FLAG544d89f92 [2019-09-07 22:36:36,981 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a20cfd608/1c81da218dff4276b64e26a93715bcec [2019-09-07 22:36:36,995 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 22:36:36,997 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 22:36:37,000 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 22:36:37,001 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 22:36:37,004 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 22:36:37,005 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:36:36" (1/1) ... [2019-09-07 22:36:37,008 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24c983d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:36:37, skipping insertion in model container [2019-09-07 22:36:37,009 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:36:36" (1/1) ... [2019-09-07 22:36:37,017 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 22:36:37,149 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 22:36:38,453 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 22:36:38,464 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 22:36:38,931 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 22:36:38,969 INFO L192 MainTranslator]: Completed translation [2019-09-07 22:36:38,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:36:38 WrapperNode [2019-09-07 22:36:38,970 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 22:36:38,972 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 22:36:38,972 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 22:36:38,972 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 22:36:38,995 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:36:38" (1/1) ... [2019-09-07 22:36:38,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:36:38" (1/1) ... [2019-09-07 22:36:39,080 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:36:38" (1/1) ... [2019-09-07 22:36:39,082 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:36:38" (1/1) ... [2019-09-07 22:36:39,209 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:36:38" (1/1) ... [2019-09-07 22:36:39,265 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:36:38" (1/1) ... [2019-09-07 22:36:39,393 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:36:38" (1/1) ... [2019-09-07 22:36:39,433 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 22:36:39,434 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 22:36:39,434 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 22:36:39,435 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 22:36:39,436 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:36:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 22:36:39,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 22:36:39,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 22:36:39,541 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 22:36:39,541 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 22:36:39,541 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2019-09-07 22:36:39,541 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 22:36:39,542 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 22:36:39,542 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 22:36:39,542 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2019-09-07 22:36:39,542 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 22:36:39,542 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 22:36:39,543 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 22:36:39,545 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 22:36:39,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 22:36:39,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 22:36:43,600 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 22:36:43,600 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 22:36:43,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:36:43 BoogieIcfgContainer [2019-09-07 22:36:43,602 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 22:36:43,604 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 22:36:43,604 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 22:36:43,608 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 22:36:43,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 10:36:36" (1/3) ... [2019-09-07 22:36:43,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fefb44a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:36:43, skipping insertion in model container [2019-09-07 22:36:43,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:36:38" (2/3) ... [2019-09-07 22:36:43,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fefb44a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:36:43, skipping insertion in model container [2019-09-07 22:36:43,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:36:43" (3/3) ... [2019-09-07 22:36:43,614 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem18_label34.c [2019-09-07 22:36:43,624 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 22:36:43,633 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 22:36:43,650 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 22:36:43,690 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 22:36:43,691 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 22:36:43,691 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 22:36:43,692 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 22:36:43,692 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 22:36:43,692 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 22:36:43,692 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 22:36:43,692 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 22:36:43,692 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 22:36:43,729 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states. [2019-09-07 22:36:43,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-07 22:36:43,736 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:36:43,737 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:36:43,739 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:36:43,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:36:43,745 INFO L82 PathProgramCache]: Analyzing trace with hash -415244174, now seen corresponding path program 1 times [2019-09-07 22:36:43,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:36:43,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:36:43,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:36:43,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:36:43,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:36:43,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:36:43,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:36:43,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:36:43,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 22:36:43,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 22:36:43,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 22:36:43,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 22:36:43,998 INFO L87 Difference]: Start difference. First operand 774 states. Second operand 3 states. [2019-09-07 22:36:48,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:36:48,677 INFO L93 Difference]: Finished difference Result 2248 states and 4319 transitions. [2019-09-07 22:36:48,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 22:36:48,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-09-07 22:36:48,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:36:48,710 INFO L225 Difference]: With dead ends: 2248 [2019-09-07 22:36:48,710 INFO L226 Difference]: Without dead ends: 1412 [2019-09-07 22:36:48,722 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 22:36:48,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2019-09-07 22:36:48,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1412. [2019-09-07 22:36:48,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1412 states. [2019-09-07 22:36:48,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2558 transitions. [2019-09-07 22:36:48,870 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 2558 transitions. Word has length 13 [2019-09-07 22:36:48,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:36:48,871 INFO L475 AbstractCegarLoop]: Abstraction has 1412 states and 2558 transitions. [2019-09-07 22:36:48,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 22:36:48,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 2558 transitions. [2019-09-07 22:36:48,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-07 22:36:48,875 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:36:48,875 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:36:48,876 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:36:48,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:36:48,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1856276731, now seen corresponding path program 1 times [2019-09-07 22:36:48,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:36:48,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:36:48,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:36:48,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:36:48,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:36:48,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:36:49,115 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:36:49,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:36:49,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 22:36:49,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 22:36:49,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 22:36:49,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 22:36:49,118 INFO L87 Difference]: Start difference. First operand 1412 states and 2558 transitions. Second operand 5 states. [2019-09-07 22:36:54,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:36:54,401 INFO L93 Difference]: Finished difference Result 3572 states and 6416 transitions. [2019-09-07 22:36:54,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 22:36:54,402 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-09-07 22:36:54,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:36:54,416 INFO L225 Difference]: With dead ends: 3572 [2019-09-07 22:36:54,417 INFO L226 Difference]: Without dead ends: 2166 [2019-09-07 22:36:54,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 22:36:54,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2166 states. [2019-09-07 22:36:54,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2166 to 2146. [2019-09-07 22:36:54,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2146 states. [2019-09-07 22:36:54,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2146 states to 2146 states and 3628 transitions. [2019-09-07 22:36:54,499 INFO L78 Accepts]: Start accepts. Automaton has 2146 states and 3628 transitions. Word has length 84 [2019-09-07 22:36:54,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:36:54,501 INFO L475 AbstractCegarLoop]: Abstraction has 2146 states and 3628 transitions. [2019-09-07 22:36:54,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 22:36:54,501 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 3628 transitions. [2019-09-07 22:36:54,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-07 22:36:54,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:36:54,512 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 22:36:54,513 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:36:54,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:36:54,513 INFO L82 PathProgramCache]: Analyzing trace with hash 94685542, now seen corresponding path program 1 times [2019-09-07 22:36:54,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:36:54,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:36:54,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:36:54,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:36:54,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:36:54,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:36:54,798 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:36:54,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:36:54,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 22:36:54,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 22:36:54,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 22:36:54,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 22:36:54,800 INFO L87 Difference]: Start difference. First operand 2146 states and 3628 transitions. Second operand 6 states. [2019-09-07 22:36:59,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:36:59,628 INFO L93 Difference]: Finished difference Result 5051 states and 8506 transitions. [2019-09-07 22:36:59,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 22:36:59,630 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 107 [2019-09-07 22:36:59,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:36:59,649 INFO L225 Difference]: With dead ends: 5051 [2019-09-07 22:36:59,650 INFO L226 Difference]: Without dead ends: 2911 [2019-09-07 22:36:59,656 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 22:36:59,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2019-09-07 22:36:59,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 2887. [2019-09-07 22:36:59,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2887 states. [2019-09-07 22:36:59,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2887 states to 2887 states and 4487 transitions. [2019-09-07 22:36:59,764 INFO L78 Accepts]: Start accepts. Automaton has 2887 states and 4487 transitions. Word has length 107 [2019-09-07 22:36:59,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:36:59,765 INFO L475 AbstractCegarLoop]: Abstraction has 2887 states and 4487 transitions. [2019-09-07 22:36:59,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 22:36:59,765 INFO L276 IsEmpty]: Start isEmpty. Operand 2887 states and 4487 transitions. [2019-09-07 22:36:59,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-07 22:36:59,770 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:36:59,770 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 22:36:59,771 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:36:59,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:36:59,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1438164818, now seen corresponding path program 1 times [2019-09-07 22:36:59,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:36:59,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:36:59,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:36:59,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:36:59,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:36:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:36:59,940 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:36:59,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:36:59,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 22:36:59,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 22:36:59,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 22:36:59,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 22:36:59,941 INFO L87 Difference]: Start difference. First operand 2887 states and 4487 transitions. Second operand 6 states. [2019-09-07 22:37:04,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:37:04,723 INFO L93 Difference]: Finished difference Result 6543 states and 10148 transitions. [2019-09-07 22:37:04,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 22:37:04,726 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 111 [2019-09-07 22:37:04,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:37:04,743 INFO L225 Difference]: With dead ends: 6543 [2019-09-07 22:37:04,744 INFO L226 Difference]: Without dead ends: 3662 [2019-09-07 22:37:04,751 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 22:37:04,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3662 states. [2019-09-07 22:37:04,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3662 to 3642. [2019-09-07 22:37:04,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3642 states. [2019-09-07 22:37:04,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3642 states to 3642 states and 5124 transitions. [2019-09-07 22:37:04,843 INFO L78 Accepts]: Start accepts. Automaton has 3642 states and 5124 transitions. Word has length 111 [2019-09-07 22:37:04,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:37:04,844 INFO L475 AbstractCegarLoop]: Abstraction has 3642 states and 5124 transitions. [2019-09-07 22:37:04,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 22:37:04,844 INFO L276 IsEmpty]: Start isEmpty. Operand 3642 states and 5124 transitions. [2019-09-07 22:37:04,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-07 22:37:04,847 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:37:04,847 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 22:37:04,847 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:37:04,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:37:04,848 INFO L82 PathProgramCache]: Analyzing trace with hash -259067697, now seen corresponding path program 1 times [2019-09-07 22:37:04,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:37:04,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:37:04,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:37:04,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:37:04,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:37:04,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:37:05,020 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:37:05,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:37:05,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 22:37:05,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 22:37:05,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 22:37:05,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 22:37:05,023 INFO L87 Difference]: Start difference. First operand 3642 states and 5124 transitions. Second operand 6 states. [2019-09-07 22:37:10,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:37:10,328 INFO L93 Difference]: Finished difference Result 10404 states and 14982 transitions. [2019-09-07 22:37:10,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 22:37:10,330 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-09-07 22:37:10,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:37:10,371 INFO L225 Difference]: With dead ends: 10404 [2019-09-07 22:37:10,371 INFO L226 Difference]: Without dead ends: 6768 [2019-09-07 22:37:10,381 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 22:37:10,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6768 states. [2019-09-07 22:37:10,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6768 to 6670. [2019-09-07 22:37:10,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6670 states. [2019-09-07 22:37:10,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6670 states to 6670 states and 9031 transitions. [2019-09-07 22:37:10,567 INFO L78 Accepts]: Start accepts. Automaton has 6670 states and 9031 transitions. Word has length 142 [2019-09-07 22:37:10,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:37:10,567 INFO L475 AbstractCegarLoop]: Abstraction has 6670 states and 9031 transitions. [2019-09-07 22:37:10,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 22:37:10,568 INFO L276 IsEmpty]: Start isEmpty. Operand 6670 states and 9031 transitions. [2019-09-07 22:37:10,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-07 22:37:10,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:37:10,571 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:37:10,571 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:37:10,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:37:10,572 INFO L82 PathProgramCache]: Analyzing trace with hash 88602063, now seen corresponding path program 1 times [2019-09-07 22:37:10,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:37:10,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:37:10,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:37:10,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:37:10,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:37:10,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:37:10,761 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 12 proven. 67 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 22:37:10,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:37:10,762 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:37:10,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:37:10,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:37:10,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 22:37:10,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:37:11,007 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-07 22:37:11,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 22:37:11,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2019-09-07 22:37:11,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 22:37:11,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 22:37:11,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-07 22:37:11,023 INFO L87 Difference]: Start difference. First operand 6670 states and 9031 transitions. Second operand 7 states. [2019-09-07 22:37:21,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:37:21,530 INFO L93 Difference]: Finished difference Result 26371 states and 40408 transitions. [2019-09-07 22:37:21,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 22:37:21,531 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 174 [2019-09-07 22:37:21,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:37:21,633 INFO L225 Difference]: With dead ends: 26371 [2019-09-07 22:37:21,634 INFO L226 Difference]: Without dead ends: 19707 [2019-09-07 22:37:21,659 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-09-07 22:37:21,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19707 states. [2019-09-07 22:37:22,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19707 to 19490. [2019-09-07 22:37:22,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19490 states. [2019-09-07 22:37:22,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19490 states to 19490 states and 25887 transitions. [2019-09-07 22:37:22,277 INFO L78 Accepts]: Start accepts. Automaton has 19490 states and 25887 transitions. Word has length 174 [2019-09-07 22:37:22,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:37:22,278 INFO L475 AbstractCegarLoop]: Abstraction has 19490 states and 25887 transitions. [2019-09-07 22:37:22,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 22:37:22,279 INFO L276 IsEmpty]: Start isEmpty. Operand 19490 states and 25887 transitions. [2019-09-07 22:37:22,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-07 22:37:22,287 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:37:22,287 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 22:37:22,288 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:37:22,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:37:22,288 INFO L82 PathProgramCache]: Analyzing trace with hash 108299435, now seen corresponding path program 1 times [2019-09-07 22:37:22,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:37:22,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:37:22,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:37:22,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:37:22,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:37:22,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:37:22,457 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:37:22,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:37:22,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 22:37:22,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 22:37:22,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 22:37:22,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 22:37:22,459 INFO L87 Difference]: Start difference. First operand 19490 states and 25887 transitions. Second operand 4 states. [2019-09-07 22:37:28,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:37:28,532 INFO L93 Difference]: Finished difference Result 46740 states and 62298 transitions. [2019-09-07 22:37:28,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 22:37:28,533 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 236 [2019-09-07 22:37:28,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:37:28,622 INFO L225 Difference]: With dead ends: 46740 [2019-09-07 22:37:28,622 INFO L226 Difference]: Without dead ends: 27256 [2019-09-07 22:37:28,680 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 22:37:28,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27256 states. [2019-09-07 22:37:29,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27256 to 27240. [2019-09-07 22:37:29,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27240 states. [2019-09-07 22:37:30,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27240 states to 27240 states and 33309 transitions. [2019-09-07 22:37:30,034 INFO L78 Accepts]: Start accepts. Automaton has 27240 states and 33309 transitions. Word has length 236 [2019-09-07 22:37:30,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:37:30,035 INFO L475 AbstractCegarLoop]: Abstraction has 27240 states and 33309 transitions. [2019-09-07 22:37:30,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 22:37:30,035 INFO L276 IsEmpty]: Start isEmpty. Operand 27240 states and 33309 transitions. [2019-09-07 22:37:30,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-09-07 22:37:30,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:37:30,042 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:37:30,042 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:37:30,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:37:30,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1393480994, now seen corresponding path program 1 times [2019-09-07 22:37:30,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:37:30,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:37:30,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:37:30,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:37:30,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:37:30,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:37:30,184 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-09-07 22:37:30,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:37:30,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 22:37:30,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 22:37:30,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 22:37:30,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 22:37:30,187 INFO L87 Difference]: Start difference. First operand 27240 states and 33309 transitions. Second operand 3 states. [2019-09-07 22:37:34,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:37:34,304 INFO L93 Difference]: Finished difference Result 72921 states and 90857 transitions. [2019-09-07 22:37:34,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 22:37:34,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 269 [2019-09-07 22:37:34,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:37:34,413 INFO L225 Difference]: With dead ends: 72921 [2019-09-07 22:37:34,413 INFO L226 Difference]: Without dead ends: 45687 [2019-09-07 22:37:34,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 22:37:34,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45687 states. [2019-09-07 22:37:35,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45687 to 44279. [2019-09-07 22:37:35,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44279 states. [2019-09-07 22:37:35,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44279 states to 44279 states and 53393 transitions. [2019-09-07 22:37:35,186 INFO L78 Accepts]: Start accepts. Automaton has 44279 states and 53393 transitions. Word has length 269 [2019-09-07 22:37:35,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:37:35,187 INFO L475 AbstractCegarLoop]: Abstraction has 44279 states and 53393 transitions. [2019-09-07 22:37:35,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 22:37:35,187 INFO L276 IsEmpty]: Start isEmpty. Operand 44279 states and 53393 transitions. [2019-09-07 22:37:35,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-09-07 22:37:35,196 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:37:35,197 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:37:35,197 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:37:35,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:37:35,198 INFO L82 PathProgramCache]: Analyzing trace with hash -553087174, now seen corresponding path program 1 times [2019-09-07 22:37:35,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:37:35,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:37:35,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:37:35,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:37:35,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:37:35,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:37:36,332 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 201 proven. 2 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-09-07 22:37:36,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:37:36,333 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 22:37:36,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:37:36,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:37:36,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 22:37:36,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:37:36,622 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 201 proven. 2 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-09-07 22:37:36,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:37:36,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 22:37:36,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 22:37:36,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 22:37:36,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 22:37:36,638 INFO L87 Difference]: Start difference. First operand 44279 states and 53393 transitions. Second operand 9 states. [2019-09-07 22:37:47,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:37:47,692 INFO L93 Difference]: Finished difference Result 107120 states and 136546 transitions. [2019-09-07 22:37:47,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 22:37:47,698 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 301 [2019-09-07 22:37:47,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:37:47,904 INFO L225 Difference]: With dead ends: 107120 [2019-09-07 22:37:47,904 INFO L226 Difference]: Without dead ends: 62847 [2019-09-07 22:37:47,988 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-09-07 22:37:48,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62847 states. [2019-09-07 22:37:49,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62847 to 61059. [2019-09-07 22:37:49,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61059 states. [2019-09-07 22:37:49,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61059 states to 61059 states and 72385 transitions. [2019-09-07 22:37:49,412 INFO L78 Accepts]: Start accepts. Automaton has 61059 states and 72385 transitions. Word has length 301 [2019-09-07 22:37:49,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:37:49,412 INFO L475 AbstractCegarLoop]: Abstraction has 61059 states and 72385 transitions. [2019-09-07 22:37:49,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 22:37:49,413 INFO L276 IsEmpty]: Start isEmpty. Operand 61059 states and 72385 transitions. [2019-09-07 22:37:49,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2019-09-07 22:37:49,462 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:37:49,463 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:37:49,463 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:37:49,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:37:49,463 INFO L82 PathProgramCache]: Analyzing trace with hash 518310705, now seen corresponding path program 1 times [2019-09-07 22:37:49,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:37:49,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:37:49,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:37:49,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:37:49,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:37:49,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:37:49,861 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-09-07 22:37:49,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:37:49,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 22:37:49,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 22:37:49,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 22:37:49,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 22:37:49,864 INFO L87 Difference]: Start difference. First operand 61059 states and 72385 transitions. Second operand 3 states. [2019-09-07 22:37:54,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:37:54,381 INFO L93 Difference]: Finished difference Result 136978 states and 164907 transitions. [2019-09-07 22:37:54,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 22:37:54,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 510 [2019-09-07 22:37:54,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:37:54,527 INFO L225 Difference]: With dead ends: 136978 [2019-09-07 22:37:54,527 INFO L226 Difference]: Without dead ends: 75925 [2019-09-07 22:37:54,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 22:37:54,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75925 states. [2019-09-07 22:37:57,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75925 to 75923. [2019-09-07 22:37:57,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75923 states. [2019-09-07 22:37:57,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75923 states to 75923 states and 89121 transitions. [2019-09-07 22:37:57,544 INFO L78 Accepts]: Start accepts. Automaton has 75923 states and 89121 transitions. Word has length 510 [2019-09-07 22:37:57,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:37:57,545 INFO L475 AbstractCegarLoop]: Abstraction has 75923 states and 89121 transitions. [2019-09-07 22:37:57,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 22:37:57,545 INFO L276 IsEmpty]: Start isEmpty. Operand 75923 states and 89121 transitions. [2019-09-07 22:37:57,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 637 [2019-09-07 22:37:57,628 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:37:57,629 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 22:37:57,629 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:37:57,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:37:57,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1844319870, now seen corresponding path program 1 times [2019-09-07 22:37:57,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:37:57,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:37:57,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:37:57,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:37:57,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:37:57,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:37:59,275 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 117 proven. 194 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-09-07 22:37:59,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:37:59,276 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:37:59,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:37:59,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:37:59,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 882 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 22:37:59,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:37:59,966 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 397 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-07 22:37:59,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:37:59,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5] total 16 [2019-09-07 22:37:59,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 22:37:59,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 22:37:59,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-09-07 22:37:59,972 INFO L87 Difference]: Start difference. First operand 75923 states and 89121 transitions. Second operand 16 states. [2019-09-07 22:38:22,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:38:22,587 INFO L93 Difference]: Finished difference Result 201890 states and 250394 transitions. [2019-09-07 22:38:22,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-07 22:38:22,587 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 636 [2019-09-07 22:38:22,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:38:22,875 INFO L225 Difference]: With dead ends: 201890 [2019-09-07 22:38:22,876 INFO L226 Difference]: Without dead ends: 125520 [2019-09-07 22:38:23,330 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 717 GetRequests, 663 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 890 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=627, Invalid=2453, Unknown=0, NotChecked=0, Total=3080 [2019-09-07 22:38:23,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125520 states. [2019-09-07 22:38:24,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125520 to 123008. [2019-09-07 22:38:24,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123008 states. [2019-09-07 22:38:24,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123008 states to 123008 states and 136192 transitions. [2019-09-07 22:38:24,698 INFO L78 Accepts]: Start accepts. Automaton has 123008 states and 136192 transitions. Word has length 636 [2019-09-07 22:38:24,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:38:24,699 INFO L475 AbstractCegarLoop]: Abstraction has 123008 states and 136192 transitions. [2019-09-07 22:38:24,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 22:38:24,699 INFO L276 IsEmpty]: Start isEmpty. Operand 123008 states and 136192 transitions. [2019-09-07 22:38:24,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 717 [2019-09-07 22:38:24,772 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:38:24,773 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 22:38:24,773 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:38:24,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:38:24,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1253395285, now seen corresponding path program 1 times [2019-09-07 22:38:24,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:38:24,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:38:24,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:38:24,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:38:24,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:38:24,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:38:26,493 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 262 proven. 6 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-09-07 22:38:26,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:38:26,494 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 22:38:26,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:38:26,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:38:26,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 965 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 22:38:26,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:38:26,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:38:27,448 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2019-09-07 22:38:27,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 22:38:27,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2019-09-07 22:38:27,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 22:38:27,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 22:38:27,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-07 22:38:27,455 INFO L87 Difference]: Start difference. First operand 123008 states and 136192 transitions. Second operand 10 states. [2019-09-07 22:38:42,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:38:42,929 INFO L93 Difference]: Finished difference Result 278727 states and 309033 transitions. [2019-09-07 22:38:42,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-07 22:38:42,930 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 716 [2019-09-07 22:38:42,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:38:43,224 INFO L225 Difference]: With dead ends: 278727 [2019-09-07 22:38:43,224 INFO L226 Difference]: Without dead ends: 156427 [2019-09-07 22:38:43,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 771 GetRequests, 728 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=312, Invalid=1668, Unknown=0, NotChecked=0, Total=1980 [2019-09-07 22:38:43,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156427 states. [2019-09-07 22:38:47,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156427 to 155680. [2019-09-07 22:38:47,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155680 states. [2019-09-07 22:38:47,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155680 states to 155680 states and 170588 transitions. [2019-09-07 22:38:47,921 INFO L78 Accepts]: Start accepts. Automaton has 155680 states and 170588 transitions. Word has length 716 [2019-09-07 22:38:47,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:38:47,922 INFO L475 AbstractCegarLoop]: Abstraction has 155680 states and 170588 transitions. [2019-09-07 22:38:47,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 22:38:47,922 INFO L276 IsEmpty]: Start isEmpty. Operand 155680 states and 170588 transitions. [2019-09-07 22:38:47,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 811 [2019-09-07 22:38:47,981 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:38:47,981 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 22:38:47,981 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:38:47,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:38:47,982 INFO L82 PathProgramCache]: Analyzing trace with hash -123109952, now seen corresponding path program 1 times [2019-09-07 22:38:47,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:38:47,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:38:47,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:38:47,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:38:47,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:38:48,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:38:49,073 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 23 proven. 379 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-09-07 22:38:49,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:38:49,074 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:38:49,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:38:49,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:38:49,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 1082 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 22:38:49,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:38:49,543 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 464 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-07 22:38:49,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:38:49,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 22:38:49,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 22:38:49,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 22:38:49,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 22:38:49,552 INFO L87 Difference]: Start difference. First operand 155680 states and 170588 transitions. Second operand 9 states. [2019-09-07 22:38:55,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:38:55,996 INFO L93 Difference]: Finished difference Result 310086 states and 340736 transitions. [2019-09-07 22:38:55,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 22:38:55,996 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 810 [2019-09-07 22:38:55,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:38:56,312 INFO L225 Difference]: With dead ends: 310086 [2019-09-07 22:38:56,312 INFO L226 Difference]: Without dead ends: 155114 [2019-09-07 22:38:56,442 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 838 GetRequests, 820 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-09-07 22:38:56,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155114 states. [2019-09-07 22:38:57,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155114 to 145120. [2019-09-07 22:38:57,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145120 states. [2019-09-07 22:38:58,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145120 states to 145120 states and 155579 transitions. [2019-09-07 22:38:58,002 INFO L78 Accepts]: Start accepts. Automaton has 145120 states and 155579 transitions. Word has length 810 [2019-09-07 22:38:58,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:38:58,003 INFO L475 AbstractCegarLoop]: Abstraction has 145120 states and 155579 transitions. [2019-09-07 22:38:58,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 22:38:58,003 INFO L276 IsEmpty]: Start isEmpty. Operand 145120 states and 155579 transitions. [2019-09-07 22:38:58,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 940 [2019-09-07 22:38:58,054 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:38:58,055 INFO L399 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:38:58,056 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:38:58,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:38:58,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1068484692, now seen corresponding path program 1 times [2019-09-07 22:38:58,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:38:58,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:38:58,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:38:58,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:38:58,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:38:58,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:39:01,926 INFO L134 CoverageAnalysis]: Checked inductivity of 804 backedges. 106 proven. 543 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-09-07 22:39:01,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:39:01,926 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:39:01,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:39:02,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:39:02,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 1250 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 22:39:02,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:39:02,512 INFO L134 CoverageAnalysis]: Checked inductivity of 804 backedges. 676 proven. 2 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-07 22:39:02,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:39:02,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-09-07 22:39:02,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 22:39:02,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 22:39:02,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-07 22:39:02,520 INFO L87 Difference]: Start difference. First operand 145120 states and 155579 transitions. Second operand 11 states. [2019-09-07 22:39:13,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:39:13,057 INFO L93 Difference]: Finished difference Result 304517 states and 327112 transitions. [2019-09-07 22:39:13,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 22:39:13,058 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 939 [2019-09-07 22:39:13,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:39:13,557 INFO L225 Difference]: With dead ends: 304517 [2019-09-07 22:39:13,557 INFO L226 Difference]: Without dead ends: 149406 [2019-09-07 22:39:13,776 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 982 GetRequests, 957 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=488, Unknown=0, NotChecked=0, Total=650 [2019-09-07 22:39:13,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149406 states. [2019-09-07 22:39:15,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149406 to 140923. [2019-09-07 22:39:15,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140923 states. [2019-09-07 22:39:16,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140923 states to 140923 states and 147926 transitions. [2019-09-07 22:39:16,422 INFO L78 Accepts]: Start accepts. Automaton has 140923 states and 147926 transitions. Word has length 939 [2019-09-07 22:39:16,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:39:16,422 INFO L475 AbstractCegarLoop]: Abstraction has 140923 states and 147926 transitions. [2019-09-07 22:39:16,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 22:39:16,423 INFO L276 IsEmpty]: Start isEmpty. Operand 140923 states and 147926 transitions. [2019-09-07 22:39:16,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 970 [2019-09-07 22:39:16,462 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:39:16,463 INFO L399 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:39:16,463 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:39:16,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:39:16,464 INFO L82 PathProgramCache]: Analyzing trace with hash 459820654, now seen corresponding path program 1 times [2019-09-07 22:39:16,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:39:16,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:39:16,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:39:16,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:39:16,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:39:16,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:39:17,200 INFO L134 CoverageAnalysis]: Checked inductivity of 989 backedges. 120 proven. 181 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2019-09-07 22:39:17,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:39:17,201 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:39:17,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:39:17,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:39:17,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 1282 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 22:39:17,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:39:17,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:39:20,202 INFO L134 CoverageAnalysis]: Checked inductivity of 989 backedges. 594 proven. 0 refuted. 0 times theorem prover too weak. 395 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 22:39:20,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 22:39:20,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 22:39:20,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 22:39:20,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 22:39:20,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-07 22:39:20,219 INFO L87 Difference]: Start difference. First operand 140923 states and 147926 transitions. Second operand 9 states. [2019-09-07 22:39:30,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:39:30,982 INFO L93 Difference]: Finished difference Result 255360 states and 267997 transitions. [2019-09-07 22:39:30,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-07 22:39:30,983 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 969 [2019-09-07 22:39:30,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:39:31,237 INFO L225 Difference]: With dead ends: 255360 [2019-09-07 22:39:31,237 INFO L226 Difference]: Without dead ends: 115153 [2019-09-07 22:39:31,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1040 GetRequests, 1000 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=340, Invalid=1382, Unknown=0, NotChecked=0, Total=1722 [2019-09-07 22:39:31,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115153 states. [2019-09-07 22:39:32,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115153 to 110775. [2019-09-07 22:39:32,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110775 states. [2019-09-07 22:39:33,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110775 states to 110775 states and 114735 transitions. [2019-09-07 22:39:33,098 INFO L78 Accepts]: Start accepts. Automaton has 110775 states and 114735 transitions. Word has length 969 [2019-09-07 22:39:33,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:39:33,098 INFO L475 AbstractCegarLoop]: Abstraction has 110775 states and 114735 transitions. [2019-09-07 22:39:33,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 22:39:33,098 INFO L276 IsEmpty]: Start isEmpty. Operand 110775 states and 114735 transitions. [2019-09-07 22:39:33,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1577 [2019-09-07 22:39:33,127 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:39:33,128 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 22:39:33,129 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:39:33,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:39:33,130 INFO L82 PathProgramCache]: Analyzing trace with hash -799632812, now seen corresponding path program 1 times [2019-09-07 22:39:33,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:39:33,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:39:33,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:39:33,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:39:33,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:39:33,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:39:36,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2172 backedges. 1397 proven. 16 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2019-09-07 22:39:36,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:39:36,632 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:39:36,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:39:36,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:39:36,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 1966 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 22:39:37,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:39:37,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:39:38,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2172 backedges. 1635 proven. 2 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2019-09-07 22:39:38,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:39:38,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-09-07 22:39:38,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 22:39:38,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 22:39:38,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-09-07 22:39:38,079 INFO L87 Difference]: Start difference. First operand 110775 states and 114735 transitions. Second operand 11 states. [2019-09-07 22:39:57,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:39:57,518 INFO L93 Difference]: Finished difference Result 252641 states and 262008 transitions. [2019-09-07 22:39:57,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-07 22:39:57,519 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 1576 [2019-09-07 22:39:57,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:39:57,766 INFO L225 Difference]: With dead ends: 252641 [2019-09-07 22:39:57,766 INFO L226 Difference]: Without dead ends: 140456 [2019-09-07 22:39:57,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1669 GetRequests, 1618 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 838 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=482, Invalid=2274, Unknown=0, NotChecked=0, Total=2756 [2019-09-07 22:39:57,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140456 states. [2019-09-07 22:39:59,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140456 to 128479. [2019-09-07 22:39:59,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128479 states. [2019-09-07 22:39:59,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128479 states to 128479 states and 132616 transitions. [2019-09-07 22:39:59,602 INFO L78 Accepts]: Start accepts. Automaton has 128479 states and 132616 transitions. Word has length 1576 [2019-09-07 22:39:59,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:39:59,603 INFO L475 AbstractCegarLoop]: Abstraction has 128479 states and 132616 transitions. [2019-09-07 22:39:59,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 22:39:59,603 INFO L276 IsEmpty]: Start isEmpty. Operand 128479 states and 132616 transitions. [2019-09-07 22:39:59,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1714 [2019-09-07 22:39:59,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:39:59,642 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 22:39:59,642 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:39:59,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:39:59,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1739012094, now seen corresponding path program 1 times [2019-09-07 22:39:59,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:39:59,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:39:59,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:39:59,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:39:59,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:39:59,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:40:02,006 INFO L134 CoverageAnalysis]: Checked inductivity of 2821 backedges. 1677 proven. 6 refuted. 0 times theorem prover too weak. 1138 trivial. 0 not checked. [2019-09-07 22:40:02,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:40:02,006 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 22:40:02,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:40:02,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:40:02,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 2143 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 22:40:02,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:40:02,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:40:02,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:40:02,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:40:04,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2821 backedges. 2024 proven. 2 refuted. 0 times theorem prover too weak. 795 trivial. 0 not checked. [2019-09-07 22:40:04,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:40:04,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-09-07 22:40:04,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 22:40:04,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 22:40:04,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-07 22:40:04,174 INFO L87 Difference]: Start difference. First operand 128479 states and 132616 transitions. Second operand 10 states. [2019-09-07 22:40:25,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:40:25,971 INFO L93 Difference]: Finished difference Result 277578 states and 286772 transitions. [2019-09-07 22:40:25,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-07 22:40:25,971 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 1713 [2019-09-07 22:40:25,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:40:26,221 INFO L225 Difference]: With dead ends: 277578 [2019-09-07 22:40:26,221 INFO L226 Difference]: Without dead ends: 149104 [2019-09-07 22:40:26,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1802 GetRequests, 1752 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 835 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=430, Invalid=2222, Unknown=0, NotChecked=0, Total=2652 [2019-09-07 22:40:26,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149104 states. [2019-09-07 22:40:27,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149104 to 134959. [2019-09-07 22:40:27,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134959 states. [2019-09-07 22:40:27,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134959 states to 134959 states and 138836 transitions. [2019-09-07 22:40:27,640 INFO L78 Accepts]: Start accepts. Automaton has 134959 states and 138836 transitions. Word has length 1713 [2019-09-07 22:40:27,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:40:27,641 INFO L475 AbstractCegarLoop]: Abstraction has 134959 states and 138836 transitions. [2019-09-07 22:40:27,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 22:40:27,641 INFO L276 IsEmpty]: Start isEmpty. Operand 134959 states and 138836 transitions. [2019-09-07 22:40:27,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1797 [2019-09-07 22:40:27,693 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:40:27,694 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:40:27,694 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:40:27,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:40:27,695 INFO L82 PathProgramCache]: Analyzing trace with hash 46256780, now seen corresponding path program 1 times [2019-09-07 22:40:27,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:40:27,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:40:27,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:40:27,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:40:27,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:40:27,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:40:35,679 INFO L134 CoverageAnalysis]: Checked inductivity of 3257 backedges. 1714 proven. 1214 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2019-09-07 22:40:35,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:40:35,679 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:40:35,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:40:36,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:40:36,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 2228 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-07 22:40:36,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:40:36,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:40:36,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:40:36,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:40:36,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:40:36,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:40:36,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:40:36,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:40:58,681 WARN L188 SmtUtils]: Spent 22.29 s on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2019-09-07 22:40:58,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:41:01,880 INFO L134 CoverageAnalysis]: Checked inductivity of 3257 backedges. 2028 proven. 454 refuted. 0 times theorem prover too weak. 775 trivial. 0 not checked. [2019-09-07 22:41:01,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:41:01,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11] total 23 [2019-09-07 22:41:01,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-07 22:41:01,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-07 22:41:01,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2019-09-07 22:41:01,888 INFO L87 Difference]: Start difference. First operand 134959 states and 138836 transitions. Second operand 23 states. [2019-09-07 22:41:13,859 WARN L188 SmtUtils]: Spent 7.26 s on a formula simplification. DAG size of input: 64 DAG size of output: 43 [2019-09-07 22:41:19,569 WARN L188 SmtUtils]: Spent 652.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 17 [2019-09-07 22:41:33,421 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2019-09-07 22:41:33,939 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 44 [2019-09-07 22:41:36,560 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2019-09-07 22:41:38,683 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-07 22:41:50,147 WARN L188 SmtUtils]: Spent 8.68 s on a formula simplification. DAG size of input: 84 DAG size of output: 64 [2019-09-07 22:42:16,137 WARN L188 SmtUtils]: Spent 8.08 s on a formula simplification. DAG size of input: 70 DAG size of output: 43 [2019-09-07 22:42:26,836 WARN L188 SmtUtils]: Spent 5.65 s on a formula simplification. DAG size of input: 87 DAG size of output: 42 [2019-09-07 22:42:32,373 WARN L188 SmtUtils]: Spent 5.47 s on a formula simplification. DAG size of input: 73 DAG size of output: 21 [2019-09-07 22:42:36,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:42:36,369 INFO L93 Difference]: Finished difference Result 294014 states and 302603 transitions. [2019-09-07 22:42:36,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-09-07 22:42:36,370 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1796 [2019-09-07 22:42:36,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:42:36,642 INFO L225 Difference]: With dead ends: 294014 [2019-09-07 22:42:36,642 INFO L226 Difference]: Without dead ends: 159771 [2019-09-07 22:42:36,749 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2010 GetRequests, 1855 SyntacticMatches, 20 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7655 ImplicationChecksByTransitivity, 66.9s TimeCoverageRelationStatistics Valid=2524, Invalid=16108, Unknown=0, NotChecked=0, Total=18632 [2019-09-07 22:42:36,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159771 states. [2019-09-07 22:42:38,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159771 to 142815. [2019-09-07 22:42:38,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142815 states. [2019-09-07 22:42:38,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142815 states to 142815 states and 146923 transitions. [2019-09-07 22:42:38,577 INFO L78 Accepts]: Start accepts. Automaton has 142815 states and 146923 transitions. Word has length 1796 [2019-09-07 22:42:38,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:42:38,579 INFO L475 AbstractCegarLoop]: Abstraction has 142815 states and 146923 transitions. [2019-09-07 22:42:38,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-07 22:42:38,579 INFO L276 IsEmpty]: Start isEmpty. Operand 142815 states and 146923 transitions. [2019-09-07 22:42:38,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1868 [2019-09-07 22:42:38,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:42:38,639 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2019-09-07 22:42:38,639 INFO L418 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:42:38,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:42:38,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1293769433, now seen corresponding path program 1 times [2019-09-07 22:42:38,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:42:38,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:42:38,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:42:38,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:42:38,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:42:38,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:42:42,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3760 backedges. 1056 proven. 2 refuted. 0 times theorem prover too weak. 2702 trivial. 0 not checked. [2019-09-07 22:42:42,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:42:42,324 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:42:42,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:42:42,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:42:42,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 2338 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 22:42:42,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:42:42,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:42:42,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:42:44,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3760 backedges. 2487 proven. 2 refuted. 0 times theorem prover too weak. 1271 trivial. 0 not checked. [2019-09-07 22:42:44,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:42:44,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-09-07 22:42:44,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 22:42:44,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 22:42:44,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-07 22:42:44,629 INFO L87 Difference]: Start difference. First operand 142815 states and 146923 transitions. Second operand 7 states. [2019-09-07 22:42:56,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:42:56,097 INFO L93 Difference]: Finished difference Result 304699 states and 313756 transitions. [2019-09-07 22:42:56,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 22:42:56,098 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1867 [2019-09-07 22:42:56,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:42:56,409 INFO L225 Difference]: With dead ends: 304699 [2019-09-07 22:42:56,409 INFO L226 Difference]: Without dead ends: 162600 [2019-09-07 22:42:56,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1885 GetRequests, 1873 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-09-07 22:42:56,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162600 states. [2019-09-07 22:42:58,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162600 to 147066. [2019-09-07 22:42:58,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147066 states. [2019-09-07 22:42:58,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147066 states to 147066 states and 150524 transitions. [2019-09-07 22:42:58,894 INFO L78 Accepts]: Start accepts. Automaton has 147066 states and 150524 transitions. Word has length 1867 [2019-09-07 22:42:58,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:42:58,895 INFO L475 AbstractCegarLoop]: Abstraction has 147066 states and 150524 transitions. [2019-09-07 22:42:58,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 22:42:58,895 INFO L276 IsEmpty]: Start isEmpty. Operand 147066 states and 150524 transitions. [2019-09-07 22:42:58,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2208 [2019-09-07 22:42:58,987 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:42:58,988 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:42:58,988 INFO L418 AbstractCegarLoop]: === Iteration 20 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:42:58,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:42:58,989 INFO L82 PathProgramCache]: Analyzing trace with hash 649272314, now seen corresponding path program 1 times [2019-09-07 22:42:58,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:42:58,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:42:58,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:42:58,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:42:58,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:42:59,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:43:07,957 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 862 proven. 2354 refuted. 0 times theorem prover too weak. 3112 trivial. 0 not checked. [2019-09-07 22:43:07,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:43:07,958 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:43:07,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:43:08,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:43:08,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 2797 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 22:43:08,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:43:08,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:43:10,529 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 4047 proven. 2 refuted. 0 times theorem prover too weak. 2279 trivial. 0 not checked. [2019-09-07 22:43:10,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:43:10,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 5] total 22 [2019-09-07 22:43:10,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-07 22:43:10,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-07 22:43:10,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2019-09-07 22:43:10,538 INFO L87 Difference]: Start difference. First operand 147066 states and 150524 transitions. Second operand 22 states. [2019-09-07 22:43:37,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:43:37,239 INFO L93 Difference]: Finished difference Result 296653 states and 304268 transitions. [2019-09-07 22:43:37,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-09-07 22:43:37,240 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 2207 [2019-09-07 22:43:37,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:43:37,526 INFO L225 Difference]: With dead ends: 296653 [2019-09-07 22:43:37,527 INFO L226 Difference]: Without dead ends: 148173 [2019-09-07 22:43:37,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2394 GetRequests, 2287 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4167 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1802, Invalid=9970, Unknown=0, NotChecked=0, Total=11772 [2019-09-07 22:43:37,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148173 states. [2019-09-07 22:43:39,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148173 to 147068. [2019-09-07 22:43:39,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147068 states. [2019-09-07 22:43:39,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147068 states to 147068 states and 150146 transitions. [2019-09-07 22:43:39,806 INFO L78 Accepts]: Start accepts. Automaton has 147068 states and 150146 transitions. Word has length 2207 [2019-09-07 22:43:39,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:43:39,807 INFO L475 AbstractCegarLoop]: Abstraction has 147068 states and 150146 transitions. [2019-09-07 22:43:39,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-07 22:43:39,807 INFO L276 IsEmpty]: Start isEmpty. Operand 147068 states and 150146 transitions. [2019-09-07 22:43:39,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2267 [2019-09-07 22:43:39,911 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:43:39,912 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:43:39,912 INFO L418 AbstractCegarLoop]: === Iteration 21 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:43:39,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:43:39,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1978957619, now seen corresponding path program 1 times [2019-09-07 22:43:39,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:43:39,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:43:39,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:43:39,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:43:39,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:43:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:43:44,188 INFO L134 CoverageAnalysis]: Checked inductivity of 4500 backedges. 1077 proven. 570 refuted. 0 times theorem prover too weak. 2853 trivial. 0 not checked. [2019-09-07 22:43:44,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:43:44,188 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:43:44,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:43:44,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:43:44,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 2765 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 22:43:44,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:43:44,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:43:44,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:43:44,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:43:44,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:43:44,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:43:44,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:43:44,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:43:44,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:43:47,035 INFO L134 CoverageAnalysis]: Checked inductivity of 4500 backedges. 3347 proven. 5 refuted. 0 times theorem prover too weak. 1148 trivial. 0 not checked. [2019-09-07 22:43:47,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:43:47,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2019-09-07 22:43:47,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 22:43:47,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 22:43:47,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-07 22:43:47,047 INFO L87 Difference]: Start difference. First operand 147068 states and 150146 transitions. Second operand 8 states. [2019-09-07 22:43:58,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:43:58,610 INFO L93 Difference]: Finished difference Result 317499 states and 327002 transitions. [2019-09-07 22:43:58,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 22:43:58,611 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 2266 [2019-09-07 22:43:58,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:43:58,977 INFO L225 Difference]: With dead ends: 317499 [2019-09-07 22:43:58,978 INFO L226 Difference]: Without dead ends: 171147 [2019-09-07 22:43:59,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2288 GetRequests, 2274 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-09-07 22:43:59,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171147 states. [2019-09-07 22:44:00,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171147 to 163513. [2019-09-07 22:44:00,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163513 states. [2019-09-07 22:44:01,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163513 states to 163513 states and 167070 transitions. [2019-09-07 22:44:01,055 INFO L78 Accepts]: Start accepts. Automaton has 163513 states and 167070 transitions. Word has length 2266 [2019-09-07 22:44:01,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:44:01,057 INFO L475 AbstractCegarLoop]: Abstraction has 163513 states and 167070 transitions. [2019-09-07 22:44:01,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 22:44:01,057 INFO L276 IsEmpty]: Start isEmpty. Operand 163513 states and 167070 transitions. [2019-09-07 22:44:01,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2294 [2019-09-07 22:44:01,178 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:44:01,179 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 22:44:01,179 INFO L418 AbstractCegarLoop]: === Iteration 22 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:44:01,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:44:01,180 INFO L82 PathProgramCache]: Analyzing trace with hash -366663250, now seen corresponding path program 1 times [2019-09-07 22:44:01,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:44:01,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:44:01,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:44:01,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:44:01,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:44:01,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:44:10,427 INFO L134 CoverageAnalysis]: Checked inductivity of 6735 backedges. 862 proven. 2446 refuted. 0 times theorem prover too weak. 3427 trivial. 0 not checked. [2019-09-07 22:44:10,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:44:10,427 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:44:10,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:44:10,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:44:10,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 2881 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 22:44:10,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:44:11,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:44:13,447 INFO L134 CoverageAnalysis]: Checked inductivity of 6735 backedges. 4454 proven. 2 refuted. 0 times theorem prover too weak. 2279 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (15)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 22:44:13,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:44:13,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 5] total 19 [2019-09-07 22:44:13,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 22:44:13,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 22:44:13,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-09-07 22:44:13,465 INFO L87 Difference]: Start difference. First operand 163513 states and 167070 transitions. Second operand 19 states. [2019-09-07 22:44:41,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:44:41,800 INFO L93 Difference]: Finished difference Result 326542 states and 334064 transitions. [2019-09-07 22:44:41,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-07 22:44:41,803 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 2293 [2019-09-07 22:44:41,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:44:42,154 INFO L225 Difference]: With dead ends: 326542 [2019-09-07 22:44:42,154 INFO L226 Difference]: Without dead ends: 163745 [2019-09-07 22:44:42,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2484 GetRequests, 2376 SyntacticMatches, 3 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4074 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1710, Invalid=9632, Unknown=0, NotChecked=0, Total=11342 [2019-09-07 22:44:42,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163745 states. [2019-09-07 22:44:43,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163745 to 158496. [2019-09-07 22:44:43,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158496 states. [2019-09-07 22:44:43,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158496 states to 158496 states and 161423 transitions. [2019-09-07 22:44:43,950 INFO L78 Accepts]: Start accepts. Automaton has 158496 states and 161423 transitions. Word has length 2293 [2019-09-07 22:44:43,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:44:43,951 INFO L475 AbstractCegarLoop]: Abstraction has 158496 states and 161423 transitions. [2019-09-07 22:44:43,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 22:44:43,951 INFO L276 IsEmpty]: Start isEmpty. Operand 158496 states and 161423 transitions. [2019-09-07 22:44:44,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2329 [2019-09-07 22:44:44,059 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:44:44,060 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 22:44:44,060 INFO L418 AbstractCegarLoop]: === Iteration 23 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:44:44,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:44:44,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1559377288, now seen corresponding path program 1 times [2019-09-07 22:44:44,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:44:44,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:44:44,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:44:44,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:44:44,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:44:44,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:44:53,237 INFO L134 CoverageAnalysis]: Checked inductivity of 6510 backedges. 2653 proven. 2491 refuted. 0 times theorem prover too weak. 1366 trivial. 0 not checked. [2019-09-07 22:44:53,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:44:53,237 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:44:53,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:44:53,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:44:53,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 2943 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 22:44:53,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:44:53,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:44:53,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:44:53,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:44:53,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:44:53,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:44:53,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:44:53,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:44:53,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:44:53,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:44:53,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:44:53,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:44:53,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:44:53,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:44:53,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:44:53,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:44:53,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:44:53,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:45:25,660 WARN L188 SmtUtils]: Spent 31.56 s on a formula simplification. DAG size of input: 403 DAG size of output: 59 [2019-09-07 22:45:25,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:45:25,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:45:26,737 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_~a3~0_1889 Int)) (let ((.cse1 (* 9 v_~a3~0_1889))) (let ((.cse3 (div .cse1 10))) (let ((.cse0 (mod .cse3 299791))) (let ((.cse2 (+ .cse0 90058))) (and (not (= 0 (mod (+ .cse0 3) 5))) (<= 0 .cse1) (<= c_~a3~0 (+ (div .cse2 5) 219840)) (< .cse2 0) (< 417 v_~a3~0_1889) (<= 0 .cse3))))))) (exists ((v_~a3~0_1889 Int)) (let ((.cse4 (* 9 v_~a3~0_1889))) (let ((.cse5 (div .cse4 10))) (and (<= 0 .cse4) (<= c_~a3~0 (+ (div (+ (mod .cse5 299791) 90058) 5) 219839)) (< 417 v_~a3~0_1889) (<= 0 .cse5)))))) is different from true [2019-09-07 22:45:27,703 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_~a3~0_1889 Int)) (let ((.cse1 (* 9 v_~a3~0_1889))) (let ((.cse3 (div .cse1 10))) (let ((.cse0 (mod .cse3 299791))) (let ((.cse2 (+ .cse0 90058))) (and (not (= 0 (mod (+ .cse0 3) 5))) (<= 0 .cse1) (<= c_~a3~0 (+ (div .cse2 5) 219840)) (< .cse2 0) (< 417 v_~a3~0_1889) (<= 0 .cse3))))))) (exists ((v_prenex_35 Int)) (let ((.cse5 (* 9 v_prenex_35))) (let ((.cse4 (div .cse5 10))) (and (<= c_~a3~0 (+ (div (+ (mod .cse4 299791) 90058) 5) 219839)) (<= 0 .cse5) (<= 0 .cse4) (< 417 v_prenex_35)))))) is different from true [2019-09-07 22:45:27,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:45:27,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:45:36,288 WARN L188 SmtUtils]: Spent 4.04 s on a formula simplification that was a NOOP. DAG size: 28 [2019-09-07 22:45:38,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:45:44,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:45:44,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:45:44,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:45:57,665 WARN L188 SmtUtils]: Spent 6.64 s on a formula simplification. DAG size of input: 77 DAG size of output: 46 [2019-09-07 22:46:09,010 INFO L134 CoverageAnalysis]: Checked inductivity of 6510 backedges. 3492 proven. 432 refuted. 0 times theorem prover too weak. 2574 trivial. 12 not checked. [2019-09-07 22:46:09,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:46:09,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 14] total 37 [2019-09-07 22:46:09,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-07 22:46:09,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-07 22:46:09,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1076, Unknown=7, NotChecked=134, Total=1332 [2019-09-07 22:46:09,020 INFO L87 Difference]: Start difference. First operand 158496 states and 161423 transitions. Second operand 37 states.