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/Problem13_label31.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 19:37:53,294 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 19:37:53,296 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 19:37:53,307 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 19:37:53,308 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 19:37:53,309 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 19:37:53,310 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 19:37:53,312 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 19:37:53,313 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 19:37:53,314 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 19:37:53,315 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 19:37:53,316 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 19:37:53,317 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 19:37:53,317 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 19:37:53,318 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 19:37:53,319 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 19:37:53,320 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 19:37:53,321 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 19:37:53,323 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 19:37:53,325 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 19:37:53,326 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 19:37:53,327 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 19:37:53,328 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 19:37:53,329 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 19:37:53,331 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 19:37:53,331 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 19:37:53,331 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 19:37:53,332 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 19:37:53,333 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 19:37:53,334 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 19:37:53,334 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 19:37:53,335 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 19:37:53,335 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 19:37:53,336 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 19:37:53,337 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 19:37:53,337 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 19:37:53,338 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 19:37:53,338 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 19:37:53,338 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 19:37:53,339 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 19:37:53,340 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 19:37:53,340 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 19:37:53,358 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 19:37:53,359 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 19:37:53,360 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 19:37:53,360 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 19:37:53,360 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 19:37:53,361 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 19:37:53,361 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 19:37:53,361 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 19:37:53,361 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 19:37:53,361 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 19:37:53,362 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 19:37:53,362 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 19:37:53,362 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 19:37:53,362 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 19:37:53,362 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 19:37:53,362 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 19:37:53,363 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 19:37:53,363 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 19:37:53,363 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 19:37:53,363 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 19:37:53,363 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 19:37:53,364 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 19:37:53,364 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 19:37:53,364 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 19:37:53,364 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 19:37:53,364 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 19:37:53,365 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 19:37:53,365 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 19:37:53,365 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 19:37:53,392 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 19:37:53,405 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 19:37:53,409 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 19:37:53,411 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 19:37:53,411 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 19:37:53,412 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label31.c [2019-09-07 19:37:53,486 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a18c13c0c/6d1120af78a54505b1a1fa82453712cc/FLAG5c11cac0d [2019-09-07 19:37:54,254 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 19:37:54,257 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label31.c [2019-09-07 19:37:54,305 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a18c13c0c/6d1120af78a54505b1a1fa82453712cc/FLAG5c11cac0d [2019-09-07 19:37:54,788 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a18c13c0c/6d1120af78a54505b1a1fa82453712cc [2019-09-07 19:37:54,800 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 19:37:54,802 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 19:37:54,803 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 19:37:54,803 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 19:37:54,807 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 19:37:54,807 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 07:37:54" (1/1) ... [2019-09-07 19:37:54,810 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14a94f56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:37:54, skipping insertion in model container [2019-09-07 19:37:54,810 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 07:37:54" (1/1) ... [2019-09-07 19:37:54,818 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 19:37:54,984 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 19:37:56,637 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 19:37:56,649 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 19:37:57,375 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 19:37:57,406 INFO L192 MainTranslator]: Completed translation [2019-09-07 19:37:57,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:37:57 WrapperNode [2019-09-07 19:37:57,407 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 19:37:57,408 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 19:37:57,408 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 19:37:57,408 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 19:37:57,422 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:37:57" (1/1) ... [2019-09-07 19:37:57,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:37:57" (1/1) ... [2019-09-07 19:37:57,506 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:37:57" (1/1) ... [2019-09-07 19:37:57,508 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:37:57" (1/1) ... [2019-09-07 19:37:57,632 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:37:57" (1/1) ... [2019-09-07 19:37:57,662 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:37:57" (1/1) ... [2019-09-07 19:37:57,690 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:37:57" (1/1) ... [2019-09-07 19:37:57,719 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 19:37:57,720 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 19:37:57,720 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 19:37:57,720 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 19:37:57,722 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:37:57" (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 19:37:57,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 19:37:57,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 19:37:57,789 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 19:37:57,790 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 19:37:57,790 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2019-09-07 19:37:57,790 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2019-09-07 19:37:57,790 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 19:37:57,790 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 19:37:57,791 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 19:37:57,791 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2019-09-07 19:37:57,791 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2019-09-07 19:37:57,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 19:37:57,792 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 19:37:57,792 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 19:37:57,793 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 19:37:57,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 19:37:57,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 19:38:04,475 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 19:38:04,475 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 19:38:04,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 07:38:04 BoogieIcfgContainer [2019-09-07 19:38:04,480 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 19:38:04,481 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 19:38:04,481 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 19:38:04,484 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 19:38:04,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 07:37:54" (1/3) ... [2019-09-07 19:38:04,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ac253ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 07:38:04, skipping insertion in model container [2019-09-07 19:38:04,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:37:57" (2/3) ... [2019-09-07 19:38:04,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ac253ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 07:38:04, skipping insertion in model container [2019-09-07 19:38:04,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 07:38:04" (3/3) ... [2019-09-07 19:38:04,495 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem13_label31.c [2019-09-07 19:38:04,505 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 19:38:04,516 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 19:38:04,533 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 19:38:04,585 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 19:38:04,586 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 19:38:04,586 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 19:38:04,586 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 19:38:04,586 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 19:38:04,586 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 19:38:04,586 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 19:38:04,587 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 19:38:04,587 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 19:38:04,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states. [2019-09-07 19:38:04,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-07 19:38:04,635 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:38:04,636 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:38:04,638 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:38:04,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:38:04,643 INFO L82 PathProgramCache]: Analyzing trace with hash -444424377, now seen corresponding path program 1 times [2019-09-07 19:38:04,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:38:04,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:38:04,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:38:04,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:38:04,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:38:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:38:05,000 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 19:38:05,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:38:05,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 19:38:05,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 19:38:05,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 19:38:05,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 19:38:05,026 INFO L87 Difference]: Start difference. First operand 1119 states. Second operand 3 states. [2019-09-07 19:38:11,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:38:11,132 INFO L93 Difference]: Finished difference Result 3090 states and 5712 transitions. [2019-09-07 19:38:11,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 19:38:11,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-09-07 19:38:11,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:38:11,166 INFO L225 Difference]: With dead ends: 3090 [2019-09-07 19:38:11,166 INFO L226 Difference]: Without dead ends: 1909 [2019-09-07 19:38:11,180 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 19:38:11,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1909 states. [2019-09-07 19:38:11,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1909 to 1895. [2019-09-07 19:38:11,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1895 states. [2019-09-07 19:38:11,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1895 states to 1895 states and 3364 transitions. [2019-09-07 19:38:11,336 INFO L78 Accepts]: Start accepts. Automaton has 1895 states and 3364 transitions. Word has length 46 [2019-09-07 19:38:11,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:38:11,337 INFO L475 AbstractCegarLoop]: Abstraction has 1895 states and 3364 transitions. [2019-09-07 19:38:11,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 19:38:11,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1895 states and 3364 transitions. [2019-09-07 19:38:11,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-07 19:38:11,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:38:11,344 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:38:11,344 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:38:11,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:38:11,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1135320705, now seen corresponding path program 1 times [2019-09-07 19:38:11,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:38:11,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:38:11,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:38:11,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:38:11,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:38:11,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:38:11,524 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:38:11,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:38:11,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:38:11,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:38:11,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:38:11,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:38:11,528 INFO L87 Difference]: Start difference. First operand 1895 states and 3364 transitions. Second operand 6 states. [2019-09-07 19:38:19,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:38:19,090 INFO L93 Difference]: Finished difference Result 5499 states and 9901 transitions. [2019-09-07 19:38:19,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:38:19,091 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2019-09-07 19:38:19,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:38:19,117 INFO L225 Difference]: With dead ends: 5499 [2019-09-07 19:38:19,117 INFO L226 Difference]: Without dead ends: 3610 [2019-09-07 19:38:19,123 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 19:38:19,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3610 states. [2019-09-07 19:38:19,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3610 to 3579. [2019-09-07 19:38:19,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3579 states. [2019-09-07 19:38:19,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3579 states to 3579 states and 5705 transitions. [2019-09-07 19:38:19,238 INFO L78 Accepts]: Start accepts. Automaton has 3579 states and 5705 transitions. Word has length 128 [2019-09-07 19:38:19,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:38:19,240 INFO L475 AbstractCegarLoop]: Abstraction has 3579 states and 5705 transitions. [2019-09-07 19:38:19,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:38:19,240 INFO L276 IsEmpty]: Start isEmpty. Operand 3579 states and 5705 transitions. [2019-09-07 19:38:19,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-07 19:38:19,250 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:38:19,250 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:38:19,251 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:38:19,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:38:19,252 INFO L82 PathProgramCache]: Analyzing trace with hash -143117103, now seen corresponding path program 1 times [2019-09-07 19:38:19,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:38:19,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:38:19,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:38:19,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:38:19,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:38:19,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:38:19,478 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:38:19,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:38:19,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 19:38:19,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 19:38:19,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 19:38:19,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 19:38:19,482 INFO L87 Difference]: Start difference. First operand 3579 states and 5705 transitions. Second operand 5 states. [2019-09-07 19:38:27,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:38:27,763 INFO L93 Difference]: Finished difference Result 10800 states and 17697 transitions. [2019-09-07 19:38:27,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 19:38:27,765 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-07 19:38:27,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:38:27,807 INFO L225 Difference]: With dead ends: 10800 [2019-09-07 19:38:27,810 INFO L226 Difference]: Without dead ends: 7227 [2019-09-07 19:38:27,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 19:38:27,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7227 states. [2019-09-07 19:38:27,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7227 to 7042. [2019-09-07 19:38:27,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7042 states. [2019-09-07 19:38:28,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7042 states to 7042 states and 10398 transitions. [2019-09-07 19:38:28,004 INFO L78 Accepts]: Start accepts. Automaton has 7042 states and 10398 transitions. Word has length 144 [2019-09-07 19:38:28,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:38:28,004 INFO L475 AbstractCegarLoop]: Abstraction has 7042 states and 10398 transitions. [2019-09-07 19:38:28,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 19:38:28,005 INFO L276 IsEmpty]: Start isEmpty. Operand 7042 states and 10398 transitions. [2019-09-07 19:38:28,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-07 19:38:28,007 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:38:28,008 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:38:28,008 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:38:28,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:38:28,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1397112867, now seen corresponding path program 1 times [2019-09-07 19:38:28,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:38:28,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:38:28,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:38:28,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:38:28,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:38:28,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:38:28,205 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:38:28,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:38:28,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:38:28,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:38:28,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:38:28,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:38:28,207 INFO L87 Difference]: Start difference. First operand 7042 states and 10398 transitions. Second operand 6 states. [2019-09-07 19:38:35,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:38:35,170 INFO L93 Difference]: Finished difference Result 17954 states and 27673 transitions. [2019-09-07 19:38:35,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:38:35,171 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 181 [2019-09-07 19:38:35,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:38:35,222 INFO L225 Difference]: With dead ends: 17954 [2019-09-07 19:38:35,222 INFO L226 Difference]: Without dead ends: 10918 [2019-09-07 19:38:35,240 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 19:38:35,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10918 states. [2019-09-07 19:38:35,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10918 to 10727. [2019-09-07 19:38:35,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10727 states. [2019-09-07 19:38:35,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10727 states to 10727 states and 15561 transitions. [2019-09-07 19:38:35,523 INFO L78 Accepts]: Start accepts. Automaton has 10727 states and 15561 transitions. Word has length 181 [2019-09-07 19:38:35,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:38:35,524 INFO L475 AbstractCegarLoop]: Abstraction has 10727 states and 15561 transitions. [2019-09-07 19:38:35,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:38:35,524 INFO L276 IsEmpty]: Start isEmpty. Operand 10727 states and 15561 transitions. [2019-09-07 19:38:35,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-07 19:38:35,528 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:38:35,529 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:38:35,529 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:38:35,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:38:35,529 INFO L82 PathProgramCache]: Analyzing trace with hash -883864004, now seen corresponding path program 1 times [2019-09-07 19:38:35,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:38:35,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:38:35,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:38:35,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:38:35,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:38:35,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:38:35,815 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:38:35,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:38:35,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:38:35,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:38:35,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:38:35,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:38:35,817 INFO L87 Difference]: Start difference. First operand 10727 states and 15561 transitions. Second operand 6 states. [2019-09-07 19:38:47,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:38:47,351 INFO L93 Difference]: Finished difference Result 37007 states and 59699 transitions. [2019-09-07 19:38:47,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 19:38:47,352 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 203 [2019-09-07 19:38:47,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:38:47,510 INFO L225 Difference]: With dead ends: 37007 [2019-09-07 19:38:47,511 INFO L226 Difference]: Without dead ends: 26286 [2019-09-07 19:38:47,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-09-07 19:38:47,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26286 states. [2019-09-07 19:38:48,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26286 to 26083. [2019-09-07 19:38:48,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26083 states. [2019-09-07 19:38:48,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26083 states to 26083 states and 38087 transitions. [2019-09-07 19:38:48,291 INFO L78 Accepts]: Start accepts. Automaton has 26083 states and 38087 transitions. Word has length 203 [2019-09-07 19:38:48,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:38:48,291 INFO L475 AbstractCegarLoop]: Abstraction has 26083 states and 38087 transitions. [2019-09-07 19:38:48,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:38:48,292 INFO L276 IsEmpty]: Start isEmpty. Operand 26083 states and 38087 transitions. [2019-09-07 19:38:48,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-07 19:38:48,298 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:38:48,299 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:38:48,299 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:38:48,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:38:48,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1532907409, now seen corresponding path program 1 times [2019-09-07 19:38:48,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:38:48,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:38:48,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:38:48,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:38:48,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:38:48,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:38:48,518 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 156 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:38:48,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:38:48,519 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 19:38:48,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:38:48,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:38:48,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 19:38:48,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:38:48,755 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-07 19:38:48,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:38:48,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-07 19:38:48,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 19:38:48,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 19:38:48,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-07 19:38:48,771 INFO L87 Difference]: Start difference. First operand 26083 states and 38087 transitions. Second operand 7 states. [2019-09-07 19:39:08,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:39:08,927 INFO L93 Difference]: Finished difference Result 84841 states and 150404 transitions. [2019-09-07 19:39:08,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 19:39:08,928 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 248 [2019-09-07 19:39:08,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:39:09,303 INFO L225 Difference]: With dead ends: 84841 [2019-09-07 19:39:09,304 INFO L226 Difference]: Without dead ends: 58764 [2019-09-07 19:39:09,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-09-07 19:39:09,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58764 states. [2019-09-07 19:39:11,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58764 to 58690. [2019-09-07 19:39:11,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58690 states. [2019-09-07 19:39:11,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58690 states to 58690 states and 97879 transitions. [2019-09-07 19:39:11,927 INFO L78 Accepts]: Start accepts. Automaton has 58690 states and 97879 transitions. Word has length 248 [2019-09-07 19:39:11,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:39:11,929 INFO L475 AbstractCegarLoop]: Abstraction has 58690 states and 97879 transitions. [2019-09-07 19:39:11,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 19:39:11,936 INFO L276 IsEmpty]: Start isEmpty. Operand 58690 states and 97879 transitions. [2019-09-07 19:39:11,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-09-07 19:39:11,944 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:39:11,944 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:39:11,944 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:39:11,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:39:11,945 INFO L82 PathProgramCache]: Analyzing trace with hash -181510859, now seen corresponding path program 1 times [2019-09-07 19:39:11,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:39:11,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:39:11,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:39:11,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:39:11,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:39:12,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:39:14,017 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 156 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:39:14,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:39:14,018 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 19:39:14,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:39:14,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:39:14,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:39:14,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:39:14,234 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 19:39:14,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:39:14,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-09-07 19:39:14,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 19:39:14,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 19:39:14,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-09-07 19:39:14,240 INFO L87 Difference]: Start difference. First operand 58690 states and 97879 transitions. Second operand 12 states. [2019-09-07 19:39:33,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:39:33,630 INFO L93 Difference]: Finished difference Result 140848 states and 242525 transitions. [2019-09-07 19:39:33,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 19:39:33,631 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 255 [2019-09-07 19:39:33,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:39:34,016 INFO L225 Difference]: With dead ends: 140848 [2019-09-07 19:39:34,016 INFO L226 Difference]: Without dead ends: 82967 [2019-09-07 19:39:34,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2019-09-07 19:39:34,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82967 states. [2019-09-07 19:39:36,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82967 to 76071. [2019-09-07 19:39:36,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76071 states. [2019-09-07 19:39:36,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76071 states to 76071 states and 113339 transitions. [2019-09-07 19:39:36,682 INFO L78 Accepts]: Start accepts. Automaton has 76071 states and 113339 transitions. Word has length 255 [2019-09-07 19:39:36,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:39:36,683 INFO L475 AbstractCegarLoop]: Abstraction has 76071 states and 113339 transitions. [2019-09-07 19:39:36,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 19:39:36,684 INFO L276 IsEmpty]: Start isEmpty. Operand 76071 states and 113339 transitions. [2019-09-07 19:39:36,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-09-07 19:39:36,716 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:39:36,716 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:39:36,717 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:39:36,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:39:36,718 INFO L82 PathProgramCache]: Analyzing trace with hash 729713903, now seen corresponding path program 1 times [2019-09-07 19:39:36,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:39:36,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:39:36,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:39:36,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:39:36,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:39:36,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:39:37,187 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 278 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-07 19:39:37,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:39:37,188 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 19:39:37,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:39:37,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:39:37,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:39:37,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:39:37,453 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 278 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-07 19:39:37,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:39:37,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:39:37,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:39:37,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:39:37,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:39:37,459 INFO L87 Difference]: Start difference. First operand 76071 states and 113339 transitions. Second operand 9 states. [2019-09-07 19:40:02,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:40:02,981 INFO L93 Difference]: Finished difference Result 235992 states and 395539 transitions. [2019-09-07 19:40:02,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-07 19:40:02,982 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 337 [2019-09-07 19:40:02,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:40:03,535 INFO L225 Difference]: With dead ends: 235992 [2019-09-07 19:40:03,535 INFO L226 Difference]: Without dead ends: 160730 [2019-09-07 19:40:03,685 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=283, Invalid=1049, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 19:40:03,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160730 states. [2019-09-07 19:40:09,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160730 to 158254. [2019-09-07 19:40:09,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158254 states. [2019-09-07 19:40:10,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158254 states to 158254 states and 201341 transitions. [2019-09-07 19:40:10,048 INFO L78 Accepts]: Start accepts. Automaton has 158254 states and 201341 transitions. Word has length 337 [2019-09-07 19:40:10,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:40:10,048 INFO L475 AbstractCegarLoop]: Abstraction has 158254 states and 201341 transitions. [2019-09-07 19:40:10,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:40:10,048 INFO L276 IsEmpty]: Start isEmpty. Operand 158254 states and 201341 transitions. [2019-09-07 19:40:10,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2019-09-07 19:40:10,079 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:40:10,080 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:40:10,080 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:40:10,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:40:10,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1457860654, now seen corresponding path program 1 times [2019-09-07 19:40:10,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:40:10,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:40:10,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:40:10,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:40:10,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:40:10,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:40:10,406 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 194 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:40:10,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:40:10,407 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 19:40:10,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:40:10,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:40:10,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:40:10,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:40:10,647 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 194 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:40:10,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:40:10,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:40:10,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:40:10,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:40:10,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:40:10,653 INFO L87 Difference]: Start difference. First operand 158254 states and 201341 transitions. Second operand 9 states. [2019-09-07 19:40:25,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:40:25,846 INFO L93 Difference]: Finished difference Result 296671 states and 388973 transitions. [2019-09-07 19:40:25,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 19:40:25,847 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 401 [2019-09-07 19:40:25,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:40:26,483 INFO L225 Difference]: With dead ends: 296671 [2019-09-07 19:40:26,483 INFO L226 Difference]: Without dead ends: 146469 [2019-09-07 19:40:26,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 402 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-09-07 19:40:26,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146469 states. [2019-09-07 19:40:28,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146469 to 137064. [2019-09-07 19:40:28,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137064 states. [2019-09-07 19:40:29,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137064 states to 137064 states and 165885 transitions. [2019-09-07 19:40:29,437 INFO L78 Accepts]: Start accepts. Automaton has 137064 states and 165885 transitions. Word has length 401 [2019-09-07 19:40:29,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:40:29,438 INFO L475 AbstractCegarLoop]: Abstraction has 137064 states and 165885 transitions. [2019-09-07 19:40:29,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:40:29,438 INFO L276 IsEmpty]: Start isEmpty. Operand 137064 states and 165885 transitions. [2019-09-07 19:40:29,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2019-09-07 19:40:29,464 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:40:29,465 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:40:29,465 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:40:29,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:40:29,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1243959679, now seen corresponding path program 1 times [2019-09-07 19:40:29,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:40:29,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:40:29,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:40:29,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:40:29,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:40:29,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:40:29,767 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 288 proven. 2 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-09-07 19:40:29,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:40:29,767 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 19:40:29,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:40:29,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:40:29,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 679 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 19:40:29,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:40:29,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:40:30,125 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2019-09-07 19:40:30,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:40:30,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 19:40:30,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:40:30,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:40:30,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:40:30,134 INFO L87 Difference]: Start difference. First operand 137064 states and 165885 transitions. Second operand 9 states. [2019-09-07 19:40:55,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:40:55,287 INFO L93 Difference]: Finished difference Result 330748 states and 429011 transitions. [2019-09-07 19:40:55,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-07 19:40:55,288 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 422 [2019-09-07 19:40:55,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:40:56,056 INFO L225 Difference]: With dead ends: 330748 [2019-09-07 19:40:56,057 INFO L226 Difference]: Without dead ends: 194493 [2019-09-07 19:40:56,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 442 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=221, Invalid=835, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 19:40:56,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194493 states. [2019-09-07 19:40:59,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194493 to 192354. [2019-09-07 19:40:59,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192354 states. [2019-09-07 19:40:59,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192354 states to 192354 states and 234716 transitions. [2019-09-07 19:40:59,946 INFO L78 Accepts]: Start accepts. Automaton has 192354 states and 234716 transitions. Word has length 422 [2019-09-07 19:40:59,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:40:59,947 INFO L475 AbstractCegarLoop]: Abstraction has 192354 states and 234716 transitions. [2019-09-07 19:40:59,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:40:59,947 INFO L276 IsEmpty]: Start isEmpty. Operand 192354 states and 234716 transitions. [2019-09-07 19:40:59,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 618 [2019-09-07 19:40:59,984 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:40:59,985 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:40:59,985 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:40:59,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:40:59,986 INFO L82 PathProgramCache]: Analyzing trace with hash 817827642, now seen corresponding path program 1 times [2019-09-07 19:40:59,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:40:59,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:40:59,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:40:59,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:40:59,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:41:00,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:41:00,844 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 188 proven. 359 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 19:41:00,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:41:00,845 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 19:41:00,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:41:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:41:01,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 883 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:41:01,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:41:04,056 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 423 proven. 2 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-07 19:41:04,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:41:04,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 13 [2019-09-07 19:41:04,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 19:41:04,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 19:41:04,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-09-07 19:41:04,064 INFO L87 Difference]: Start difference. First operand 192354 states and 234716 transitions. Second operand 13 states. [2019-09-07 19:41:17,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:41:17,840 INFO L93 Difference]: Finished difference Result 327972 states and 404535 transitions. [2019-09-07 19:41:17,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-07 19:41:17,840 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 617 [2019-09-07 19:41:17,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:41:18,304 INFO L225 Difference]: With dead ends: 327972 [2019-09-07 19:41:18,304 INFO L226 Difference]: Without dead ends: 191731 [2019-09-07 19:41:18,453 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 672 GetRequests, 636 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=261, Invalid=1071, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 19:41:18,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191731 states. [2019-09-07 19:41:20,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191731 to 191350. [2019-09-07 19:41:20,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191350 states. [2019-09-07 19:41:20,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191350 states to 191350 states and 222136 transitions. [2019-09-07 19:41:20,991 INFO L78 Accepts]: Start accepts. Automaton has 191350 states and 222136 transitions. Word has length 617 [2019-09-07 19:41:20,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:41:20,991 INFO L475 AbstractCegarLoop]: Abstraction has 191350 states and 222136 transitions. [2019-09-07 19:41:20,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 19:41:20,992 INFO L276 IsEmpty]: Start isEmpty. Operand 191350 states and 222136 transitions. [2019-09-07 19:41:21,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 774 [2019-09-07 19:41:21,038 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:41:21,039 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 19:41:21,039 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:41:21,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:41:21,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1931859342, now seen corresponding path program 1 times [2019-09-07 19:41:21,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:41:21,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:41:21,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:41:21,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:41:21,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:41:21,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:41:24,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1263 backedges. 250 proven. 493 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2019-09-07 19:41:24,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:41:24,789 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 19:41:24,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:41:24,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:41:24,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 1131 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 19:41:25,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:41:25,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1263 backedges. 665 proven. 2 refuted. 0 times theorem prover too weak. 596 trivial. 0 not checked. [2019-09-07 19:41:25,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:41:25,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2019-09-07 19:41:25,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 19:41:25,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 19:41:25,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-09-07 19:41:25,279 INFO L87 Difference]: Start difference. First operand 191350 states and 222136 transitions. Second operand 12 states. [2019-09-07 19:42:04,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:42:04,168 INFO L93 Difference]: Finished difference Result 550449 states and 641674 transitions. [2019-09-07 19:42:04,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 19:42:04,168 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 773 [2019-09-07 19:42:04,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:42:04,989 INFO L225 Difference]: With dead ends: 550449 [2019-09-07 19:42:04,989 INFO L226 Difference]: Without dead ends: 359105 [2019-09-07 19:42:05,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 823 GetRequests, 790 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=310, Invalid=880, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 19:42:05,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359105 states. [2019-09-07 19:42:14,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359105 to 344473. [2019-09-07 19:42:14,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344473 states. [2019-09-07 19:42:15,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344473 states to 344473 states and 399823 transitions. [2019-09-07 19:42:15,037 INFO L78 Accepts]: Start accepts. Automaton has 344473 states and 399823 transitions. Word has length 773 [2019-09-07 19:42:15,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:42:15,037 INFO L475 AbstractCegarLoop]: Abstraction has 344473 states and 399823 transitions. [2019-09-07 19:42:15,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 19:42:15,038 INFO L276 IsEmpty]: Start isEmpty. Operand 344473 states and 399823 transitions. [2019-09-07 19:42:15,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 878 [2019-09-07 19:42:15,147 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:42:15,148 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:42:15,149 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:42:15,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:42:15,149 INFO L82 PathProgramCache]: Analyzing trace with hash -295555039, now seen corresponding path program 1 times [2019-09-07 19:42:15,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:42:15,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:42:15,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:42:15,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:42:15,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:42:15,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:42:16,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1253 backedges. 405 proven. 208 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2019-09-07 19:42:16,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:42:16,955 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) [2019-09-07 19:42:16,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:42:17,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:42:17,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 1264 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:42:17,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:42:17,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1253 backedges. 905 proven. 2 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2019-09-07 19:42:17,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:42:17,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:42:17,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:42:17,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:42:17,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:42:17,592 INFO L87 Difference]: Start difference. First operand 344473 states and 399823 transitions. Second operand 9 states. [2019-09-07 19:42:34,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:42:34,475 INFO L93 Difference]: Finished difference Result 685485 states and 797445 transitions. [2019-09-07 19:42:34,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 19:42:34,476 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 877 [2019-09-07 19:42:34,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:42:35,307 INFO L225 Difference]: With dead ends: 685485 [2019-09-07 19:42:35,307 INFO L226 Difference]: Without dead ends: 340152 [2019-09-07 19:42:35,663 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 908 GetRequests, 888 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2019-09-07 19:42:35,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340152 states. [2019-09-07 19:42:40,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340152 to 332467. [2019-09-07 19:42:40,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332467 states. [2019-09-07 19:42:40,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332467 states to 332467 states and 363486 transitions. [2019-09-07 19:42:40,852 INFO L78 Accepts]: Start accepts. Automaton has 332467 states and 363486 transitions. Word has length 877 [2019-09-07 19:42:40,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:42:40,853 INFO L475 AbstractCegarLoop]: Abstraction has 332467 states and 363486 transitions. [2019-09-07 19:42:40,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:42:40,853 INFO L276 IsEmpty]: Start isEmpty. Operand 332467 states and 363486 transitions. [2019-09-07 19:42:40,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 919 [2019-09-07 19:42:40,912 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:42:40,912 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:42:40,912 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:42:40,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:42:40,913 INFO L82 PathProgramCache]: Analyzing trace with hash 574095094, now seen corresponding path program 1 times [2019-09-07 19:42:40,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:42:40,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:42:40,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:42:40,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:42:40,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:42:41,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:42:46,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 879 proven. 6 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2019-09-07 19:42:46,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:42:46,344 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 19:42:46,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:42:46,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:42:46,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 1304 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 19:42:46,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:42:46,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:42:47,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 745 proven. 2 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2019-09-07 19:42:47,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:42:47,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2019-09-07 19:42:47,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 19:42:47,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 19:42:47,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-09-07 19:42:47,558 INFO L87 Difference]: Start difference. First operand 332467 states and 363486 transitions. Second operand 13 states. [2019-09-07 19:43:45,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:43:45,012 INFO L93 Difference]: Finished difference Result 790613 states and 878332 transitions. [2019-09-07 19:43:45,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2019-09-07 19:43:45,013 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 918 [2019-09-07 19:43:45,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:43:46,036 INFO L225 Difference]: With dead ends: 790613 [2019-09-07 19:43:46,036 INFO L226 Difference]: Without dead ends: 454003 [2019-09-07 19:43:46,278 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1171 GetRequests, 1030 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8359 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2149, Invalid=18157, Unknown=0, NotChecked=0, Total=20306 [2019-09-07 19:43:46,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454003 states. [2019-09-07 19:43:53,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454003 to 433275. [2019-09-07 19:43:53,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433275 states. [2019-09-07 19:43:54,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433275 states to 433275 states and 473420 transitions. [2019-09-07 19:43:54,023 INFO L78 Accepts]: Start accepts. Automaton has 433275 states and 473420 transitions. Word has length 918 [2019-09-07 19:43:54,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:43:54,023 INFO L475 AbstractCegarLoop]: Abstraction has 433275 states and 473420 transitions. [2019-09-07 19:43:54,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 19:43:54,024 INFO L276 IsEmpty]: Start isEmpty. Operand 433275 states and 473420 transitions. [2019-09-07 19:43:54,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1119 [2019-09-07 19:43:54,094 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:43:54,095 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:43:54,095 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:43:54,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:43:54,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1040677823, now seen corresponding path program 1 times [2019-09-07 19:43:54,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:43:54,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:43:54,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:43:54,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:43:54,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:43:54,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:44:01,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1528 backedges. 835 proven. 38 refuted. 0 times theorem prover too weak. 655 trivial. 0 not checked. [2019-09-07 19:44:01,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:44:01,328 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 19:44:01,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:44:01,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:44:01,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 1530 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:44:01,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:44:02,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1528 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 1318 trivial. 0 not checked. [2019-09-07 19:44:02,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:44:02,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2019-09-07 19:44:02,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 19:44:02,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 19:44:02,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:44:02,120 INFO L87 Difference]: Start difference. First operand 433275 states and 473420 transitions. Second operand 4 states. [2019-09-07 19:44:10,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:44:10,979 INFO L93 Difference]: Finished difference Result 830895 states and 910131 transitions. [2019-09-07 19:44:10,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 19:44:10,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1118 [2019-09-07 19:44:10,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:44:12,715 INFO L225 Difference]: With dead ends: 830895 [2019-09-07 19:44:12,715 INFO L226 Difference]: Without dead ends: 422665 [2019-09-07 19:44:12,970 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1128 GetRequests, 1123 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-07 19:44:13,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422665 states. [2019-09-07 19:44:22,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422665 to 409457. [2019-09-07 19:44:22,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409457 states. [2019-09-07 19:44:24,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409457 states to 409457 states and 444624 transitions. [2019-09-07 19:44:24,049 INFO L78 Accepts]: Start accepts. Automaton has 409457 states and 444624 transitions. Word has length 1118 [2019-09-07 19:44:24,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:44:24,050 INFO L475 AbstractCegarLoop]: Abstraction has 409457 states and 444624 transitions. [2019-09-07 19:44:24,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 19:44:24,051 INFO L276 IsEmpty]: Start isEmpty. Operand 409457 states and 444624 transitions. [2019-09-07 19:44:24,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1354 [2019-09-07 19:44:24,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:44:24,201 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:44:24,201 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:44:24,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:44:24,202 INFO L82 PathProgramCache]: Analyzing trace with hash -240864022, now seen corresponding path program 1 times [2019-09-07 19:44:24,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:44:24,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:44:24,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:44:24,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:44:24,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:44:24,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:44:30,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 391 proven. 133 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2019-09-07 19:44:30,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:44:30,654 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 19:44:30,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:44:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:44:31,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 1742 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-07 19:44:31,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:44:31,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-09-07 19:44:31,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:44:31,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:44:31,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:44:31,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 19:44:31,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 19:44:34,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 774 proven. 2 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2019-09-07 19:44:34,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:44:34,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 15 [2019-09-07 19:44:34,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 19:44:34,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 19:44:34,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-09-07 19:44:34,436 INFO L87 Difference]: Start difference. First operand 409457 states and 444624 transitions. Second operand 15 states. [2019-09-07 19:45:16,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:45:16,178 INFO L93 Difference]: Finished difference Result 1037416 states and 1166293 transitions. [2019-09-07 19:45:16,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-09-07 19:45:16,179 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 1353 [2019-09-07 19:45:16,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:45:17,841 INFO L225 Difference]: With dead ends: 1037416 [2019-09-07 19:45:17,841 INFO L226 Difference]: Without dead ends: 632801 [2019-09-07 19:45:18,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1535 GetRequests, 1426 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4621 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1887, Invalid=10323, Unknown=0, NotChecked=0, Total=12210 [2019-09-07 19:45:18,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632801 states. [2019-09-07 19:45:41,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632801 to 616740. [2019-09-07 19:45:41,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616740 states. [2019-09-07 19:45:43,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616740 states to 616740 states and 667459 transitions. [2019-09-07 19:45:43,279 INFO L78 Accepts]: Start accepts. Automaton has 616740 states and 667459 transitions. Word has length 1353 [2019-09-07 19:45:43,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:45:43,280 INFO L475 AbstractCegarLoop]: Abstraction has 616740 states and 667459 transitions. [2019-09-07 19:45:43,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 19:45:43,280 INFO L276 IsEmpty]: Start isEmpty. Operand 616740 states and 667459 transitions. [2019-09-07 19:45:43,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1404 [2019-09-07 19:45:43,456 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:45:43,457 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:45:43,457 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:45:43,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:45:43,458 INFO L82 PathProgramCache]: Analyzing trace with hash 394248715, now seen corresponding path program 1 times [2019-09-07 19:45:43,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:45:43,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:45:43,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:45:43,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:45:43,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:45:43,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:45:45,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1339 backedges. 358 proven. 147 refuted. 0 times theorem prover too weak. 834 trivial. 0 not checked. [2019-09-07 19:45:45,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:45:45,586 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:45:46,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:45:46,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:45:46,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 1866 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 19:45:46,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:45:46,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:45:52,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1339 backedges. 1057 proven. 2 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2019-09-07 19:45:52,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:45:52,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:45:52,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:45:52,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:45:52,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:45:52,435 INFO L87 Difference]: Start difference. First operand 616740 states and 667459 transitions. Second operand 9 states. [2019-09-07 19:46:32,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:46:32,139 INFO L93 Difference]: Finished difference Result 1326841 states and 1473296 transitions. [2019-09-07 19:46:32,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-07 19:46:32,140 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1403 [2019-09-07 19:46:32,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:46:33,951 INFO L225 Difference]: With dead ends: 1326841 [2019-09-07 19:46:33,951 INFO L226 Difference]: Without dead ends: 736782 [2019-09-07 19:46:34,321 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1509 GetRequests, 1451 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1255 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=553, Invalid=2987, Unknown=0, NotChecked=0, Total=3540 [2019-09-07 19:46:34,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736782 states. [2019-09-07 19:46:44,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736782 to 723909. [2019-09-07 19:46:44,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723909 states. [2019-09-07 19:46:46,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723909 states to 723909 states and 783993 transitions. [2019-09-07 19:46:46,468 INFO L78 Accepts]: Start accepts. Automaton has 723909 states and 783993 transitions. Word has length 1403 [2019-09-07 19:46:46,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:46:46,468 INFO L475 AbstractCegarLoop]: Abstraction has 723909 states and 783993 transitions. [2019-09-07 19:46:46,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:46:46,468 INFO L276 IsEmpty]: Start isEmpty. Operand 723909 states and 783993 transitions. [2019-09-07 19:46:46,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1420 [2019-09-07 19:46:46,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:46:46,643 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:46:46,643 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:46:46,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:46:46,644 INFO L82 PathProgramCache]: Analyzing trace with hash -885989386, now seen corresponding path program 1 times [2019-09-07 19:46:46,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:46:46,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:46:46,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:46:46,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:46:46,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:46:46,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:46:55,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1123 backedges. 402 proven. 132 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2019-09-07 19:46:55,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:46:55,767 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 19:46:55,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:46:56,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:46:56,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 1838 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 19:46:56,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:46:56,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:46:56,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:46:58,241 WARN L188 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 31 DAG size of output: 17 [2019-09-07 19:46:59,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1123 backedges. 743 proven. 13 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-09-07 19:46:59,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:46:59,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2019-09-07 19:46:59,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 19:46:59,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 19:46:59,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-07 19:46:59,221 INFO L87 Difference]: Start difference. First operand 723909 states and 783993 transitions. Second operand 10 states.