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_label39.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 22:38:59,772 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 22:38:59,774 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 22:38:59,791 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 22:38:59,791 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 22:38:59,793 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 22:38:59,794 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 22:38:59,799 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 22:38:59,802 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 22:38:59,803 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 22:38:59,809 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 22:38:59,811 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 22:38:59,812 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 22:38:59,813 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 22:38:59,816 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 22:38:59,818 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 22:38:59,818 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 22:38:59,819 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 22:38:59,821 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 22:38:59,823 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 22:38:59,824 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 22:38:59,825 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 22:38:59,826 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 22:38:59,827 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 22:38:59,829 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 22:38:59,830 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 22:38:59,830 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 22:38:59,831 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 22:38:59,831 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 22:38:59,832 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 22:38:59,832 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 22:38:59,833 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 22:38:59,833 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 22:38:59,834 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 22:38:59,835 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 22:38:59,835 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 22:38:59,836 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 22:38:59,836 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 22:38:59,836 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 22:38:59,837 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 22:38:59,838 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 22:38:59,839 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:38:59,854 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 22:38:59,854 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 22:38:59,855 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 22:38:59,855 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 22:38:59,856 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 22:38:59,856 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 22:38:59,856 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 22:38:59,856 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 22:38:59,856 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 22:38:59,857 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 22:38:59,857 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 22:38:59,857 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 22:38:59,857 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 22:38:59,857 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 22:38:59,858 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 22:38:59,858 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 22:38:59,858 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 22:38:59,858 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 22:38:59,859 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 22:38:59,859 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 22:38:59,859 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 22:38:59,859 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 22:38:59,859 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 22:38:59,860 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 22:38:59,860 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 22:38:59,860 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 22:38:59,860 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 22:38:59,860 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 22:38:59,860 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 22:38:59,894 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 22:38:59,906 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 22:38:59,909 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 22:38:59,910 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 22:38:59,911 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 22:38:59,911 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem18_label39.c [2019-09-07 22:38:59,969 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb6d470cc/c4ff0f4c206c485c8951c6b4466b2014/FLAGad69ce57b [2019-09-07 22:39:00,773 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 22:39:00,774 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem18_label39.c [2019-09-07 22:39:00,807 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb6d470cc/c4ff0f4c206c485c8951c6b4466b2014/FLAGad69ce57b [2019-09-07 22:39:01,272 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb6d470cc/c4ff0f4c206c485c8951c6b4466b2014 [2019-09-07 22:39:01,282 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 22:39:01,283 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 22:39:01,285 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 22:39:01,285 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 22:39:01,289 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 22:39:01,290 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:39:01" (1/1) ... [2019-09-07 22:39:01,292 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c068003 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:39:01, skipping insertion in model container [2019-09-07 22:39:01,293 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:39:01" (1/1) ... [2019-09-07 22:39:01,300 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 22:39:01,425 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 22:39:02,709 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 22:39:02,719 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 22:39:03,174 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 22:39:03,212 INFO L192 MainTranslator]: Completed translation [2019-09-07 22:39:03,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:39:03 WrapperNode [2019-09-07 22:39:03,214 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 22:39:03,215 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 22:39:03,215 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 22:39:03,215 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 22:39:03,231 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:39:03" (1/1) ... [2019-09-07 22:39:03,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:39:03" (1/1) ... [2019-09-07 22:39:03,316 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:39:03" (1/1) ... [2019-09-07 22:39:03,316 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:39:03" (1/1) ... [2019-09-07 22:39:03,434 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:39:03" (1/1) ... [2019-09-07 22:39:03,470 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:39:03" (1/1) ... [2019-09-07 22:39:03,503 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:39:03" (1/1) ... [2019-09-07 22:39:03,536 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 22:39:03,537 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 22:39:03,537 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 22:39:03,537 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 22:39:03,539 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:39:03" (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:39:03,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 22:39:03,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 22:39:03,608 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 22:39:03,608 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 22:39:03,608 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2019-09-07 22:39:03,608 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 22:39:03,609 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 22:39:03,609 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 22:39:03,610 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2019-09-07 22:39:03,610 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 22:39:03,610 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 22:39:03,611 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 22:39:03,611 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 22:39:03,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 22:39:03,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 22:39:07,352 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 22:39:07,353 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 22:39:07,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:39:07 BoogieIcfgContainer [2019-09-07 22:39:07,358 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 22:39:07,361 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 22:39:07,361 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 22:39:07,366 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 22:39:07,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 10:39:01" (1/3) ... [2019-09-07 22:39:07,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54fd9d6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:39:07, skipping insertion in model container [2019-09-07 22:39:07,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:39:03" (2/3) ... [2019-09-07 22:39:07,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54fd9d6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:39:07, skipping insertion in model container [2019-09-07 22:39:07,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:39:07" (3/3) ... [2019-09-07 22:39:07,375 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem18_label39.c [2019-09-07 22:39:07,397 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 22:39:07,410 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 22:39:07,429 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 22:39:07,481 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 22:39:07,482 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 22:39:07,482 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 22:39:07,483 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 22:39:07,483 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 22:39:07,483 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 22:39:07,483 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 22:39:07,483 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 22:39:07,483 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 22:39:07,525 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states. [2019-09-07 22:39:07,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-07 22:39:07,531 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:39:07,532 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:39:07,534 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:39:07,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:39:07,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1436642090, now seen corresponding path program 1 times [2019-09-07 22:39:07,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:39:07,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:39:07,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:39:07,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:39:07,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:39:07,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:39:07,829 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:39:07,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:39:07,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 22:39:07,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 22:39:07,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 22:39:07,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 22:39:07,855 INFO L87 Difference]: Start difference. First operand 774 states. Second operand 3 states. [2019-09-07 22:39:12,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:39:12,264 INFO L93 Difference]: Finished difference Result 2248 states and 4319 transitions. [2019-09-07 22:39:12,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 22:39:12,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-07 22:39:12,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:39:12,305 INFO L225 Difference]: With dead ends: 2248 [2019-09-07 22:39:12,305 INFO L226 Difference]: Without dead ends: 1412 [2019-09-07 22:39:12,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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:39:12,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2019-09-07 22:39:12,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1412. [2019-09-07 22:39:12,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1412 states. [2019-09-07 22:39:12,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2630 transitions. [2019-09-07 22:39:12,455 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 2630 transitions. Word has length 19 [2019-09-07 22:39:12,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:39:12,456 INFO L475 AbstractCegarLoop]: Abstraction has 1412 states and 2630 transitions. [2019-09-07 22:39:12,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 22:39:12,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 2630 transitions. [2019-09-07 22:39:12,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-07 22:39:12,461 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:39:12,461 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:39:12,462 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:39:12,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:39:12,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1606362769, now seen corresponding path program 1 times [2019-09-07 22:39:12,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:39:12,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:39:12,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:39:12,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:39:12,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:39:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:39:12,674 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:39:12,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:39:12,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 22:39:12,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 22:39:12,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 22:39:12,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 22:39:12,678 INFO L87 Difference]: Start difference. First operand 1412 states and 2630 transitions. Second operand 5 states. [2019-09-07 22:39:17,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:39:17,944 INFO L93 Difference]: Finished difference Result 4291 states and 8027 transitions. [2019-09-07 22:39:17,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 22:39:17,944 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2019-09-07 22:39:17,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:39:17,965 INFO L225 Difference]: With dead ends: 4291 [2019-09-07 22:39:17,965 INFO L226 Difference]: Without dead ends: 2885 [2019-09-07 22:39:17,970 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 22:39:17,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2885 states. [2019-09-07 22:39:18,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2885 to 2861. [2019-09-07 22:39:18,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2861 states. [2019-09-07 22:39:18,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2861 states to 2861 states and 4925 transitions. [2019-09-07 22:39:18,073 INFO L78 Accepts]: Start accepts. Automaton has 2861 states and 4925 transitions. Word has length 88 [2019-09-07 22:39:18,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:39:18,073 INFO L475 AbstractCegarLoop]: Abstraction has 2861 states and 4925 transitions. [2019-09-07 22:39:18,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 22:39:18,074 INFO L276 IsEmpty]: Start isEmpty. Operand 2861 states and 4925 transitions. [2019-09-07 22:39:18,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-07 22:39:18,112 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:39:18,112 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 22:39:18,112 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:39:18,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:39:18,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1826688270, now seen corresponding path program 1 times [2019-09-07 22:39:18,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:39:18,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:39:18,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:39:18,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:39:18,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:39:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:39:18,248 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:39:18,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:39:18,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 22:39:18,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 22:39:18,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 22:39:18,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 22:39:18,252 INFO L87 Difference]: Start difference. First operand 2861 states and 4925 transitions. Second operand 5 states. [2019-09-07 22:39:22,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:39:22,835 INFO L93 Difference]: Finished difference Result 7211 states and 12315 transitions. [2019-09-07 22:39:22,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 22:39:22,836 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-09-07 22:39:22,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:39:22,865 INFO L225 Difference]: With dead ends: 7211 [2019-09-07 22:39:22,865 INFO L226 Difference]: Without dead ends: 4356 [2019-09-07 22:39:22,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 22:39:22,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4356 states. [2019-09-07 22:39:23,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4356 to 4325. [2019-09-07 22:39:23,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4325 states. [2019-09-07 22:39:23,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4325 states to 4325 states and 6079 transitions. [2019-09-07 22:39:23,028 INFO L78 Accepts]: Start accepts. Automaton has 4325 states and 6079 transitions. Word has length 89 [2019-09-07 22:39:23,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:39:23,029 INFO L475 AbstractCegarLoop]: Abstraction has 4325 states and 6079 transitions. [2019-09-07 22:39:23,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 22:39:23,029 INFO L276 IsEmpty]: Start isEmpty. Operand 4325 states and 6079 transitions. [2019-09-07 22:39:23,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-07 22:39:23,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:39:23,033 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 22:39:23,034 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:39:23,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:39:23,037 INFO L82 PathProgramCache]: Analyzing trace with hash -247493198, now seen corresponding path program 1 times [2019-09-07 22:39:23,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:39:23,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:39:23,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:39:23,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:39:23,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:39:23,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:39:23,178 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:39:23,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:39:23,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 22:39:23,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 22:39:23,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 22:39:23,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 22:39:23,181 INFO L87 Difference]: Start difference. First operand 4325 states and 6079 transitions. Second operand 5 states. [2019-09-07 22:39:28,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:39:28,947 INFO L93 Difference]: Finished difference Result 13274 states and 19026 transitions. [2019-09-07 22:39:28,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 22:39:28,948 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-07 22:39:28,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:39:28,990 INFO L225 Difference]: With dead ends: 13274 [2019-09-07 22:39:28,990 INFO L226 Difference]: Without dead ends: 8955 [2019-09-07 22:39:29,001 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:39:29,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8955 states. [2019-09-07 22:39:29,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8955 to 8798. [2019-09-07 22:39:29,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8798 states. [2019-09-07 22:39:29,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8798 states to 8798 states and 11426 transitions. [2019-09-07 22:39:29,219 INFO L78 Accepts]: Start accepts. Automaton has 8798 states and 11426 transitions. Word has length 91 [2019-09-07 22:39:29,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:39:29,219 INFO L475 AbstractCegarLoop]: Abstraction has 8798 states and 11426 transitions. [2019-09-07 22:39:29,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 22:39:29,219 INFO L276 IsEmpty]: Start isEmpty. Operand 8798 states and 11426 transitions. [2019-09-07 22:39:29,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-07 22:39:29,221 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:39:29,221 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 22:39:29,221 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:39:29,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:39:29,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1873295385, now seen corresponding path program 1 times [2019-09-07 22:39:29,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:39:29,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:39:29,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:39:29,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:39:29,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:39:29,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:39:29,289 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:39:29,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:39:29,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 22:39:29,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 22:39:29,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 22:39:29,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 22:39:29,291 INFO L87 Difference]: Start difference. First operand 8798 states and 11426 transitions. Second operand 4 states. [2019-09-07 22:39:35,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:39:35,507 INFO L93 Difference]: Finished difference Result 32537 states and 43591 transitions. [2019-09-07 22:39:35,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 22:39:35,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-09-07 22:39:35,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:39:35,619 INFO L225 Difference]: With dead ends: 32537 [2019-09-07 22:39:35,620 INFO L226 Difference]: Without dead ends: 23745 [2019-09-07 22:39:35,645 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:39:35,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23745 states. [2019-09-07 22:39:36,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23745 to 22327. [2019-09-07 22:39:36,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22327 states. [2019-09-07 22:39:36,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22327 states to 22327 states and 27959 transitions. [2019-09-07 22:39:36,186 INFO L78 Accepts]: Start accepts. Automaton has 22327 states and 27959 transitions. Word has length 116 [2019-09-07 22:39:36,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:39:36,187 INFO L475 AbstractCegarLoop]: Abstraction has 22327 states and 27959 transitions. [2019-09-07 22:39:36,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 22:39:36,188 INFO L276 IsEmpty]: Start isEmpty. Operand 22327 states and 27959 transitions. [2019-09-07 22:39:36,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-09-07 22:39:36,209 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:39:36,210 INFO L399 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 22:39:36,210 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:39:36,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:39:36,211 INFO L82 PathProgramCache]: Analyzing trace with hash -187977738, now seen corresponding path program 1 times [2019-09-07 22:39:36,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:39:36,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:39:36,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:39:36,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:39:36,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:39:36,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:39:36,491 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 109 proven. 71 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-07 22:39:36,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:39:36,492 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:39:36,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:39:36,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:39:36,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 22:39:36,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:39:37,492 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 269 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 22:39:37,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:39:37,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-09-07 22:39:37,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 22:39:37,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 22:39:37,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-07 22:39:37,508 INFO L87 Difference]: Start difference. First operand 22327 states and 27959 transitions. Second operand 8 states. [2019-09-07 22:39:45,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:39:45,854 INFO L93 Difference]: Finished difference Result 55639 states and 71828 transitions. [2019-09-07 22:39:45,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 22:39:45,855 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 331 [2019-09-07 22:39:45,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:39:46,005 INFO L225 Difference]: With dead ends: 55639 [2019-09-07 22:39:46,005 INFO L226 Difference]: Without dead ends: 33318 [2019-09-07 22:39:46,050 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-09-07 22:39:46,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33318 states. [2019-09-07 22:39:46,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33318 to 29748. [2019-09-07 22:39:46,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29748 states. [2019-09-07 22:39:46,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29748 states to 29748 states and 36701 transitions. [2019-09-07 22:39:46,659 INFO L78 Accepts]: Start accepts. Automaton has 29748 states and 36701 transitions. Word has length 331 [2019-09-07 22:39:46,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:39:46,659 INFO L475 AbstractCegarLoop]: Abstraction has 29748 states and 36701 transitions. [2019-09-07 22:39:46,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 22:39:46,664 INFO L276 IsEmpty]: Start isEmpty. Operand 29748 states and 36701 transitions. [2019-09-07 22:39:46,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2019-09-07 22:39:46,689 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:39:46,690 INFO L399 BasicCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,690 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:39:46,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:39:46,691 INFO L82 PathProgramCache]: Analyzing trace with hash -438399837, now seen corresponding path program 1 times [2019-09-07 22:39:46,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:39:46,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:39:46,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:39:46,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:39:46,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:39:46,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:39:47,959 INFO L134 CoverageAnalysis]: Checked inductivity of 914 backedges. 167 proven. 263 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2019-09-07 22:39:47,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:39:47,960 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:39:47,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:39:48,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:39:48,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 822 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 22:39:48,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:39:48,374 INFO L134 CoverageAnalysis]: Checked inductivity of 914 backedges. 721 proven. 2 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2019-09-07 22:39:48,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:39:48,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2019-09-07 22:39:48,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 22:39:48,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 22:39:48,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2019-09-07 22:39:48,383 INFO L87 Difference]: Start difference. First operand 29748 states and 36701 transitions. Second operand 15 states. [2019-09-07 22:40:03,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:40:03,569 INFO L93 Difference]: Finished difference Result 62867 states and 78698 transitions. [2019-09-07 22:40:03,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-07 22:40:03,570 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 520 [2019-09-07 22:40:03,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:40:03,675 INFO L225 Difference]: With dead ends: 62867 [2019-09-07 22:40:03,676 INFO L226 Difference]: Without dead ends: 32575 [2019-09-07 22:40:03,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 582 GetRequests, 536 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=426, Invalid=1830, Unknown=0, NotChecked=0, Total=2256 [2019-09-07 22:40:03,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32575 states. [2019-09-07 22:40:04,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32575 to 30330. [2019-09-07 22:40:04,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30330 states. [2019-09-07 22:40:04,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30330 states to 30330 states and 34320 transitions. [2019-09-07 22:40:04,218 INFO L78 Accepts]: Start accepts. Automaton has 30330 states and 34320 transitions. Word has length 520 [2019-09-07 22:40:04,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:40:04,218 INFO L475 AbstractCegarLoop]: Abstraction has 30330 states and 34320 transitions. [2019-09-07 22:40:04,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 22:40:04,218 INFO L276 IsEmpty]: Start isEmpty. Operand 30330 states and 34320 transitions. [2019-09-07 22:40:04,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2019-09-07 22:40:04,261 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:40:04,262 INFO L399 BasicCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:40:04,262 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:40:04,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:40:04,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1308786370, now seen corresponding path program 1 times [2019-09-07 22:40:04,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:40:04,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:40:04,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:40:04,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:40:04,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:40:04,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:40:05,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1543 backedges. 397 proven. 232 refuted. 0 times theorem prover too weak. 914 trivial. 0 not checked. [2019-09-07 22:40:05,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:40:05,897 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:40:05,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:40:06,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:40:06,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 1026 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 22:40:06,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:40:06,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:40:06,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1543 backedges. 538 proven. 0 refuted. 0 times theorem prover too weak. 1005 trivial. 0 not checked. [2019-09-07 22:40:06,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 22:40:06,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2019-09-07 22:40:06,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 22:40:06,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 22:40:06,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-07 22:40:06,624 INFO L87 Difference]: Start difference. First operand 30330 states and 34320 transitions. Second operand 12 states. [2019-09-07 22:40:09,727 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-07 22:40:10,231 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-07 22:40:10,515 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-07 22:40:11,909 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-07 22:40:12,503 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-07 22:40:12,694 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-07 22:40:17,862 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-09-07 22:40:19,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:40:19,318 INFO L93 Difference]: Finished difference Result 67528 states and 76856 transitions. [2019-09-07 22:40:19,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-07 22:40:19,318 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 685 [2019-09-07 22:40:19,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:40:19,388 INFO L225 Difference]: With dead ends: 67528 [2019-09-07 22:40:19,388 INFO L226 Difference]: Without dead ends: 36496 [2019-09-07 22:40:19,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 744 GetRequests, 708 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=306, Invalid=1100, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 22:40:19,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36496 states. [2019-09-07 22:40:20,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36496 to 36114. [2019-09-07 22:40:20,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36114 states. [2019-09-07 22:40:20,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36114 states to 36114 states and 40569 transitions. [2019-09-07 22:40:20,211 INFO L78 Accepts]: Start accepts. Automaton has 36114 states and 40569 transitions. Word has length 685 [2019-09-07 22:40:20,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:40:20,212 INFO L475 AbstractCegarLoop]: Abstraction has 36114 states and 40569 transitions. [2019-09-07 22:40:20,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 22:40:20,212 INFO L276 IsEmpty]: Start isEmpty. Operand 36114 states and 40569 transitions. [2019-09-07 22:40:20,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 696 [2019-09-07 22:40:20,255 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:40:20,256 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-07 22:40:20,257 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:40:20,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:40:20,257 INFO L82 PathProgramCache]: Analyzing trace with hash -489704452, now seen corresponding path program 1 times [2019-09-07 22:40:20,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:40:20,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:40:20,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:40:20,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:40:20,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:40:20,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:40:20,862 INFO L134 CoverageAnalysis]: Checked inductivity of 763 backedges. 281 proven. 112 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2019-09-07 22:40:20,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:40:20,862 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:40:20,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:40:21,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:40:21,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 981 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 22:40:21,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:40:21,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:40:21,827 INFO L134 CoverageAnalysis]: Checked inductivity of 763 backedges. 378 proven. 0 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2019-09-07 22:40:21,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 22:40:21,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-07 22:40:21,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 22:40:21,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 22:40:21,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-07 22:40:21,834 INFO L87 Difference]: Start difference. First operand 36114 states and 40569 transitions. Second operand 8 states. [2019-09-07 22:40:32,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:40:32,045 INFO L93 Difference]: Finished difference Result 95967 states and 109219 transitions. [2019-09-07 22:40:32,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-07 22:40:32,045 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 695 [2019-09-07 22:40:32,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:40:32,139 INFO L225 Difference]: With dead ends: 95967 [2019-09-07 22:40:32,139 INFO L226 Difference]: Without dead ends: 59863 [2019-09-07 22:40:32,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 769 GetRequests, 728 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=323, Invalid=1483, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 22:40:32,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59863 states. [2019-09-07 22:40:32,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59863 to 57565. [2019-09-07 22:40:32,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57565 states. [2019-09-07 22:40:33,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57565 states to 57565 states and 63394 transitions. [2019-09-07 22:40:33,066 INFO L78 Accepts]: Start accepts. Automaton has 57565 states and 63394 transitions. Word has length 695 [2019-09-07 22:40:33,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:40:33,067 INFO L475 AbstractCegarLoop]: Abstraction has 57565 states and 63394 transitions. [2019-09-07 22:40:33,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 22:40:33,067 INFO L276 IsEmpty]: Start isEmpty. Operand 57565 states and 63394 transitions. [2019-09-07 22:40:33,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1247 [2019-09-07 22:40:33,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:40:33,151 INFO L399 BasicCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 22:40:33,151 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:40:33,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:40:33,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1034843005, now seen corresponding path program 1 times [2019-09-07 22:40:33,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:40:33,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:40:33,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:40:33,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:40:33,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:40:33,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:40:34,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1657 backedges. 280 proven. 248 refuted. 0 times theorem prover too weak. 1129 trivial. 0 not checked. [2019-09-07 22:40:34,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:40:34,730 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:40:34,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:40:35,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:40:35,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 1658 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 22:40:35,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:40:35,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:40:35,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1657 backedges. 1052 proven. 2 refuted. 0 times theorem prover too weak. 603 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Forcibly destroying the process [2019-09-07 22:40:36,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:40:36,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 22:40:36,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 22:40:36,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 22:40:36,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-07 22:40:36,844 INFO L87 Difference]: Start difference. First operand 57565 states and 63394 transitions. Second operand 9 states. [2019-09-07 22:40:49,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:40:49,739 INFO L93 Difference]: Finished difference Result 156414 states and 176956 transitions. [2019-09-07 22:40:49,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-07 22:40:49,739 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1246 [2019-09-07 22:40:49,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:40:50,016 INFO L225 Difference]: With dead ends: 156414 [2019-09-07 22:40:50,017 INFO L226 Difference]: Without dead ends: 98829 [2019-09-07 22:40:50,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1317 GetRequests, 1277 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=350, Invalid=1372, Unknown=0, NotChecked=0, Total=1722 [2019-09-07 22:40:50,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98829 states. [2019-09-07 22:40:51,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98829 to 95283. [2019-09-07 22:40:51,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95283 states. [2019-09-07 22:40:51,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95283 states to 95283 states and 104985 transitions. [2019-09-07 22:40:51,538 INFO L78 Accepts]: Start accepts. Automaton has 95283 states and 104985 transitions. Word has length 1246 [2019-09-07 22:40:51,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:40:51,540 INFO L475 AbstractCegarLoop]: Abstraction has 95283 states and 104985 transitions. [2019-09-07 22:40:51,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 22:40:51,540 INFO L276 IsEmpty]: Start isEmpty. Operand 95283 states and 104985 transitions. [2019-09-07 22:40:51,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1344 [2019-09-07 22:40:51,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:40:51,598 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 22:40:51,598 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:40:51,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:40:51,599 INFO L82 PathProgramCache]: Analyzing trace with hash -882254252, now seen corresponding path program 1 times [2019-09-07 22:40:51,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:40:51,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:40:51,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:40:51,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:40:51,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:40:51,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:40:53,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2190 backedges. 636 proven. 345 refuted. 0 times theorem prover too weak. 1209 trivial. 0 not checked. [2019-09-07 22:40:53,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:40:53,229 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:40:53,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:40:53,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:40:53,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 1792 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 22:40:53,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:40:53,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:40:55,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2190 backedges. 1316 proven. 2 refuted. 0 times theorem prover too weak. 872 trivial. 0 not checked. [2019-09-07 22:40:55,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:40:55,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-09-07 22:40:55,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 22:40:55,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 22:40:55,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-07 22:40:55,389 INFO L87 Difference]: Start difference. First operand 95283 states and 104985 transitions. Second operand 10 states. [2019-09-07 22:41:14,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:41:14,728 INFO L93 Difference]: Finished difference Result 236104 states and 263849 transitions. [2019-09-07 22:41:14,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-07 22:41:14,728 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 1343 [2019-09-07 22:41:14,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:41:15,114 INFO L225 Difference]: With dead ends: 236104 [2019-09-07 22:41:15,114 INFO L226 Difference]: Without dead ends: 141529 [2019-09-07 22:41:15,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1441 GetRequests, 1386 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=506, Invalid=2686, Unknown=0, NotChecked=0, Total=3192 [2019-09-07 22:41:15,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141529 states. [2019-09-07 22:41:16,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141529 to 137991. [2019-09-07 22:41:16,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137991 states. [2019-09-07 22:41:17,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137991 states to 137991 states and 151397 transitions. [2019-09-07 22:41:17,041 INFO L78 Accepts]: Start accepts. Automaton has 137991 states and 151397 transitions. Word has length 1343 [2019-09-07 22:41:17,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:41:17,042 INFO L475 AbstractCegarLoop]: Abstraction has 137991 states and 151397 transitions. [2019-09-07 22:41:17,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 22:41:17,042 INFO L276 IsEmpty]: Start isEmpty. Operand 137991 states and 151397 transitions. [2019-09-07 22:41:17,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1554 [2019-09-07 22:41:17,113 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:41:17,114 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 22:41:17,114 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:41:17,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:41:17,115 INFO L82 PathProgramCache]: Analyzing trace with hash 241574432, now seen corresponding path program 1 times [2019-09-07 22:41:17,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:41:17,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:41:17,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:41:17,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:41:17,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:41:17,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:41:20,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2930 backedges. 668 proven. 112 refuted. 0 times theorem prover too weak. 2150 trivial. 0 not checked. [2019-09-07 22:41:20,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:41:20,674 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:41:20,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:41:20,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:41:21,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 1999 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 22:41:21,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:41:21,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2930 backedges. 1380 proven. 2 refuted. 0 times theorem prover too weak. 1548 trivial. 0 not checked. [2019-09-07 22:41:21,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:41:21,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 22:41:21,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 22:41:21,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 22:41:21,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 22:41:21,837 INFO L87 Difference]: Start difference. First operand 137991 states and 151397 transitions. Second operand 9 states. [2019-09-07 22:41:29,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:41:29,102 INFO L93 Difference]: Finished difference Result 275346 states and 302472 transitions. [2019-09-07 22:41:29,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 22:41:29,103 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1553 [2019-09-07 22:41:29,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:41:29,471 INFO L225 Difference]: With dead ends: 275346 [2019-09-07 22:41:29,472 INFO L226 Difference]: Without dead ends: 131696 [2019-09-07 22:41:29,652 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1570 GetRequests, 1557 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-09-07 22:41:29,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131696 states. [2019-09-07 22:41:31,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131696 to 128713. [2019-09-07 22:41:31,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128713 states. [2019-09-07 22:41:31,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128713 states to 128713 states and 137634 transitions. [2019-09-07 22:41:31,231 INFO L78 Accepts]: Start accepts. Automaton has 128713 states and 137634 transitions. Word has length 1553 [2019-09-07 22:41:31,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:41:31,232 INFO L475 AbstractCegarLoop]: Abstraction has 128713 states and 137634 transitions. [2019-09-07 22:41:31,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 22:41:31,232 INFO L276 IsEmpty]: Start isEmpty. Operand 128713 states and 137634 transitions. [2019-09-07 22:41:31,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1569 [2019-09-07 22:41:31,269 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:41:31,270 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:31,271 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:41:31,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:41:31,271 INFO L82 PathProgramCache]: Analyzing trace with hash -997239539, now seen corresponding path program 1 times [2019-09-07 22:41:31,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:41:31,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:41:31,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:41:31,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:41:31,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:41:31,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:41:33,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2951 backedges. 1328 proven. 356 refuted. 0 times theorem prover too weak. 1267 trivial. 0 not checked. [2019-09-07 22:41:33,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:41:33,747 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:41:33,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:41:34,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:41:34,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 2016 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 22:41:34,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:41:34,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:41:34,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:34,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:36,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:42:39,502 WARN L188 SmtUtils]: Spent 59.46 s on a formula simplification. DAG size of input: 658 DAG size of output: 60 [2019-09-07 22:42:40,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2951 backedges. 1921 proven. 100 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2019-09-07 22:42:40,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:42:40,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2019-09-07 22:42:40,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 22:42:40,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 22:42:40,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-09-07 22:42:40,691 INFO L87 Difference]: Start difference. First operand 128713 states and 137634 transitions. Second operand 14 states. [2019-09-07 22:42:48,315 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 46 [2019-09-07 22:43:12,780 WARN L188 SmtUtils]: Spent 24.25 s on a formula simplification that was a NOOP. DAG size: 67 [2019-09-07 22:43:13,369 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 48 [2019-09-07 22:43:15,428 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 46 [2019-09-07 22:43:40,194 WARN L188 SmtUtils]: Spent 24.29 s on a formula simplification that was a NOOP. DAG size: 65 [2019-09-07 22:43:42,216 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 45 [2019-09-07 22:43:42,806 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 43 [2019-09-07 22:44:32,650 WARN L188 SmtUtils]: Spent 48.38 s on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-09-07 22:45:21,281 WARN L188 SmtUtils]: Spent 48.52 s on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-09-07 22:45:22,032 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 40 [2019-09-07 22:46:11,523 WARN L188 SmtUtils]: Spent 48.57 s on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-09-07 22:46:16,203 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 39 [2019-09-07 22:46:41,300 WARN L188 SmtUtils]: Spent 24.26 s on a formula simplification that was a NOOP. DAG size: 63 [2019-09-07 22:46:42,892 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 49 [2019-09-07 22:47:08,075 WARN L188 SmtUtils]: Spent 20.47 s on a formula simplification. DAG size of input: 75 DAG size of output: 49 [2019-09-07 22:47:37,877 WARN L188 SmtUtils]: Spent 24.18 s on a formula simplification that was a NOOP. DAG size: 68 [2019-09-07 22:48:30,485 WARN L188 SmtUtils]: Spent 48.57 s on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-09-07 22:48:42,572 WARN L188 SmtUtils]: Spent 4.34 s on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-09-07 22:49:31,525 WARN L188 SmtUtils]: Spent 48.81 s on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2019-09-07 22:50:19,922 WARN L188 SmtUtils]: Spent 48.32 s on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-07 22:51:08,854 WARN L188 SmtUtils]: Spent 48.57 s on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-09-07 22:51:38,268 WARN L188 SmtUtils]: Spent 24.38 s on a formula simplification that was a NOOP. DAG size: 63 [2019-09-07 22:51:41,919 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 41 [2019-09-07 22:52:06,347 WARN L188 SmtUtils]: Spent 24.25 s on a formula simplification that was a NOOP. DAG size: 69 [2019-09-07 22:52:08,743 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 35 [2019-09-07 22:52:33,049 WARN L188 SmtUtils]: Spent 24.26 s on a formula simplification that was a NOOP. DAG size: 65 [2019-09-07 22:52:34,926 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2019-09-07 22:52:40,675 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 42