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/Problem16_label33.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 21:10:37,445 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 21:10:37,447 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 21:10:37,458 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 21:10:37,459 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 21:10:37,460 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 21:10:37,461 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 21:10:37,463 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 21:10:37,465 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 21:10:37,466 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 21:10:37,467 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 21:10:37,468 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 21:10:37,468 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 21:10:37,469 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 21:10:37,470 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 21:10:37,471 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 21:10:37,472 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 21:10:37,473 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 21:10:37,475 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 21:10:37,477 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 21:10:37,479 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 21:10:37,480 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 21:10:37,481 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 21:10:37,482 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 21:10:37,484 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 21:10:37,485 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 21:10:37,485 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 21:10:37,486 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 21:10:37,486 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 21:10:37,488 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 21:10:37,488 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 21:10:37,489 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 21:10:37,489 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 21:10:37,490 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 21:10:37,491 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 21:10:37,492 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 21:10:37,492 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 21:10:37,492 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 21:10:37,493 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 21:10:37,494 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 21:10:37,494 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 21:10:37,495 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 21:10:37,522 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 21:10:37,522 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 21:10:37,523 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 21:10:37,524 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 21:10:37,524 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 21:10:37,524 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 21:10:37,525 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 21:10:37,525 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 21:10:37,525 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 21:10:37,525 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 21:10:37,526 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 21:10:37,526 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 21:10:37,526 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 21:10:37,527 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 21:10:37,527 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 21:10:37,527 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 21:10:37,528 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 21:10:37,528 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 21:10:37,528 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 21:10:37,528 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 21:10:37,528 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 21:10:37,529 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 21:10:37,529 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 21:10:37,529 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 21:10:37,530 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 21:10:37,530 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 21:10:37,530 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 21:10:37,530 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 21:10:37,531 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 21:10:37,575 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 21:10:37,587 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 21:10:37,591 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 21:10:37,593 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 21:10:37,593 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 21:10:37,594 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label33.c [2019-09-07 21:10:37,657 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ed028cf1/f38fab9fa396438c8217b7986ed1e458/FLAG87d338af9 [2019-09-07 21:10:38,329 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 21:10:38,330 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label33.c [2019-09-07 21:10:38,349 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ed028cf1/f38fab9fa396438c8217b7986ed1e458/FLAG87d338af9 [2019-09-07 21:10:38,520 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ed028cf1/f38fab9fa396438c8217b7986ed1e458 [2019-09-07 21:10:38,531 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 21:10:38,532 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 21:10:38,533 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 21:10:38,534 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 21:10:38,537 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 21:10:38,538 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 09:10:38" (1/1) ... [2019-09-07 21:10:38,541 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39e607a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:10:38, skipping insertion in model container [2019-09-07 21:10:38,542 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 09:10:38" (1/1) ... [2019-09-07 21:10:38,549 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 21:10:38,634 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 21:10:39,692 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 21:10:39,697 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 21:10:39,983 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 21:10:40,012 INFO L192 MainTranslator]: Completed translation [2019-09-07 21:10:40,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:10:40 WrapperNode [2019-09-07 21:10:40,013 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 21:10:40,014 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 21:10:40,015 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 21:10:40,015 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 21:10:40,036 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:10:40" (1/1) ... [2019-09-07 21:10:40,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:10:40" (1/1) ... [2019-09-07 21:10:40,095 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:10:40" (1/1) ... [2019-09-07 21:10:40,095 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:10:40" (1/1) ... [2019-09-07 21:10:40,194 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:10:40" (1/1) ... [2019-09-07 21:10:40,234 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:10:40" (1/1) ... [2019-09-07 21:10:40,259 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:10:40" (1/1) ... [2019-09-07 21:10:40,278 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 21:10:40,279 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 21:10:40,279 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 21:10:40,279 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 21:10:40,280 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:10:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 21:10:40,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 21:10:40,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 21:10:40,367 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 21:10:40,368 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 21:10:40,369 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 21:10:40,369 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 21:10:40,369 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 21:10:40,369 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 21:10:40,370 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 21:10:40,370 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 21:10:40,370 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 21:10:40,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 21:10:40,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 21:10:42,891 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 21:10:42,892 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 21:10:42,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 09:10:42 BoogieIcfgContainer [2019-09-07 21:10:42,893 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 21:10:42,895 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 21:10:42,895 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 21:10:42,899 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 21:10:42,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 09:10:38" (1/3) ... [2019-09-07 21:10:42,900 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70304c49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 09:10:42, skipping insertion in model container [2019-09-07 21:10:42,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:10:40" (2/3) ... [2019-09-07 21:10:42,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70304c49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 09:10:42, skipping insertion in model container [2019-09-07 21:10:42,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 09:10:42" (3/3) ... [2019-09-07 21:10:42,909 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem16_label33.c [2019-09-07 21:10:42,923 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 21:10:42,933 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 21:10:42,951 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 21:10:42,998 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 21:10:42,999 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 21:10:42,999 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 21:10:42,999 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 21:10:42,999 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 21:10:42,999 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 21:10:42,999 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 21:10:43,000 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 21:10:43,000 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 21:10:43,038 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states. [2019-09-07 21:10:43,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-07 21:10:43,046 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:10:43,047 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:10:43,050 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:10:43,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:10:43,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1586661862, now seen corresponding path program 1 times [2019-09-07 21:10:43,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:10:43,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:10:43,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:10:43,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:10:43,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:10:43,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:10:43,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:10:43,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:10:43,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 21:10:43,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 21:10:43,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 21:10:43,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 21:10:43,344 INFO L87 Difference]: Start difference. First operand 409 states. Second operand 4 states. [2019-09-07 21:10:47,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:10:47,006 INFO L93 Difference]: Finished difference Result 1509 states and 2834 transitions. [2019-09-07 21:10:47,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 21:10:47,012 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-09-07 21:10:47,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:10:47,041 INFO L225 Difference]: With dead ends: 1509 [2019-09-07 21:10:47,041 INFO L226 Difference]: Without dead ends: 1019 [2019-09-07 21:10:47,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 21:10:47,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2019-09-07 21:10:47,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 682. [2019-09-07 21:10:47,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2019-09-07 21:10:47,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1148 transitions. [2019-09-07 21:10:47,178 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1148 transitions. Word has length 33 [2019-09-07 21:10:47,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:10:47,179 INFO L475 AbstractCegarLoop]: Abstraction has 682 states and 1148 transitions. [2019-09-07 21:10:47,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 21:10:47,181 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1148 transitions. [2019-09-07 21:10:47,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-07 21:10:47,189 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:10:47,190 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:10:47,191 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:10:47,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:10:47,191 INFO L82 PathProgramCache]: Analyzing trace with hash 965328282, now seen corresponding path program 1 times [2019-09-07 21:10:47,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:10:47,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:10:47,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:10:47,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:10:47,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:10:47,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:10:47,446 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:10:47,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:10:47,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 21:10:47,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 21:10:47,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 21:10:47,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 21:10:47,449 INFO L87 Difference]: Start difference. First operand 682 states and 1148 transitions. Second operand 6 states. [2019-09-07 21:10:50,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:10:50,143 INFO L93 Difference]: Finished difference Result 2068 states and 3519 transitions. [2019-09-07 21:10:50,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 21:10:50,144 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2019-09-07 21:10:50,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:10:50,155 INFO L225 Difference]: With dead ends: 2068 [2019-09-07 21:10:50,155 INFO L226 Difference]: Without dead ends: 1392 [2019-09-07 21:10:50,158 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:10:50,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2019-09-07 21:10:50,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1374. [2019-09-07 21:10:50,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1374 states. [2019-09-07 21:10:50,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 2217 transitions. [2019-09-07 21:10:50,220 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 2217 transitions. Word has length 103 [2019-09-07 21:10:50,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:10:50,220 INFO L475 AbstractCegarLoop]: Abstraction has 1374 states and 2217 transitions. [2019-09-07 21:10:50,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 21:10:50,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 2217 transitions. [2019-09-07 21:10:50,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-07 21:10:50,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:10:50,224 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:10:50,224 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:10:50,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:10:50,225 INFO L82 PathProgramCache]: Analyzing trace with hash 456294923, now seen corresponding path program 1 times [2019-09-07 21:10:50,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:10:50,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:10:50,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:10:50,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:10:50,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:10:50,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:10:50,318 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:10:50,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:10:50,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 21:10:50,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 21:10:50,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 21:10:50,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 21:10:50,320 INFO L87 Difference]: Start difference. First operand 1374 states and 2217 transitions. Second operand 5 states. [2019-09-07 21:10:55,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:10:55,046 INFO L93 Difference]: Finished difference Result 3463 states and 5603 transitions. [2019-09-07 21:10:55,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 21:10:55,052 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-09-07 21:10:55,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:10:55,068 INFO L225 Difference]: With dead ends: 3463 [2019-09-07 21:10:55,069 INFO L226 Difference]: Without dead ends: 2095 [2019-09-07 21:10:55,073 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 21:10:55,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2095 states. [2019-09-07 21:10:55,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2095 to 2079. [2019-09-07 21:10:55,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2079 states. [2019-09-07 21:10:55,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 2079 states and 2787 transitions. [2019-09-07 21:10:55,163 INFO L78 Accepts]: Start accepts. Automaton has 2079 states and 2787 transitions. Word has length 104 [2019-09-07 21:10:55,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:10:55,171 INFO L475 AbstractCegarLoop]: Abstraction has 2079 states and 2787 transitions. [2019-09-07 21:10:55,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 21:10:55,172 INFO L276 IsEmpty]: Start isEmpty. Operand 2079 states and 2787 transitions. [2019-09-07 21:10:55,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-07 21:10:55,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:10:55,181 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:10:55,182 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:10:55,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:10:55,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1885889021, now seen corresponding path program 1 times [2019-09-07 21:10:55,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:10:55,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:10:55,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:10:55,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:10:55,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:10:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:10:55,628 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:10:55,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:10:55,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 21:10:55,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 21:10:55,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 21:10:55,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 21:10:55,634 INFO L87 Difference]: Start difference. First operand 2079 states and 2787 transitions. Second operand 6 states. [2019-09-07 21:10:58,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:10:58,344 INFO L93 Difference]: Finished difference Result 6268 states and 8594 transitions. [2019-09-07 21:10:58,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 21:10:58,345 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 196 [2019-09-07 21:10:58,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:10:58,367 INFO L225 Difference]: With dead ends: 6268 [2019-09-07 21:10:58,367 INFO L226 Difference]: Without dead ends: 4195 [2019-09-07 21:10:58,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:10:58,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4195 states. [2019-09-07 21:10:58,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4195 to 4157. [2019-09-07 21:10:58,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4157 states. [2019-09-07 21:10:58,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4157 states to 4157 states and 5576 transitions. [2019-09-07 21:10:58,489 INFO L78 Accepts]: Start accepts. Automaton has 4157 states and 5576 transitions. Word has length 196 [2019-09-07 21:10:58,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:10:58,490 INFO L475 AbstractCegarLoop]: Abstraction has 4157 states and 5576 transitions. [2019-09-07 21:10:58,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 21:10:58,490 INFO L276 IsEmpty]: Start isEmpty. Operand 4157 states and 5576 transitions. [2019-09-07 21:10:58,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-07 21:10:58,495 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:10:58,496 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:10:58,496 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:10:58,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:10:58,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1906768671, now seen corresponding path program 1 times [2019-09-07 21:10:58,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:10:58,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:10:58,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:10:58,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:10:58,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:10:58,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:10:58,874 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:10:58,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:10:58,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 21:10:58,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 21:10:58,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 21:10:58,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 21:10:58,876 INFO L87 Difference]: Start difference. First operand 4157 states and 5576 transitions. Second operand 6 states. [2019-09-07 21:11:01,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:11:01,479 INFO L93 Difference]: Finished difference Result 10099 states and 13758 transitions. [2019-09-07 21:11:01,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 21:11:01,480 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 258 [2019-09-07 21:11:01,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:11:01,511 INFO L225 Difference]: With dead ends: 10099 [2019-09-07 21:11:01,512 INFO L226 Difference]: Without dead ends: 5948 [2019-09-07 21:11:01,523 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:11:01,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5948 states. [2019-09-07 21:11:01,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5948 to 5913. [2019-09-07 21:11:01,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5913 states. [2019-09-07 21:11:01,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5913 states to 5913 states and 7732 transitions. [2019-09-07 21:11:01,668 INFO L78 Accepts]: Start accepts. Automaton has 5913 states and 7732 transitions. Word has length 258 [2019-09-07 21:11:01,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:11:01,669 INFO L475 AbstractCegarLoop]: Abstraction has 5913 states and 7732 transitions. [2019-09-07 21:11:01,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 21:11:01,669 INFO L276 IsEmpty]: Start isEmpty. Operand 5913 states and 7732 transitions. [2019-09-07 21:11:01,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2019-09-07 21:11:01,679 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:11:01,679 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:11:01,680 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:11:01,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:11:01,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1099380394, now seen corresponding path program 1 times [2019-09-07 21:11:01,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:11:01,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:11:01,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:11:01,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:11:01,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:11:01,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:11:02,121 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 278 proven. 2 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-09-07 21:11:02,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:11:02,122 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:11:02,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:11:02,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:11:02,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:11:02,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:11:02,534 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 278 proven. 2 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-09-07 21:11:02,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:11:02,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 21:11:02,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 21:11:02,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 21:11:02,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:11:02,550 INFO L87 Difference]: Start difference. First operand 5913 states and 7732 transitions. Second operand 9 states. [2019-09-07 21:11:07,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:11:07,650 INFO L93 Difference]: Finished difference Result 15864 states and 22384 transitions. [2019-09-07 21:11:07,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 21:11:07,650 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 385 [2019-09-07 21:11:07,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:11:07,735 INFO L225 Difference]: With dead ends: 15864 [2019-09-07 21:11:07,736 INFO L226 Difference]: Without dead ends: 9957 [2019-09-07 21:11:07,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 389 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-09-07 21:11:07,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9957 states. [2019-09-07 21:11:08,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9957 to 9881. [2019-09-07 21:11:08,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9881 states. [2019-09-07 21:11:08,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9881 states to 9881 states and 13394 transitions. [2019-09-07 21:11:08,212 INFO L78 Accepts]: Start accepts. Automaton has 9881 states and 13394 transitions. Word has length 385 [2019-09-07 21:11:08,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:11:08,214 INFO L475 AbstractCegarLoop]: Abstraction has 9881 states and 13394 transitions. [2019-09-07 21:11:08,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 21:11:08,214 INFO L276 IsEmpty]: Start isEmpty. Operand 9881 states and 13394 transitions. [2019-09-07 21:11:08,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-09-07 21:11:08,232 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:11:08,237 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:11:08,237 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:11:08,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:11:08,238 INFO L82 PathProgramCache]: Analyzing trace with hash 536178682, now seen corresponding path program 1 times [2019-09-07 21:11:08,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:11:08,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:11:08,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:11:08,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:11:08,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:11:08,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:11:08,622 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 195 proven. 115 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-09-07 21:11:08,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:11:08,622 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 21:11:08,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:11:08,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:11:08,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:11:08,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:11:09,106 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 395 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-07 21:11:09,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:11:09,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 21:11:09,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 21:11:09,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 21:11:09,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:11:09,124 INFO L87 Difference]: Start difference. First operand 9881 states and 13394 transitions. Second operand 9 states. [2019-09-07 21:11:14,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:11:14,906 INFO L93 Difference]: Finished difference Result 23286 states and 34129 transitions. [2019-09-07 21:11:14,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 21:11:14,907 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 393 [2019-09-07 21:11:14,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:11:15,013 INFO L225 Difference]: With dead ends: 23286 [2019-09-07 21:11:15,013 INFO L226 Difference]: Without dead ends: 13411 [2019-09-07 21:11:15,092 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 399 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2019-09-07 21:11:15,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13411 states. [2019-09-07 21:11:15,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13411 to 13315. [2019-09-07 21:11:15,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13315 states. [2019-09-07 21:11:15,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13315 states to 13315 states and 18688 transitions. [2019-09-07 21:11:15,803 INFO L78 Accepts]: Start accepts. Automaton has 13315 states and 18688 transitions. Word has length 393 [2019-09-07 21:11:15,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:11:15,804 INFO L475 AbstractCegarLoop]: Abstraction has 13315 states and 18688 transitions. [2019-09-07 21:11:15,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 21:11:15,804 INFO L276 IsEmpty]: Start isEmpty. Operand 13315 states and 18688 transitions. [2019-09-07 21:11:15,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2019-09-07 21:11:15,829 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:11:15,831 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 21:11:15,831 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:11:15,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:11:15,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1256990334, now seen corresponding path program 1 times [2019-09-07 21:11:15,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:11:15,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:11:15,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:11:15,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:11:15,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:11:15,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:11:17,523 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 49 proven. 224 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 21:11:17,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:11:17,523 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:11:17,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:11:17,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:11:17,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:11:17,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:11:17,927 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 21:11:17,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 21:11:17,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-09-07 21:11:17,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 21:11:17,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 21:11:17,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 21:11:17,936 INFO L87 Difference]: Start difference. First operand 13315 states and 18688 transitions. Second operand 6 states. [2019-09-07 21:11:21,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:11:21,857 INFO L93 Difference]: Finished difference Result 35505 states and 50427 transitions. [2019-09-07 21:11:21,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 21:11:21,858 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 497 [2019-09-07 21:11:21,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:11:21,958 INFO L225 Difference]: With dead ends: 35505 [2019-09-07 21:11:21,959 INFO L226 Difference]: Without dead ends: 22200 [2019-09-07 21:11:22,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 502 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:11:22,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22200 states. [2019-09-07 21:11:22,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22200 to 18265. [2019-09-07 21:11:22,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18265 states. [2019-09-07 21:11:22,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18265 states to 18265 states and 26114 transitions. [2019-09-07 21:11:22,593 INFO L78 Accepts]: Start accepts. Automaton has 18265 states and 26114 transitions. Word has length 497 [2019-09-07 21:11:22,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:11:22,594 INFO L475 AbstractCegarLoop]: Abstraction has 18265 states and 26114 transitions. [2019-09-07 21:11:22,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 21:11:22,595 INFO L276 IsEmpty]: Start isEmpty. Operand 18265 states and 26114 transitions. [2019-09-07 21:11:22,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 866 [2019-09-07 21:11:22,705 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:11:22,706 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-07 21:11:22,707 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:11:22,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:11:22,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1541824930, now seen corresponding path program 1 times [2019-09-07 21:11:22,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:11:22,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:11:22,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:11:22,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:11:22,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:11:22,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:11:23,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1061 backedges. 678 proven. 2 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2019-09-07 21:11:23,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:11:23,973 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:11:23,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:11:24,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:11:24,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 1127 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:11:24,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:11:24,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1061 backedges. 678 proven. 2 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2019-09-07 21:11:24,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:11:24,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 21:11:24,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 21:11:24,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 21:11:24,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:11:24,798 INFO L87 Difference]: Start difference. First operand 18265 states and 26114 transitions. Second operand 9 states. [2019-09-07 21:11:31,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:11:31,257 INFO L93 Difference]: Finished difference Result 50220 states and 82294 transitions. [2019-09-07 21:11:31,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 21:11:31,258 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 865 [2019-09-07 21:11:31,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:11:31,481 INFO L225 Difference]: With dead ends: 50220 [2019-09-07 21:11:31,481 INFO L226 Difference]: Without dead ends: 24670 [2019-09-07 21:11:31,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 889 GetRequests, 872 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2019-09-07 21:11:31,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24670 states. [2019-09-07 21:11:32,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24670 to 23186. [2019-09-07 21:11:32,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23186 states. [2019-09-07 21:11:34,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23186 states to 23186 states and 32814 transitions. [2019-09-07 21:11:34,072 INFO L78 Accepts]: Start accepts. Automaton has 23186 states and 32814 transitions. Word has length 865 [2019-09-07 21:11:34,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:11:34,074 INFO L475 AbstractCegarLoop]: Abstraction has 23186 states and 32814 transitions. [2019-09-07 21:11:34,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 21:11:34,074 INFO L276 IsEmpty]: Start isEmpty. Operand 23186 states and 32814 transitions. [2019-09-07 21:11:34,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1115 [2019-09-07 21:11:34,218 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:11:34,219 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:11:34,219 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:11:34,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:11:34,220 INFO L82 PathProgramCache]: Analyzing trace with hash -958971413, now seen corresponding path program 1 times [2019-09-07 21:11:34,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:11:34,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:11:34,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:11:34,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:11:34,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:11:34,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:11:37,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1913 backedges. 591 proven. 362 refuted. 0 times theorem prover too weak. 960 trivial. 0 not checked. [2019-09-07 21:11:37,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:11:37,739 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 21:11:37,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:11:37,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:11:37,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 1416 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:11:38,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:11:38,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1913 backedges. 945 proven. 2 refuted. 0 times theorem prover too weak. 966 trivial. 0 not checked. [2019-09-07 21:11:38,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:11:38,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 14 [2019-09-07 21:11:38,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 21:11:38,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 21:11:38,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-09-07 21:11:38,629 INFO L87 Difference]: Start difference. First operand 23186 states and 32814 transitions. Second operand 14 states. [2019-09-07 21:11:43,632 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-07 21:11:43,909 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-09-07 21:11:44,931 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-07 21:11:45,280 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-09-07 21:11:46,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:11:46,571 INFO L93 Difference]: Finished difference Result 45018 states and 60552 transitions. [2019-09-07 21:11:46,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-07 21:11:46,571 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 1114 [2019-09-07 21:11:46,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:11:46,667 INFO L225 Difference]: With dead ends: 45018 [2019-09-07 21:11:46,667 INFO L226 Difference]: Without dead ends: 21713 [2019-09-07 21:11:46,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1189 GetRequests, 1142 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=519, Invalid=1737, Unknown=0, NotChecked=0, Total=2256 [2019-09-07 21:11:46,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21713 states. [2019-09-07 21:11:47,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21713 to 20117. [2019-09-07 21:11:47,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20117 states. [2019-09-07 21:11:47,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20117 states to 20117 states and 23665 transitions. [2019-09-07 21:11:47,347 INFO L78 Accepts]: Start accepts. Automaton has 20117 states and 23665 transitions. Word has length 1114 [2019-09-07 21:11:47,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:11:47,349 INFO L475 AbstractCegarLoop]: Abstraction has 20117 states and 23665 transitions. [2019-09-07 21:11:47,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 21:11:47,349 INFO L276 IsEmpty]: Start isEmpty. Operand 20117 states and 23665 transitions. [2019-09-07 21:11:47,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1254 [2019-09-07 21:11:47,521 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:11:47,522 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-07 21:11:47,523 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:11:47,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:11:47,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1494639650, now seen corresponding path program 1 times [2019-09-07 21:11:47,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:11:47,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:11:47,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:11:47,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:11:47,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:11:47,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:11:48,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 399 proven. 449 refuted. 0 times theorem prover too weak. 2025 trivial. 0 not checked. [2019-09-07 21:11:48,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:11:48,998 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:11:49,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:11:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:11:49,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 1630 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:11:49,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:11:50,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 1771 proven. 2 refuted. 0 times theorem prover too weak. 1100 trivial. 0 not checked. [2019-09-07 21:11:50,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:11:50,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 21:11:50,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 21:11:50,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 21:11:50,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:11:50,019 INFO L87 Difference]: Start difference. First operand 20117 states and 23665 transitions. Second operand 9 states. [2019-09-07 21:11:52,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:11:52,806 INFO L93 Difference]: Finished difference Result 38464 states and 44141 transitions. [2019-09-07 21:11:52,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 21:11:52,807 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1253 [2019-09-07 21:11:52,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:11:52,863 INFO L225 Difference]: With dead ends: 38464 [2019-09-07 21:11:52,864 INFO L226 Difference]: Without dead ends: 19366 [2019-09-07 21:11:53,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1270 GetRequests, 1257 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 21:11:53,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19366 states. [2019-09-07 21:11:53,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19366 to 18303. [2019-09-07 21:11:53,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18303 states. [2019-09-07 21:11:53,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18303 states to 18303 states and 19865 transitions. [2019-09-07 21:11:53,400 INFO L78 Accepts]: Start accepts. Automaton has 18303 states and 19865 transitions. Word has length 1253 [2019-09-07 21:11:53,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:11:53,401 INFO L475 AbstractCegarLoop]: Abstraction has 18303 states and 19865 transitions. [2019-09-07 21:11:53,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 21:11:53,402 INFO L276 IsEmpty]: Start isEmpty. Operand 18303 states and 19865 transitions. [2019-09-07 21:11:53,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1295 [2019-09-07 21:11:53,453 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:11:53,454 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:11:53,454 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:11:53,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:11:53,455 INFO L82 PathProgramCache]: Analyzing trace with hash -475332853, now seen corresponding path program 1 times [2019-09-07 21:11:53,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:11:53,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:11:53,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:11:53,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:11:53,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:11:53,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:11:57,149 INFO L134 CoverageAnalysis]: Checked inductivity of 3005 backedges. 1595 proven. 308 refuted. 0 times theorem prover too weak. 1102 trivial. 0 not checked. [2019-09-07 21:11:57,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:11:57,149 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 21:11:57,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:11:57,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:11:57,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 1674 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:11:57,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:11:58,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3005 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 2805 trivial. 0 not checked. [2019-09-07 21:11:58,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 21:11:58,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-09-07 21:11:58,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 21:11:58,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 21:11:58,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:11:58,596 INFO L87 Difference]: Start difference. First operand 18303 states and 19865 transitions. Second operand 9 states. [2019-09-07 21:12:01,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:12:01,606 INFO L93 Difference]: Finished difference Result 36630 states and 39877 transitions. [2019-09-07 21:12:01,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 21:12:01,606 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1294 [2019-09-07 21:12:01,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:12:01,648 INFO L225 Difference]: With dead ends: 36630 [2019-09-07 21:12:01,648 INFO L226 Difference]: Without dead ends: 21027 [2019-09-07 21:12:01,677 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1322 GetRequests, 1309 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-09-07 21:12:01,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21027 states. [2019-09-07 21:12:01,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21027 to 19322. [2019-09-07 21:12:01,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19322 states. [2019-09-07 21:12:02,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19322 states to 19322 states and 20851 transitions. [2019-09-07 21:12:02,008 INFO L78 Accepts]: Start accepts. Automaton has 19322 states and 20851 transitions. Word has length 1294 [2019-09-07 21:12:02,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:12:02,010 INFO L475 AbstractCegarLoop]: Abstraction has 19322 states and 20851 transitions. [2019-09-07 21:12:02,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 21:12:02,010 INFO L276 IsEmpty]: Start isEmpty. Operand 19322 states and 20851 transitions. [2019-09-07 21:12:02,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1420 [2019-09-07 21:12:02,090 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:12:02,093 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:12:02,093 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:12:02,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:12:02,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1643338406, now seen corresponding path program 1 times [2019-09-07 21:12:02,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:12:02,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:12:02,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:12:02,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:12:02,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:12:02,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:12:08,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3860 backedges. 1424 proven. 1226 refuted. 0 times theorem prover too weak. 1210 trivial. 0 not checked. [2019-09-07 21:12:08,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:12:08,413 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:12:08,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:12:08,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:12:08,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 1838 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 21:12:08,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:12:09,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3860 backedges. 1150 proven. 0 refuted. 0 times theorem prover too weak. 2710 trivial. 0 not checked. [2019-09-07 21:12:09,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 21:12:09,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 18 [2019-09-07 21:12:09,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-07 21:12:09,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-07 21:12:09,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2019-09-07 21:12:09,625 INFO L87 Difference]: Start difference. First operand 19322 states and 20851 transitions. Second operand 18 states. [2019-09-07 21:12:22,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:12:22,931 INFO L93 Difference]: Finished difference Result 36469 states and 39917 transitions. [2019-09-07 21:12:22,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-07 21:12:22,932 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 1419 [2019-09-07 21:12:22,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:12:22,970 INFO L225 Difference]: With dead ends: 36469 [2019-09-07 21:12:22,970 INFO L226 Difference]: Without dead ends: 19847 [2019-09-07 21:12:22,996 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1521 GetRequests, 1458 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1151 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=778, Invalid=3382, Unknown=0, NotChecked=0, Total=4160 [2019-09-07 21:12:23,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19847 states. [2019-09-07 21:12:23,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19847 to 19326. [2019-09-07 21:12:23,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19326 states. [2019-09-07 21:12:23,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19326 states to 19326 states and 20818 transitions. [2019-09-07 21:12:23,336 INFO L78 Accepts]: Start accepts. Automaton has 19326 states and 20818 transitions. Word has length 1419 [2019-09-07 21:12:23,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:12:23,337 INFO L475 AbstractCegarLoop]: Abstraction has 19326 states and 20818 transitions. [2019-09-07 21:12:23,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-07 21:12:23,337 INFO L276 IsEmpty]: Start isEmpty. Operand 19326 states and 20818 transitions. [2019-09-07 21:12:23,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1521 [2019-09-07 21:12:23,401 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:12:23,402 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:12:23,402 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:12:23,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:12:23,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1534363967, now seen corresponding path program 1 times [2019-09-07 21:12:23,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:12:23,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:12:23,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:12:23,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:12:23,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:12:23,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:12:27,832 INFO L134 CoverageAnalysis]: Checked inductivity of 4224 backedges. 885 proven. 588 refuted. 0 times theorem prover too weak. 2751 trivial. 0 not checked. [2019-09-07 21:12:27,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:12:27,833 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:12:27,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:12:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:12:28,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 1934 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-07 21:12:28,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:12:29,604 INFO L134 CoverageAnalysis]: Checked inductivity of 4224 backedges. 1027 proven. 0 refuted. 0 times theorem prover too weak. 3197 trivial. 0 not checked. [2019-09-07 21:12:29,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 21:12:29,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2019-09-07 21:12:29,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 21:12:29,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 21:12:29,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-09-07 21:12:29,611 INFO L87 Difference]: Start difference. First operand 19326 states and 20818 transitions. Second operand 14 states. [2019-09-07 21:12:30,563 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2019-09-07 21:12:36,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:12:36,497 INFO L93 Difference]: Finished difference Result 35417 states and 37772 transitions. [2019-09-07 21:12:36,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-07 21:12:36,497 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 1520 [2019-09-07 21:12:36,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:12:36,520 INFO L225 Difference]: With dead ends: 35417 [2019-09-07 21:12:36,521 INFO L226 Difference]: Without dead ends: 18458 [2019-09-07 21:12:36,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1583 GetRequests, 1539 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=465, Invalid=1515, Unknown=0, NotChecked=0, Total=1980 [2019-09-07 21:12:36,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18458 states. [2019-09-07 21:12:36,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18458 to 14717. [2019-09-07 21:12:36,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14717 states. [2019-09-07 21:12:36,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14717 states to 14717 states and 15422 transitions. [2019-09-07 21:12:36,737 INFO L78 Accepts]: Start accepts. Automaton has 14717 states and 15422 transitions. Word has length 1520 [2019-09-07 21:12:36,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:12:36,737 INFO L475 AbstractCegarLoop]: Abstraction has 14717 states and 15422 transitions. [2019-09-07 21:12:36,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 21:12:36,738 INFO L276 IsEmpty]: Start isEmpty. Operand 14717 states and 15422 transitions. [2019-09-07 21:12:36,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1830 [2019-09-07 21:12:36,781 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:12:36,782 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 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] [2019-09-07 21:12:36,782 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:12:36,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:12:36,783 INFO L82 PathProgramCache]: Analyzing trace with hash -838139310, now seen corresponding path program 1 times [2019-09-07 21:12:36,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:12:36,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:12:36,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:12:36,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:12:36,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:12:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:12:45,144 INFO L134 CoverageAnalysis]: Checked inductivity of 5943 backedges. 1341 proven. 2660 refuted. 0 times theorem prover too weak. 1942 trivial. 0 not checked. [2019-09-07 21:12:45,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:12:45,144 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:12:45,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:12:45,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:12:45,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 2284 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 21:12:45,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:12:45,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:12:47,458 INFO L134 CoverageAnalysis]: Checked inductivity of 5943 backedges. 2821 proven. 5 refuted. 0 times theorem prover too weak. 3117 trivial. 0 not checked. [2019-09-07 21:12:47,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:12:47,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 21 [2019-09-07 21:12:47,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 21:12:47,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 21:12:47,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-09-07 21:12:47,466 INFO L87 Difference]: Start difference. First operand 14717 states and 15422 transitions. Second operand 21 states. [2019-09-07 21:12:52,794 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-07 21:12:54,204 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-07 21:12:54,644 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-07 21:12:57,111 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 41 [2019-09-07 21:12:58,314 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-07 21:12:59,037 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-09-07 21:12:59,457 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-07 21:12:59,689 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-07 21:13:00,401 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-09-07 21:13:01,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:13:01,188 INFO L93 Difference]: Finished difference Result 29594 states and 31053 transitions. [2019-09-07 21:13:01,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-07 21:13:01,189 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 1829 [2019-09-07 21:13:01,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:13:01,217 INFO L225 Difference]: With dead ends: 29594 [2019-09-07 21:13:01,218 INFO L226 Difference]: Without dead ends: 15559 [2019-09-07 21:13:01,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1950 GetRequests, 1874 SyntacticMatches, 6 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1439 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=905, Invalid=4207, Unknown=0, NotChecked=0, Total=5112 [2019-09-07 21:13:01,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15559 states. [2019-09-07 21:13:01,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15559 to 15056. [2019-09-07 21:13:01,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15056 states. [2019-09-07 21:13:01,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15056 states to 15056 states and 15762 transitions. [2019-09-07 21:13:01,407 INFO L78 Accepts]: Start accepts. Automaton has 15056 states and 15762 transitions. Word has length 1829 [2019-09-07 21:13:01,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:13:01,408 INFO L475 AbstractCegarLoop]: Abstraction has 15056 states and 15762 transitions. [2019-09-07 21:13:01,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 21:13:01,408 INFO L276 IsEmpty]: Start isEmpty. Operand 15056 states and 15762 transitions. [2019-09-07 21:13:01,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1864 [2019-09-07 21:13:01,439 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:13:01,440 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-07 21:13:01,440 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:13:01,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:13:01,441 INFO L82 PathProgramCache]: Analyzing trace with hash 37453498, now seen corresponding path program 1 times [2019-09-07 21:13:01,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:13:01,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:13:01,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:13:01,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:13:01,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:13:01,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:13:06,518 INFO L134 CoverageAnalysis]: Checked inductivity of 6673 backedges. 2481 proven. 1492 refuted. 0 times theorem prover too weak. 2700 trivial. 0 not checked. [2019-09-07 21:13:06,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:13:06,518 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:13:06,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:13:06,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:13:06,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 2357 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 21:13:06,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:13:07,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:13:08,612 INFO L134 CoverageAnalysis]: Checked inductivity of 6673 backedges. 2697 proven. 2 refuted. 0 times theorem prover too weak. 3974 trivial. 0 not checked. [2019-09-07 21:13:08,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:13:08,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 21 [2019-09-07 21:13:08,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 21:13:08,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 21:13:08,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2019-09-07 21:13:08,622 INFO L87 Difference]: Start difference. First operand 15056 states and 15762 transitions. Second operand 21 states. [2019-09-07 21:13:10,188 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-07 21:13:10,344 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 36 [2019-09-07 21:13:15,553 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-07 21:13:22,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:13:22,711 INFO L93 Difference]: Finished difference Result 29511 states and 31082 transitions. [2019-09-07 21:13:22,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-07 21:13:22,712 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 1863 [2019-09-07 21:13:22,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:13:22,736 INFO L225 Difference]: With dead ends: 29511 [2019-09-07 21:13:22,736 INFO L226 Difference]: Without dead ends: 15476 [2019-09-07 21:13:22,753 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1970 GetRequests, 1900 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1430 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=821, Invalid=4009, Unknown=0, NotChecked=0, Total=4830 [2019-09-07 21:13:22,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15476 states. [2019-09-07 21:13:22,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15476 to 14710. [2019-09-07 21:13:22,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14710 states. [2019-09-07 21:13:22,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14710 states to 14710 states and 15322 transitions. [2019-09-07 21:13:22,918 INFO L78 Accepts]: Start accepts. Automaton has 14710 states and 15322 transitions. Word has length 1863 [2019-09-07 21:13:22,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:13:22,919 INFO L475 AbstractCegarLoop]: Abstraction has 14710 states and 15322 transitions. [2019-09-07 21:13:22,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 21:13:22,919 INFO L276 IsEmpty]: Start isEmpty. Operand 14710 states and 15322 transitions. [2019-09-07 21:13:22,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1996 [2019-09-07 21:13:22,950 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:13:22,951 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:13:22,951 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:13:22,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:13:22,952 INFO L82 PathProgramCache]: Analyzing trace with hash 895197554, now seen corresponding path program 1 times [2019-09-07 21:13:22,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:13:22,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:13:22,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:13:22,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:13:22,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:13:23,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:13:29,507 INFO L134 CoverageAnalysis]: Checked inductivity of 7666 backedges. 1948 proven. 1546 refuted. 0 times theorem prover too weak. 4172 trivial. 0 not checked. [2019-09-07 21:13:29,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:13:29,507 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 21:13:29,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:13:29,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:13:29,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 2528 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 21:13:29,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:13:30,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:30,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:30,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:30,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:30,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:30,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:30,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:30,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:30,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:30,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:30,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:30,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:30,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:30,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:30,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:30,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:30,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:30,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:30,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:30,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:30,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:30,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:30,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:30,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:30,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:30,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:30,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:31,685 INFO L134 CoverageAnalysis]: Checked inductivity of 7666 backedges. 4532 proven. 2 refuted. 0 times theorem prover too weak. 3132 trivial. 0 not checked. [2019-09-07 21:13:31,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:13:31,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5] total 17 [2019-09-07 21:13:31,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 21:13:31,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 21:13:31,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-09-07 21:13:31,697 INFO L87 Difference]: Start difference. First operand 14710 states and 15322 transitions. Second operand 17 states. [2019-09-07 21:13:49,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:13:49,258 INFO L93 Difference]: Finished difference Result 32810 states and 34267 transitions. [2019-09-07 21:13:49,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-07 21:13:49,259 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 1995 [2019-09-07 21:13:49,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:13:49,282 INFO L225 Difference]: With dead ends: 32810 [2019-09-07 21:13:49,283 INFO L226 Difference]: Without dead ends: 19121 [2019-09-07 21:13:49,294 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2078 GetRequests, 2025 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=586, Invalid=2384, Unknown=0, NotChecked=0, Total=2970 [2019-09-07 21:13:49,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19121 states. [2019-09-07 21:13:49,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19121 to 18441. [2019-09-07 21:13:49,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18441 states. [2019-09-07 21:13:49,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18441 states to 18441 states and 19145 transitions. [2019-09-07 21:13:49,533 INFO L78 Accepts]: Start accepts. Automaton has 18441 states and 19145 transitions. Word has length 1995 [2019-09-07 21:13:49,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:13:49,535 INFO L475 AbstractCegarLoop]: Abstraction has 18441 states and 19145 transitions. [2019-09-07 21:13:49,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 21:13:49,535 INFO L276 IsEmpty]: Start isEmpty. Operand 18441 states and 19145 transitions. [2019-09-07 21:13:49,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2077 [2019-09-07 21:13:49,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:13:49,606 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-07 21:13:49,607 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:13:49,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:13:49,608 INFO L82 PathProgramCache]: Analyzing trace with hash 106170983, now seen corresponding path program 1 times [2019-09-07 21:13:49,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:13:49,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:13:49,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:13:49,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:13:49,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:13:49,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:13:52,625 INFO L134 CoverageAnalysis]: Checked inductivity of 8452 backedges. 1836 proven. 2 refuted. 0 times theorem prover too weak. 6614 trivial. 0 not checked. [2019-09-07 21:13:52,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:13:52,625 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:13:52,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:13:53,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:13:53,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 2614 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 21:13:53,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:13:53,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:53,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:53,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:53,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:53,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:13:53,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:13:56,176 INFO L134 CoverageAnalysis]: Checked inductivity of 8452 backedges. 5500 proven. 10 refuted. 0 times theorem prover too weak. 2942 trivial. 0 not checked. [2019-09-07 21:13:56,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:13:56,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2019-09-07 21:13:56,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 21:13:56,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 21:13:56,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-07 21:13:56,185 INFO L87 Difference]: Start difference. First operand 18441 states and 19145 transitions. Second operand 12 states. [2019-09-07 21:14:03,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:14:03,587 INFO L93 Difference]: Finished difference Result 38966 states and 40552 transitions. [2019-09-07 21:14:03,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-07 21:14:03,588 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 2076 [2019-09-07 21:14:03,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:14:03,615 INFO L225 Difference]: With dead ends: 38966 [2019-09-07 21:14:03,615 INFO L226 Difference]: Without dead ends: 22561 [2019-09-07 21:14:03,630 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2141 GetRequests, 2099 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=330, Invalid=1562, Unknown=0, NotChecked=0, Total=1892 [2019-09-07 21:14:03,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22561 states. [2019-09-07 21:14:03,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22561 to 20523. [2019-09-07 21:14:03,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20523 states. [2019-09-07 21:14:03,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20523 states to 20523 states and 21166 transitions. [2019-09-07 21:14:03,822 INFO L78 Accepts]: Start accepts. Automaton has 20523 states and 21166 transitions. Word has length 2076 [2019-09-07 21:14:03,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:14:03,823 INFO L475 AbstractCegarLoop]: Abstraction has 20523 states and 21166 transitions. [2019-09-07 21:14:03,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 21:14:03,824 INFO L276 IsEmpty]: Start isEmpty. Operand 20523 states and 21166 transitions. [2019-09-07 21:14:03,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2219 [2019-09-07 21:14:03,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:14:03,866 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2019-09-07 21:14:03,866 INFO L418 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:14:03,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:14:03,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1186346209, now seen corresponding path program 1 times [2019-09-07 21:14:03,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:14:03,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:14:03,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:14:03,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:14:03,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:14:04,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:14:13,065 INFO L134 CoverageAnalysis]: Checked inductivity of 9818 backedges. 2610 proven. 1953 refuted. 0 times theorem prover too weak. 5255 trivial. 0 not checked. [2019-09-07 21:14:13,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:14:13,065 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:14:13,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:14:13,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:14:13,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 2792 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 21:14:13,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:14:13,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:14:15,785 INFO L134 CoverageAnalysis]: Checked inductivity of 9818 backedges. 6602 proven. 6 refuted. 0 times theorem prover too weak. 3210 trivial. 0 not checked. [2019-09-07 21:14:15,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:14:15,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 8] total 26 [2019-09-07 21:14:15,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-07 21:14:15,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-07 21:14:15,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2019-09-07 21:14:15,796 INFO L87 Difference]: Start difference. First operand 20523 states and 21166 transitions. Second operand 26 states. [2019-09-07 21:14:18,302 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-09-07 21:14:21,259 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-07 21:14:22,638 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-07 21:14:24,633 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-07 21:14:25,968 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-09-07 21:14:26,171 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-07 21:14:26,746 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-07 21:14:33,726 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-09-07 21:14:34,867 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-07 21:14:36,640 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2019-09-07 21:14:37,244 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-07 21:14:37,498 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 46 [2019-09-07 21:14:38,497 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 41 [2019-09-07 21:14:39,938 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-09-07 21:14:42,445 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-09-07 21:14:43,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:14:43,023 INFO L93 Difference]: Finished difference Result 40094 states and 41423 transitions. [2019-09-07 21:14:43,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-07 21:14:43,024 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 2218 [2019-09-07 21:14:43,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:14:43,057 INFO L225 Difference]: With dead ends: 40094 [2019-09-07 21:14:43,057 INFO L226 Difference]: Without dead ends: 21607 [2019-09-07 21:14:43,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2372 GetRequests, 2270 SyntacticMatches, 3 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2956 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=1546, Invalid=8554, Unknown=0, NotChecked=0, Total=10100 [2019-09-07 21:14:43,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21607 states. [2019-09-07 21:14:43,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21607 to 20869. [2019-09-07 21:14:43,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20869 states. [2019-09-07 21:14:43,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20869 states to 20869 states and 21522 transitions. [2019-09-07 21:14:43,288 INFO L78 Accepts]: Start accepts. Automaton has 20869 states and 21522 transitions. Word has length 2218 [2019-09-07 21:14:43,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:14:43,289 INFO L475 AbstractCegarLoop]: Abstraction has 20869 states and 21522 transitions. [2019-09-07 21:14:43,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-07 21:14:43,289 INFO L276 IsEmpty]: Start isEmpty. Operand 20869 states and 21522 transitions. [2019-09-07 21:14:43,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2322 [2019-09-07 21:14:43,331 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:14:43,332 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:14:43,333 INFO L418 AbstractCegarLoop]: === Iteration 20 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:14:43,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:14:43,333 INFO L82 PathProgramCache]: Analyzing trace with hash 691923774, now seen corresponding path program 1 times [2019-09-07 21:14:43,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:14:43,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:14:43,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:14:43,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:14:43,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:14:43,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:14:46,997 INFO L134 CoverageAnalysis]: Checked inductivity of 9419 backedges. 1023 proven. 1326 refuted. 0 times theorem prover too weak. 7070 trivial. 0 not checked. [2019-09-07 21:14:46,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:14:46,998 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:14:47,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:14:47,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:14:47,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 2883 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:14:47,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:14:49,494 INFO L134 CoverageAnalysis]: Checked inductivity of 9419 backedges. 5657 proven. 2 refuted. 0 times theorem prover too weak. 3760 trivial. 0 not checked. [2019-09-07 21:14:49,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:14:49,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 21:14:49,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 21:14:49,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 21:14:49,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:14:49,504 INFO L87 Difference]: Start difference. First operand 20869 states and 21522 transitions. Second operand 9 states. [2019-09-07 21:14:52,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:14:52,339 INFO L93 Difference]: Finished difference Result 41433 states and 42832 transitions. [2019-09-07 21:14:52,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 21:14:52,340 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 2321 [2019-09-07 21:14:52,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:14:52,372 INFO L225 Difference]: With dead ends: 41433 [2019-09-07 21:14:52,372 INFO L226 Difference]: Without dead ends: 20907 [2019-09-07 21:14:52,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2346 GetRequests, 2329 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2019-09-07 21:14:52,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20907 states. [2019-09-07 21:14:52,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20907 to 19827. [2019-09-07 21:14:52,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19827 states. [2019-09-07 21:14:52,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19827 states to 19827 states and 20269 transitions. [2019-09-07 21:14:52,674 INFO L78 Accepts]: Start accepts. Automaton has 19827 states and 20269 transitions. Word has length 2321 [2019-09-07 21:14:52,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:14:52,677 INFO L475 AbstractCegarLoop]: Abstraction has 19827 states and 20269 transitions. [2019-09-07 21:14:52,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 21:14:52,677 INFO L276 IsEmpty]: Start isEmpty. Operand 19827 states and 20269 transitions. [2019-09-07 21:14:52,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2333 [2019-09-07 21:14:52,776 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:14:52,777 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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] [2019-09-07 21:14:52,777 INFO L418 AbstractCegarLoop]: === Iteration 21 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:14:52,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:14:52,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1268963399, now seen corresponding path program 1 times [2019-09-07 21:14:52,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:14:52,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:14:52,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:14:52,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:14:52,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:14:53,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:14:56,612 INFO L134 CoverageAnalysis]: Checked inductivity of 9794 backedges. 1171 proven. 1596 refuted. 0 times theorem prover too weak. 7027 trivial. 0 not checked. [2019-09-07 21:14:56,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:14:56,613 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:14:56,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:14:57,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:14:57,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 2930 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 21:14:57,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:14:57,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:14:57,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:14:57,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:14:57,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:14:57,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:14:57,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:14:57,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:14:57,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:14:57,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:14:57,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:14:57,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:14:57,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:14:57,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:14:57,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:14:57,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:14:57,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:14:57,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:14:57,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:14:57,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:14:57,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:14:57,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:14:57,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:14:57,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:14:57,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:14:57,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:14:57,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:15:49,291 WARN L188 SmtUtils]: Spent 48.73 s on a formula simplification. DAG size of input: 162 DAG size of output: 57 [2019-09-07 21:15:49,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 21:15:51,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:15:53,991 INFO L134 CoverageAnalysis]: Checked inductivity of 9794 backedges. 6286 proven. 75 refuted. 0 times theorem prover too weak. 3433 trivial. 0 not checked. [2019-09-07 21:15:53,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:15:53,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-09-07 21:15:53,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 21:15:53,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 21:15:53,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=148, Unknown=2, NotChecked=0, Total=182 [2019-09-07 21:15:53,999 INFO L87 Difference]: Start difference. First operand 19827 states and 20269 transitions. Second operand 14 states. [2019-09-07 21:17:02,589 WARN L188 SmtUtils]: Spent 1.04 m on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-09-07 21:17:31,389 WARN L188 SmtUtils]: Spent 24.28 s on a formula simplification that was a NOOP. DAG size: 62 [2019-09-07 21:18:34,173 WARN L188 SmtUtils]: Spent 1.04 m on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-09-07 21:19:21,727 WARN L188 SmtUtils]: Spent 24.36 s on a formula simplification that was a NOOP. DAG size: 66 [2019-09-07 21:21:05,889 WARN L188 SmtUtils]: Spent 1.01 m on a formula simplification. DAG size of input: 76 DAG size of output: 74 [2019-09-07 21:21:26,296 WARN L188 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 81 DAG size of output: 28 [2019-09-07 21:21:32,469 WARN L188 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 64 DAG size of output: 13 [2019-09-07 21:21:36,688 WARN L188 SmtUtils]: Spent 4.15 s on a formula simplification. DAG size of input: 65 DAG size of output: 13 [2019-09-07 21:23:31,488 WARN L188 SmtUtils]: Spent 1.08 m on a formula simplification. DAG size of input: 71 DAG size of output: 70 [2019-09-07 21:23:42,695 WARN L188 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 74 DAG size of output: 22